./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrcspn_reverse_alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- 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/termination-15/cstrcspn_reverse_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 6e6bf2d6e706b2fafcc380eb0a4d60b5a7a1666b ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:39:27,049 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:39:27,051 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:39:27,069 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:39:27,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:39:27,072 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:39:27,074 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:39:27,089 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:39:27,091 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:39:27,093 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:39:27,096 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:39:27,098 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:39:27,098 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:39:27,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:39:27,105 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:39:27,106 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:39:27,109 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:39:27,111 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:39:27,114 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:39:27,120 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:39:27,125 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:39:27,127 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:39:27,128 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:39:27,130 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:39:27,132 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:39:27,132 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:39:27,133 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:39:27,134 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:39:27,134 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:39:27,135 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:39:27,135 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:39:27,136 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:39:27,137 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:39:27,138 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:39:27,139 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:39:27,139 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:39:27,140 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:39:27,140 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:39:27,140 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:39:27,141 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:39:27,142 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:39:27,143 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:39:27,159 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:39:27,159 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:39:27,161 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:39:27,161 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:39:27,162 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:39:27,162 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:39:27,162 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:39:27,162 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:39:27,163 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:39:27,163 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:39:27,163 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:39:27,164 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:39:27,164 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:39:27,164 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:39:27,164 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:39:27,165 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:39:27,165 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:39:27,165 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:39:27,166 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:39:27,166 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:39:27,166 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:39:27,166 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:39:27,167 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:39:27,167 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:39:27,167 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:39:27,168 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:39:27,168 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:39:27,168 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:39:27,168 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:39:27,169 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:39:27,170 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e6bf2d6e706b2fafcc380eb0a4d60b5a7a1666b [2020-07-29 01:39:27,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:39:27,541 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:39:27,545 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:39:27,547 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:39:27,548 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:39:27,549 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrcspn_reverse_alloca.i [2020-07-29 01:39:27,620 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c48f3874/ece7ff685b32426483d634943f2e6141/FLAGc2355ac39 [2020-07-29 01:39:28,179 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:39:28,180 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcspn_reverse_alloca.i [2020-07-29 01:39:28,201 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c48f3874/ece7ff685b32426483d634943f2e6141/FLAGc2355ac39 [2020-07-29 01:39:28,419 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c48f3874/ece7ff685b32426483d634943f2e6141 [2020-07-29 01:39:28,424 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:39:28,429 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:39:28,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:39:28,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:39:28,435 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:39:28,437 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:39:28" (1/1) ... [2020-07-29 01:39:28,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f77e2fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:28, skipping insertion in model container [2020-07-29 01:39:28,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:39:28" (1/1) ... [2020-07-29 01:39:28,452 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:39:28,509 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:39:28,933 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:39:28,957 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:39:29,058 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:39:29,133 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:39:29,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:29 WrapperNode [2020-07-29 01:39:29,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:39:29,135 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:39:29,135 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:39:29,136 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:39:29,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:29" (1/1) ... [2020-07-29 01:39:29,161 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:29" (1/1) ... [2020-07-29 01:39:29,197 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:39:29,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:39:29,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:39:29,198 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:39:29,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:29" (1/1) ... [2020-07-29 01:39:29,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:29" (1/1) ... [2020-07-29 01:39:29,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:29" (1/1) ... [2020-07-29 01:39:29,213 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:29" (1/1) ... [2020-07-29 01:39:29,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:29" (1/1) ... [2020-07-29 01:39:29,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:29" (1/1) ... [2020-07-29 01:39:29,232 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:29" (1/1) ... [2020-07-29 01:39:29,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:39:29,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:39:29,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:39:29,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:39:29,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:29" (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 01:39:29,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:39:29,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:39:29,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:39:29,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:39:29,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:39:29,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:39:29,865 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:39:29,866 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-29 01:39:29,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:39:29 BoogieIcfgContainer [2020-07-29 01:39:29,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:39:29,874 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:39:29,874 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:39:29,878 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:39:29,879 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:29,879 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:39:28" (1/3) ... [2020-07-29 01:39:29,880 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@91a2fcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:39:29, skipping insertion in model container [2020-07-29 01:39:29,881 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:29,881 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:29" (2/3) ... [2020-07-29 01:39:29,881 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@91a2fcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:39:29, skipping insertion in model container [2020-07-29 01:39:29,882 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:29,882 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:39:29" (3/3) ... [2020-07-29 01:39:29,884 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrcspn_reverse_alloca.i [2020-07-29 01:39:29,946 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:39:29,949 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:39:29,949 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:39:29,949 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:39:29,950 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:39:29,950 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:39:29,950 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:39:29,951 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:39:29,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 01:39:30,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:39:30,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:30,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:30,009 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:39:30,009 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:39:30,009 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:39:30,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 01:39:30,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:39:30,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:30,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:30,015 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:39:30,015 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:39:30,024 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 11#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 12#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 9#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 6#L369-4true [2020-07-29 01:39:30,025 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 18#L369-1true assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 8#L374true assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 5#L369-3true cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 6#L369-4true [2020-07-29 01:39:30,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:30,035 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2020-07-29 01:39:30,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:30,046 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310123067] [2020-07-29 01:39:30,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:30,200 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:30,235 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:30,259 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:30,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:30,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2020-07-29 01:39:30,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:30,261 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051429749] [2020-07-29 01:39:30,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:30,312 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {24#true} is VALID [2020-07-29 01:39:30,313 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; {24#true} is VALID [2020-07-29 01:39:30,314 INFO L280 TraceCheckUtils]: 2: Hoare triple {24#true} assume !true; {25#false} is VALID [2020-07-29 01:39:30,315 INFO L280 TraceCheckUtils]: 3: Hoare triple {25#false} call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); {25#false} is VALID [2020-07-29 01:39:30,315 INFO L280 TraceCheckUtils]: 4: Hoare triple {25#false} assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; {25#false} is VALID [2020-07-29 01:39:30,315 INFO L280 TraceCheckUtils]: 5: Hoare triple {25#false} cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; {25#false} is VALID [2020-07-29 01:39:30,318 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 01:39:30,318 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051429749] [2020-07-29 01:39:30,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:39:30,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:39:30,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715579829] [2020-07-29 01:39:30,326 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:39:30,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:39:30,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-29 01:39:30,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-29 01:39:30,342 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2020-07-29 01:39:30,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:30,388 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2020-07-29 01:39:30,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 01:39:30,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:39:30,403 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:39:30,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2020-07-29 01:39:30,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:39:30,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2020-07-29 01:39:30,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 01:39:30,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 01:39:30,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2020-07-29 01:39:30,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:39:30,416 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-07-29 01:39:30,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2020-07-29 01:39:30,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-29 01:39:30,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:39:30,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 17 transitions. Second operand 13 states. [2020-07-29 01:39:30,445 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 17 transitions. Second operand 13 states. [2020-07-29 01:39:30,446 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand 13 states. [2020-07-29 01:39:30,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:30,448 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2020-07-29 01:39:30,449 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:39:30,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:30,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:30,450 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states and 17 transitions. [2020-07-29 01:39:30,450 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states and 17 transitions. [2020-07-29 01:39:30,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:30,452 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2020-07-29 01:39:30,452 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:39:30,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:30,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:30,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:39:30,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:39:30,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:39:30,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2020-07-29 01:39:30,457 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-07-29 01:39:30,457 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-07-29 01:39:30,457 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:39:30,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:39:30,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:39:30,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:30,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:30,459 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:39:30,459 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:39:30,459 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 47#L369-4 [2020-07-29 01:39:30,459 INFO L796 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 48#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 56#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 53#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 54#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; 44#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 45#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 46#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 47#L369-4 [2020-07-29 01:39:30,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:30,460 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2020-07-29 01:39:30,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:30,460 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648597682] [2020-07-29 01:39:30,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:30,483 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:30,513 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:30,524 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:30,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:30,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2020-07-29 01:39:30,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:30,528 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709352856] [2020-07-29 01:39:30,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:30,545 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:30,556 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:30,561 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:30,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:30,562 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2020-07-29 01:39:30,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:30,562 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490092925] [2020-07-29 01:39:30,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:30,599 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:30,656 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:30,673 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:30,898 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-07-29 01:39:31,348 WARN L193 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 93 [2020-07-29 01:39:31,529 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-07-29 01:39:31,548 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:39:31,549 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:39:31,550 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:39:31,550 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:39:31,551 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:39:31,551 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:31,551 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:39:31,552 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:39:31,552 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn_reverse_alloca.i_Iteration2_Lasso [2020-07-29 01:39:31,552 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:39:31,553 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:39:31,632 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 01:39:31,643 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 01:39:31,650 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 01:39:31,655 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 01:39:31,660 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 01:39:31,665 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 01:39:31,671 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 01:39:31,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 01:39:31,681 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 01:39:31,686 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 01:39:31,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 01:39:31,696 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 01:39:31,701 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 01:39:31,705 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 01:39:31,709 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 01:39:31,714 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 01:39:32,141 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2020-07-29 01:39:32,432 WARN L193 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2020-07-29 01:39:32,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 01:39:32,448 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 01:39:33,608 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2020-07-29 01:39:33,780 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:39:33,786 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:33,791 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 01:39:33,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:33,794 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:33,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:33,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:33,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:33,798 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:33,798 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:33,800 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:33,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 01:39:33,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:33,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:33,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:33,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:33,852 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:33,853 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:33,860 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 01:39:33,911 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 01:39:33,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:33,913 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:33,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:33,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:33,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:33,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:33,916 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 01:39:33,919 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 01:39:33,969 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 01:39:33,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:33,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:33,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:33,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:33,974 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:33,975 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 01:39:33,979 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) [2020-07-29 01:39:34,016 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 01:39:34,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:34,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:34,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:34,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:34,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:34,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:34,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:34,022 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) [2020-07-29 01:39:34,058 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 01:39:34,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:34,060 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:34,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:34,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:34,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:34,061 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:34,062 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:34,064 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) [2020-07-29 01:39:34,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:34,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:34,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:34,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:34,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:34,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:34,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:34,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:34,107 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 01:39:34,151 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 01:39:34,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:34,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:34,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:34,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:34,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:34,154 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:34,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:34,158 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 01:39:34,191 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 01:39:34,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:34,193 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:34,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:34,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:34,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:34,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:34,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:34,209 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 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 01:39:34,238 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 01:39:34,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:34,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:34,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:34,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:34,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:34,240 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:34,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:34,242 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 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:34,266 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 01:39:34,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:34,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:34,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:34,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:34,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:34,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:34,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:34,280 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 01:39:34,312 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 01:39:34,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:34,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:34,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:34,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:34,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:34,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:34,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:34,317 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 01:39:34,340 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 01:39:34,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:34,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:34,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:34,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:34,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:34,344 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:34,344 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:34,346 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) [2020-07-29 01:39:34,374 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:34,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:34,376 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:34,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:34,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:34,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:34,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:34,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:34,378 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) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:34,402 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 01:39:34,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:34,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:34,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:34,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:34,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:34,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:34,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:34,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 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:34,430 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 01:39:34,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:34,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:34,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:34,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:34,436 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:34,436 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:34,439 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 01:39:34,471 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 01:39:34,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:34,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:34,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:34,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:34,497 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:34,497 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:34,517 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 01:39:34,565 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 01:39:34,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:34,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:34,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:34,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:34,584 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:34,585 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:34,610 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:39:34,761 INFO L443 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2020-07-29 01:39:34,761 INFO L444 ModelExtractionUtils]: 22 out of 49 variables were initially zero. Simplification set additionally 24 variables to zero. 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) [2020-07-29 01:39:34,796 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:34,834 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:39:34,835 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:39:34,836 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~sc1~0.offset) = 2*ULTIMATE.start_cstrcspn_~sc1~0.offset + 1 Supporting invariants [] [2020-07-29 01:39:34,938 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2020-07-29 01:39:34,945 INFO L393 LassoCheck]: Loop: "call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);" "assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207;" "call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208;" "assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256);" "assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;" "call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);" "assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212;" "cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset;" [2020-07-29 01:39:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:34,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:35,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:39:35,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:35,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:35,085 INFO L280 TraceCheckUtils]: 0: Hoare triple {92#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {92#unseeded} is VALID [2020-07-29 01:39:35,087 INFO L280 TraceCheckUtils]: 1: Hoare triple {92#unseeded} havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; {92#unseeded} is VALID [2020-07-29 01:39:35,087 INFO L280 TraceCheckUtils]: 2: Hoare triple {92#unseeded} assume !(main_~length1~0 < 1); {92#unseeded} is VALID [2020-07-29 01:39:35,088 INFO L280 TraceCheckUtils]: 3: Hoare triple {92#unseeded} assume !(main_~length2~0 < 1); {92#unseeded} is VALID [2020-07-29 01:39:35,089 INFO L280 TraceCheckUtils]: 4: Hoare triple {92#unseeded} call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; {92#unseeded} is VALID [2020-07-29 01:39:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:35,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:39:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:35,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:35,166 INFO L280 TraceCheckUtils]: 0: Hoare triple {95#(>= oldRank0 (+ (* 2 ULTIMATE.start_cstrcspn_~sc1~0.offset) 1))} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {167#(and (<= (+ (* 2 ULTIMATE.start_cstrcspn_~sc1~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrcspn_~sc1~0.offset))} is VALID [2020-07-29 01:39:35,167 INFO L280 TraceCheckUtils]: 1: Hoare triple {167#(and (<= (+ (* 2 ULTIMATE.start_cstrcspn_~sc1~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrcspn_~sc1~0.offset))} assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; {167#(and (<= (+ (* 2 ULTIMATE.start_cstrcspn_~sc1~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrcspn_~sc1~0.offset))} is VALID [2020-07-29 01:39:35,169 INFO L280 TraceCheckUtils]: 2: Hoare triple {167#(and (<= (+ (* 2 ULTIMATE.start_cstrcspn_~sc1~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrcspn_~sc1~0.offset))} call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; {167#(and (<= (+ (* 2 ULTIMATE.start_cstrcspn_~sc1~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrcspn_~sc1~0.offset))} is VALID [2020-07-29 01:39:35,171 INFO L280 TraceCheckUtils]: 3: Hoare triple {167#(and (<= (+ (* 2 ULTIMATE.start_cstrcspn_~sc1~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrcspn_~sc1~0.offset))} assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); {167#(and (<= (+ (* 2 ULTIMATE.start_cstrcspn_~sc1~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrcspn_~sc1~0.offset))} is VALID [2020-07-29 01:39:35,173 INFO L280 TraceCheckUtils]: 4: Hoare triple {167#(and (<= (+ (* 2 ULTIMATE.start_cstrcspn_~sc1~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrcspn_~sc1~0.offset))} assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; {167#(and (<= (+ (* 2 ULTIMATE.start_cstrcspn_~sc1~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrcspn_~sc1~0.offset))} is VALID [2020-07-29 01:39:35,174 INFO L280 TraceCheckUtils]: 5: Hoare triple {167#(and (<= (+ (* 2 ULTIMATE.start_cstrcspn_~sc1~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrcspn_~sc1~0.offset))} call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); {167#(and (<= (+ (* 2 ULTIMATE.start_cstrcspn_~sc1~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrcspn_~sc1~0.offset))} is VALID [2020-07-29 01:39:35,175 INFO L280 TraceCheckUtils]: 6: Hoare triple {167#(and (<= (+ (* 2 ULTIMATE.start_cstrcspn_~sc1~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrcspn_~sc1~0.offset))} assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; {167#(and (<= (+ (* 2 ULTIMATE.start_cstrcspn_~sc1~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrcspn_~sc1~0.offset))} is VALID [2020-07-29 01:39:35,177 INFO L280 TraceCheckUtils]: 7: Hoare triple {167#(and (<= (+ (* 2 ULTIMATE.start_cstrcspn_~sc1~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrcspn_~sc1~0.offset))} cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; {150#(or unseeded (and (> oldRank0 (+ (* 2 ULTIMATE.start_cstrcspn_~sc1~0.offset) 1)) (>= oldRank0 0)))} is VALID [2020-07-29 01:39:35,177 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 01:39:35,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:39:35,199 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:39:35,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:35,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,205 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 01:39:35,206 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 01:39:35,327 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2020-07-29 01:39:35,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:39:35,330 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:35,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. cyclomatic complexity: 5 [2020-07-29 01:39:35,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:35,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:35,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:39:35,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:35,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:35,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:35,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2020-07-29 01:39:35,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:35,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:35,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:35,346 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 17 transitions. cyclomatic complexity: 5 [2020-07-29 01:39:35,353 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 01:39:35,353 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:39:35,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:35,360 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:39:35,360 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2020-07-29 01:39:35,362 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:39:35,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:35,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:35,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:35,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:35,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:35,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:35,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:35,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:35,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:35,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:39:35,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:39:35,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:39:35,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:39:35,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:39:35,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:39:35,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:35,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:35,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:35,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 8 letters. [2020-07-29 01:39:35,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 8 letters. [2020-07-29 01:39:35,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 8 letters. [2020-07-29 01:39:35,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:35,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:35,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:35,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:35,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:35,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:35,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:35,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:35,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:35,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 8 letters. [2020-07-29 01:39:35,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 8 letters. [2020-07-29 01:39:35,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 8 letters. [2020-07-29 01:39:35,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:39:35,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:39:35,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:39:35,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:39:35,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:39:35,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:39:35,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:35,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:35,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:35,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:35,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:35,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:35,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:35,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:35,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:35,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:35,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:35,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:35,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:35,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:35,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:35,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,426 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:35,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:39:35,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2020-07-29 01:39:35,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:35,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2020-07-29 01:39:35,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2020-07-29 01:39:35,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:35,432 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2020-07-29 01:39:35,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:35,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2020-07-29 01:39:35,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 01:39:35,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:39:35,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2020-07-29 01:39:35,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:39:35,446 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-07-29 01:39:35,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2020-07-29 01:39:35,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-29 01:39:35,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:39:35,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 25 transitions. Second operand 18 states. [2020-07-29 01:39:35,449 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 25 transitions. Second operand 18 states. [2020-07-29 01:39:35,449 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 18 states. [2020-07-29 01:39:35,450 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:35,454 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2020-07-29 01:39:35,454 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2020-07-29 01:39:35,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:35,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:35,455 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states and 25 transitions. [2020-07-29 01:39:35,455 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states and 25 transitions. [2020-07-29 01:39:35,456 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:35,458 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2020-07-29 01:39:35,459 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2020-07-29 01:39:35,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:35,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:35,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:39:35,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:39:35,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-29 01:39:35,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2020-07-29 01:39:35,472 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-07-29 01:39:35,473 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-07-29 01:39:35,473 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:39:35,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2020-07-29 01:39:35,476 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:35,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:35,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:35,477 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:39:35,477 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:39:35,478 INFO L794 eck$LassoCheckResult]: Stem: 231#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 224#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 225#L382 assume !(main_~length1~0 < 1); 226#L382-2 assume !(main_~length2~0 < 1); 223#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 220#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 222#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 232#L372-5 [2020-07-29 01:39:35,478 INFO L796 eck$LassoCheckResult]: Loop: 232#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 227#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 228#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 232#L372-5 [2020-07-29 01:39:35,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:35,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2020-07-29 01:39:35,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:35,480 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368681857] [2020-07-29 01:39:35,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:35,507 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:35,528 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:35,533 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:35,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:35,534 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2020-07-29 01:39:35,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:35,535 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501927751] [2020-07-29 01:39:35,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:35,541 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:35,547 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:35,550 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:35,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:35,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2020-07-29 01:39:35,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:35,551 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220868594] [2020-07-29 01:39:35,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:35,589 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:35,644 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:35,655 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:36,229 WARN L193 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 105 [2020-07-29 01:39:36,406 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-07-29 01:39:36,409 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:39:36,409 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:39:36,410 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:39:36,410 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:39:36,410 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:39:36,410 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:36,410 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:39:36,410 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:39:36,410 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn_reverse_alloca.i_Iteration3_Lasso [2020-07-29 01:39:36,410 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:39:36,411 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:39:36,442 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 01:39:36,446 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 01:39:36,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 01:39:36,455 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 01:39:36,459 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 01:39:36,464 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 01:39:36,469 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 01:39:36,473 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 01:39:36,477 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 01:39:36,480 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 01:39:36,484 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 01:39:36,488 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 01:39:36,491 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 01:39:36,495 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 01:39:36,498 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 01:39:36,854 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2020-07-29 01:39:36,978 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2020-07-29 01:39:36,985 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 01:39:36,988 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 01:39:36,993 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 01:39:37,908 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2020-07-29 01:39:38,228 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:39:38,228 INFO L489 LassoAnalysis]: Using template 'affine'. 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 01:39:38,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 01:39:38,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,236 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:38,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,237 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:38,237 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:38,238 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 01:39:38,262 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 01:39:38,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,265 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:38,265 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:38,270 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 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 01:39:38,294 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 01:39:38,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:38,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,297 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:38,297 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:38,299 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:38,344 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:38,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,347 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:38,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,348 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:38,348 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:38,350 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 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:38,372 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 01:39:38,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,374 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:38,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,374 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:38,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:38,376 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 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 01:39:38,400 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 01:39:38,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,403 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:38,403 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:38,407 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) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:38,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:38,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:38,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,433 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:38,433 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:38,434 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 01:39:38,457 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 01:39:38,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:38,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,461 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:38,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:38,464 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 01:39:38,488 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 01:39:38,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:38,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,490 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:38,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:38,491 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 01:39:38,515 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 01:39:38,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:38,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:38,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:38,522 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 01:39:38,546 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 01:39:38,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,547 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:38,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:38,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:38,552 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 01:39:38,574 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 01:39:38,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,577 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:38,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,578 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:38,578 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:38,579 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 01:39:38,603 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 01:39:38,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,604 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:38,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,605 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:38,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:38,606 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) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:38,630 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 01:39:38,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:38,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:38,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:38,634 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 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 01:39:38,658 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 01:39:38,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,662 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:38,663 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:38,670 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 01:39:38,693 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 01:39:38,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,697 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:38,697 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:38,704 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 01:39:38,725 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 01:39:38,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,728 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:38,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:38,738 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) [2020-07-29 01:39:38,777 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 01:39:38,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,779 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-07-29 01:39:38,779 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2020-07-29 01:39:38,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:38,833 INFO L401 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2020-07-29 01:39:38,833 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2020-07-29 01:39:38,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 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 01:39:38,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 01:39:38,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,996 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:38,996 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:39,009 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 01:39:39,032 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 01:39:39,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:39,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:39,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:39,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:39,035 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:39,035 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:39,039 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 01:39:39,063 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 01:39:39,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:39,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:39,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:39,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:39,074 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:39,074 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:39,097 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:39:39,135 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-07-29 01:39:39,136 INFO L444 ModelExtractionUtils]: 18 out of 49 variables were initially zero. Simplification set additionally 28 variables to zero. 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 01:39:39,146 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:39,152 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:39:39,152 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:39:39,153 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0.offset) = 2*ULTIMATE.start_cstrcspn_~s~0.offset + 1 Supporting invariants [] [2020-07-29 01:39:39,243 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2020-07-29 01:39:39,246 INFO L393 LassoCheck]: Loop: "call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208;" "assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256);" "assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset;" [2020-07-29 01:39:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:39,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:39,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:39:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:39,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:39,299 INFO L280 TraceCheckUtils]: 0: Hoare triple {323#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {323#unseeded} is VALID [2020-07-29 01:39:39,300 INFO L280 TraceCheckUtils]: 1: Hoare triple {323#unseeded} havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; {323#unseeded} is VALID [2020-07-29 01:39:39,301 INFO L280 TraceCheckUtils]: 2: Hoare triple {323#unseeded} assume !(main_~length1~0 < 1); {323#unseeded} is VALID [2020-07-29 01:39:39,302 INFO L280 TraceCheckUtils]: 3: Hoare triple {323#unseeded} assume !(main_~length2~0 < 1); {323#unseeded} is VALID [2020-07-29 01:39:39,302 INFO L280 TraceCheckUtils]: 4: Hoare triple {323#unseeded} call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; {323#unseeded} is VALID [2020-07-29 01:39:39,303 INFO L280 TraceCheckUtils]: 5: Hoare triple {323#unseeded} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {323#unseeded} is VALID [2020-07-29 01:39:39,307 INFO L280 TraceCheckUtils]: 6: Hoare triple {323#unseeded} assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; {323#unseeded} is VALID [2020-07-29 01:39:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:39,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:39:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:39,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:39,342 INFO L280 TraceCheckUtils]: 0: Hoare triple {326#(>= oldRank0 (+ (* 2 ULTIMATE.start_cstrcspn_~s~0.offset) 1))} call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; {429#(and (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (<= (+ (* 2 ULTIMATE.start_cstrcspn_~s~0.offset) 1) oldRank0))} is VALID [2020-07-29 01:39:39,349 INFO L280 TraceCheckUtils]: 1: Hoare triple {429#(and (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (<= (+ (* 2 ULTIMATE.start_cstrcspn_~s~0.offset) 1) oldRank0))} assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); {429#(and (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (<= (+ (* 2 ULTIMATE.start_cstrcspn_~s~0.offset) 1) oldRank0))} is VALID [2020-07-29 01:39:39,351 INFO L280 TraceCheckUtils]: 2: Hoare triple {429#(and (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (<= (+ (* 2 ULTIMATE.start_cstrcspn_~s~0.offset) 1) oldRank0))} assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; {406#(or (and (> oldRank0 (+ (* 2 ULTIMATE.start_cstrcspn_~s~0.offset) 1)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:39:39,351 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 01:39:39,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:39:39,362 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:39:39,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:39,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,363 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 01:39:39,363 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-07-29 01:39:39,436 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 57 transitions. Complement of second has 5 states. [2020-07-29 01:39:39,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:39:39,437 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:39,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. cyclomatic complexity: 9 [2020-07-29 01:39:39,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:39,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:39,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:39:39,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:39,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:39,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:39,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 57 transitions. [2020-07-29 01:39:39,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:39,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:39,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:39,441 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 25 transitions. cyclomatic complexity: 9 [2020-07-29 01:39:39,442 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:39:39,442 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:39:39,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:39,444 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:39:39,444 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 43 states and 57 transitions. cyclomatic complexity: 18 [2020-07-29 01:39:39,445 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:39:39,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:39,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:39,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:39,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:39,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:39,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:39,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:39,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:39,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:39,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 43 letters. Loop has 43 letters. [2020-07-29 01:39:39,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 43 letters. Loop has 43 letters. [2020-07-29 01:39:39,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 43 letters. Loop has 43 letters. [2020-07-29 01:39:39,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:39:39,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:39:39,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:39:39,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:39,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:39,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:39,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:39,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:39,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:39,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:39,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:39,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:39,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:39,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:39,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:39,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:39,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:39,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:39,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:39,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:39,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:39,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:39:39,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:39:39,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:39:39,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:39:39,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:39:39,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:39:39,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,462 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:39,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:39:39,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2020-07-29 01:39:39,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:39,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:39:39,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2020-07-29 01:39:39,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. cyclomatic complexity: 18 [2020-07-29 01:39:39,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:39,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2020-07-29 01:39:39,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:39:39,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:39:39,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2020-07-29 01:39:39,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:39:39,470 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2020-07-29 01:39:39,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2020-07-29 01:39:39,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2020-07-29 01:39:39,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:39:39,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states and 40 transitions. Second operand 24 states. [2020-07-29 01:39:39,473 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states and 40 transitions. Second operand 24 states. [2020-07-29 01:39:39,473 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand 24 states. [2020-07-29 01:39:39,474 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:39,476 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2020-07-29 01:39:39,476 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2020-07-29 01:39:39,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:39,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:39,477 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 30 states and 40 transitions. [2020-07-29 01:39:39,477 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 30 states and 40 transitions. [2020-07-29 01:39:39,478 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:39,480 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2020-07-29 01:39:39,481 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2020-07-29 01:39:39,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:39,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:39,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:39:39,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:39:39,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-29 01:39:39,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2020-07-29 01:39:39,483 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-07-29 01:39:39,483 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-07-29 01:39:39,484 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:39:39,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2020-07-29 01:39:39,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:39,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:39,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:39,485 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:39:39,485 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:39:39,486 INFO L794 eck$LassoCheckResult]: Stem: 502#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 495#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 496#L382 assume !(main_~length1~0 < 1); 497#L382-2 assume !(main_~length2~0 < 1); 494#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 490#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 491#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 504#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 500#L372-1 assume !cstrcspn_#t~short210; 501#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; 486#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 487#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 488#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 489#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 493#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 503#L372-5 [2020-07-29 01:39:39,486 INFO L796 eck$LassoCheckResult]: Loop: 503#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 498#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 499#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 503#L372-5 [2020-07-29 01:39:39,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:39,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2020-07-29 01:39:39,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:39,487 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877910848] [2020-07-29 01:39:39,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:39,507 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:39,534 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:39,545 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:39,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:39,548 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2020-07-29 01:39:39,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:39,548 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511457287] [2020-07-29 01:39:39,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:39,557 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:39,566 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:39,569 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:39,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:39,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2020-07-29 01:39:39,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:39,570 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640119523] [2020-07-29 01:39:39,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:39,737 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 01:39:39,737 INFO L280 TraceCheckUtils]: 1: Hoare triple {638#true} havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; {638#true} is VALID [2020-07-29 01:39:39,738 INFO L280 TraceCheckUtils]: 2: Hoare triple {638#true} assume !(main_~length1~0 < 1); {638#true} is VALID [2020-07-29 01:39:39,738 INFO L280 TraceCheckUtils]: 3: Hoare triple {638#true} assume !(main_~length2~0 < 1); {638#true} is VALID [2020-07-29 01:39:39,738 INFO L280 TraceCheckUtils]: 4: Hoare triple {638#true} call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; {638#true} is VALID [2020-07-29 01:39:39,739 INFO L280 TraceCheckUtils]: 5: Hoare triple {638#true} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {638#true} is VALID [2020-07-29 01:39:39,740 INFO L280 TraceCheckUtils]: 6: Hoare triple {638#true} assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; {640#(and (= ULTIMATE.start_cstrcspn_~s~0.offset ULTIMATE.start_cstrcspn_~s2.offset) (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base))} is VALID [2020-07-29 01:39:39,742 INFO L280 TraceCheckUtils]: 7: Hoare triple {640#(and (= ULTIMATE.start_cstrcspn_~s~0.offset ULTIMATE.start_cstrcspn_~s2.offset) (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base))} call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; {641#(or (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0) |ULTIMATE.start_cstrcspn_#t~short210|)} is VALID [2020-07-29 01:39:39,743 INFO L280 TraceCheckUtils]: 8: Hoare triple {641#(or (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0) |ULTIMATE.start_cstrcspn_#t~short210|)} assume !cstrcspn_#t~short210; {642#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} is VALID [2020-07-29 01:39:39,744 INFO L280 TraceCheckUtils]: 9: Hoare triple {642#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; {642#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} is VALID [2020-07-29 01:39:39,745 INFO L280 TraceCheckUtils]: 10: Hoare triple {642#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); {642#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} is VALID [2020-07-29 01:39:39,746 INFO L280 TraceCheckUtils]: 11: Hoare triple {642#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; {642#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} is VALID [2020-07-29 01:39:39,746 INFO L280 TraceCheckUtils]: 12: Hoare triple {642#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; {642#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} is VALID [2020-07-29 01:39:39,747 INFO L280 TraceCheckUtils]: 13: Hoare triple {642#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {642#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} is VALID [2020-07-29 01:39:39,749 INFO L280 TraceCheckUtils]: 14: Hoare triple {642#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; {643#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s~0.base) ULTIMATE.start_cstrcspn_~s~0.offset))} is VALID [2020-07-29 01:39:39,750 INFO L280 TraceCheckUtils]: 15: Hoare triple {643#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s~0.base) ULTIMATE.start_cstrcspn_~s~0.offset))} call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; {644#(not |ULTIMATE.start_cstrcspn_#t~short210|)} is VALID [2020-07-29 01:39:39,751 INFO L280 TraceCheckUtils]: 16: Hoare triple {644#(not |ULTIMATE.start_cstrcspn_#t~short210|)} assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); {639#false} is VALID [2020-07-29 01:39:39,751 INFO L280 TraceCheckUtils]: 17: Hoare triple {639#false} assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; {639#false} is VALID [2020-07-29 01:39:39,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:39:39,753 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640119523] [2020-07-29 01:39:39,753 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088869886] [2020-07-29 01:39:39,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:39:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:39,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-29 01:39:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:39,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:39,887 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:39:39,893 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 01:39:39,894 INFO L280 TraceCheckUtils]: 1: Hoare triple {638#true} havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; {638#true} is VALID [2020-07-29 01:39:39,894 INFO L280 TraceCheckUtils]: 2: Hoare triple {638#true} assume !(main_~length1~0 < 1); {638#true} is VALID [2020-07-29 01:39:39,895 INFO L280 TraceCheckUtils]: 3: Hoare triple {638#true} assume !(main_~length2~0 < 1); {638#true} is VALID [2020-07-29 01:39:39,895 INFO L280 TraceCheckUtils]: 4: Hoare triple {638#true} call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; {638#true} is VALID [2020-07-29 01:39:39,895 INFO L280 TraceCheckUtils]: 5: Hoare triple {638#true} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {638#true} is VALID [2020-07-29 01:39:39,897 INFO L280 TraceCheckUtils]: 6: Hoare triple {638#true} assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; {640#(and (= ULTIMATE.start_cstrcspn_~s~0.offset ULTIMATE.start_cstrcspn_~s2.offset) (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base))} is VALID [2020-07-29 01:39:39,898 INFO L280 TraceCheckUtils]: 7: Hoare triple {640#(and (= ULTIMATE.start_cstrcspn_~s~0.offset ULTIMATE.start_cstrcspn_~s2.offset) (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base))} call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; {669#(or (and (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0) (not |ULTIMATE.start_cstrcspn_#t~short210|)) (and (not (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)) |ULTIMATE.start_cstrcspn_#t~short210|))} is VALID [2020-07-29 01:39:39,900 INFO L280 TraceCheckUtils]: 8: Hoare triple {669#(or (and (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0) (not |ULTIMATE.start_cstrcspn_#t~short210|)) (and (not (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)) |ULTIMATE.start_cstrcspn_#t~short210|))} assume !cstrcspn_#t~short210; {642#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} is VALID [2020-07-29 01:39:39,901 INFO L280 TraceCheckUtils]: 9: Hoare triple {642#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; {642#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} is VALID [2020-07-29 01:39:39,902 INFO L280 TraceCheckUtils]: 10: Hoare triple {642#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); {642#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} is VALID [2020-07-29 01:39:39,903 INFO L280 TraceCheckUtils]: 11: Hoare triple {642#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; {642#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} is VALID [2020-07-29 01:39:39,904 INFO L280 TraceCheckUtils]: 12: Hoare triple {642#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; {642#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} is VALID [2020-07-29 01:39:39,904 INFO L280 TraceCheckUtils]: 13: Hoare triple {642#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {642#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} is VALID [2020-07-29 01:39:39,907 INFO L280 TraceCheckUtils]: 14: Hoare triple {642#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; {643#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s~0.base) ULTIMATE.start_cstrcspn_~s~0.offset))} is VALID [2020-07-29 01:39:39,909 INFO L280 TraceCheckUtils]: 15: Hoare triple {643#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s~0.base) ULTIMATE.start_cstrcspn_~s~0.offset))} call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; {644#(not |ULTIMATE.start_cstrcspn_#t~short210|)} is VALID [2020-07-29 01:39:39,910 INFO L280 TraceCheckUtils]: 16: Hoare triple {644#(not |ULTIMATE.start_cstrcspn_#t~short210|)} assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); {639#false} is VALID [2020-07-29 01:39:39,910 INFO L280 TraceCheckUtils]: 17: Hoare triple {639#false} assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; {639#false} is VALID [2020-07-29 01:39:39,912 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:39:39,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:39:39,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-07-29 01:39:39,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740905134] [2020-07-29 01:39:40,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:39:40,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 01:39:40,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:39:40,029 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 8 states. [2020-07-29 01:39:40,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:40,388 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2020-07-29 01:39:40,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:39:40,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:39:40,419 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:39:40,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2020-07-29 01:39:40,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:40,425 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2020-07-29 01:39:40,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-29 01:39:40,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-29 01:39:40,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2020-07-29 01:39:40,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:39:40,426 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2020-07-29 01:39:40,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2020-07-29 01:39:40,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2020-07-29 01:39:40,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:39:40,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states and 53 transitions. Second operand 28 states. [2020-07-29 01:39:40,429 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states and 53 transitions. Second operand 28 states. [2020-07-29 01:39:40,429 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 28 states. [2020-07-29 01:39:40,430 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:40,432 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2020-07-29 01:39:40,433 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2020-07-29 01:39:40,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:40,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:40,433 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 43 states and 53 transitions. [2020-07-29 01:39:40,433 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 43 states and 53 transitions. [2020-07-29 01:39:40,434 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:40,437 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2020-07-29 01:39:40,437 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2020-07-29 01:39:40,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:40,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:40,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:39:40,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:39:40,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-29 01:39:40,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2020-07-29 01:39:40,439 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-07-29 01:39:40,440 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-07-29 01:39:40,440 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:39:40,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2020-07-29 01:39:40,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:40,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:40,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:40,441 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:39:40,441 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:39:40,441 INFO L794 eck$LassoCheckResult]: Stem: 779#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 772#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 773#L382 assume !(main_~length1~0 < 1); 774#L382-2 assume !(main_~length2~0 < 1); 771#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 767#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 768#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 787#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 777#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 778#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; 763#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 764#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 765#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 766#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 770#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 780#L372-5 [2020-07-29 01:39:40,441 INFO L796 eck$LassoCheckResult]: Loop: 780#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 775#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 776#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 780#L372-5 [2020-07-29 01:39:40,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:40,442 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2020-07-29 01:39:40,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:40,443 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575273345] [2020-07-29 01:39:40,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:40,467 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:40,483 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:40,488 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:40,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:40,489 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2020-07-29 01:39:40,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:40,489 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309010504] [2020-07-29 01:39:40,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:40,494 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:40,497 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:40,499 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:40,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:40,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2020-07-29 01:39:40,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:40,500 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785060950] [2020-07-29 01:39:40,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:40,520 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:40,539 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:40,545 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:41,395 WARN L193 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 139 [2020-07-29 01:39:41,697 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-07-29 01:39:41,700 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:39:41,700 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:39:41,701 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:39:41,701 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:39:41,701 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:39:41,701 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:41,701 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:39:41,701 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:39:41,702 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn_reverse_alloca.i_Iteration5_Lasso [2020-07-29 01:39:41,702 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:39:41,702 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:39:41,732 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 01:39:41,734 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 01:39:41,737 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 01:39:41,741 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 01:39:41,745 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 01:39:41,748 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 01:39:41,751 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 01:39:41,754 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 01:39:41,759 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 01:39:41,762 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 01:39:41,768 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 01:39:41,770 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 01:39:41,774 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 01:39:42,856 WARN L193 SmtUtils]: Spent 834.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 95 [2020-07-29 01:39:42,997 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2020-07-29 01:39:43,013 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 01:39:43,017 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 01:39:43,021 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 01:39:43,025 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 01:39:43,028 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 01:39:43,668 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2020-07-29 01:39:44,813 WARN L193 SmtUtils]: Spent 789.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2020-07-29 01:39:45,048 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2020-07-29 01:39:45,150 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:39:45,151 INFO L489 LassoAnalysis]: Using template 'affine'. 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 01:39:45,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 01:39:45,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:45,156 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:45,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:45,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:45,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:45,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:45,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:45,159 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 01:39:45,182 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 01:39:45,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:45,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:45,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:45,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:45,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:45,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:45,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:45,185 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 01:39:45,208 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 01:39:45,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:45,209 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:45,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:45,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:45,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:45,210 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:45,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:45,211 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 01:39:45,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 01:39:45,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:45,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:45,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:45,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:45,237 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:45,237 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:45,240 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 01:39:45,264 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 01:39:45,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:45,266 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:45,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:45,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:45,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:45,267 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:45,267 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:45,268 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 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 01:39:45,292 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 01:39:45,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:45,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:45,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:45,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:45,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:45,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:45,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:45,295 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 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 01:39:45,323 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 01:39:45,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:45,325 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:45,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:45,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:45,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:45,326 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:45,326 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:45,328 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 01:39:45,352 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 01:39:45,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:45,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:45,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:45,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:45,355 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:45,355 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:45,358 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) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:45,383 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 01:39:45,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:45,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:45,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:45,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:45,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:45,385 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:45,385 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:45,387 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 01:39:45,410 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 01:39:45,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:45,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:45,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:45,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:45,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:45,412 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:45,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:45,413 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) [2020-07-29 01:39:45,439 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 01:39:45,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:45,441 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:45,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:45,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:45,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:45,442 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:45,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:45,444 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 01:39:45,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 01:39:45,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:45,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:45,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:45,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:45,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:45,468 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:45,468 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:45,470 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) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:45,497 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 01:39:45,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:45,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:45,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:45,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:45,503 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:45,503 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:45,511 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 01:39:45,551 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 01:39:45,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:45,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:45,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:45,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:45,554 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:45,554 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:45,557 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) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:45,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 01:39:45,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:45,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:45,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:45,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:45,588 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:45,588 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:45,591 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 01:39:45,615 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 01:39:45,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:45,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:45,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:45,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:45,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:45,618 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:45,621 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 01:39:45,646 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 01:39:45,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:45,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:45,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:45,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:45,657 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:45,658 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:45,681 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:39:45,716 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2020-07-29 01:39:45,717 INFO L444 ModelExtractionUtils]: 33 out of 49 variables were initially zero. Simplification set additionally 13 variables to zero. 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 01:39:45,720 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:39:45,722 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:39:45,722 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:39:45,722 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3 + 2*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2020-07-29 01:39:45,872 INFO L297 tatePredicateManager]: 21 out of 23 supporting invariants were superfluous and have been removed [2020-07-29 01:39:45,879 INFO L393 LassoCheck]: Loop: "call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208;" "assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256);" "assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset;" [2020-07-29 01:39:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:45,886 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:39:45,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:45,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:39:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:45,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:45,991 INFO L280 TraceCheckUtils]: 0: Hoare triple {960#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {960#unseeded} is VALID [2020-07-29 01:39:45,993 INFO L280 TraceCheckUtils]: 1: Hoare triple {960#unseeded} havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; {960#unseeded} is VALID [2020-07-29 01:39:45,993 INFO L280 TraceCheckUtils]: 2: Hoare triple {960#unseeded} assume !(main_~length1~0 < 1); {960#unseeded} is VALID [2020-07-29 01:39:45,994 INFO L280 TraceCheckUtils]: 3: Hoare triple {960#unseeded} assume !(main_~length2~0 < 1); {960#unseeded} is VALID [2020-07-29 01:39:45,996 INFO L280 TraceCheckUtils]: 4: Hoare triple {960#unseeded} call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; {1111#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:45,997 INFO L280 TraceCheckUtils]: 5: Hoare triple {1111#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {1111#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:45,998 INFO L280 TraceCheckUtils]: 6: Hoare triple {1111#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; {1111#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:45,999 INFO L280 TraceCheckUtils]: 7: Hoare triple {1111#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; {1111#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:46,001 INFO L280 TraceCheckUtils]: 8: Hoare triple {1111#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); {1111#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:46,002 INFO L280 TraceCheckUtils]: 9: Hoare triple {1111#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; {1111#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:46,003 INFO L280 TraceCheckUtils]: 10: Hoare triple {1111#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); {1111#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:46,003 INFO L280 TraceCheckUtils]: 11: Hoare triple {1111#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; {1111#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:46,004 INFO L280 TraceCheckUtils]: 12: Hoare triple {1111#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; {1111#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:46,005 INFO L280 TraceCheckUtils]: 13: Hoare triple {1111#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {1111#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:46,006 INFO L280 TraceCheckUtils]: 14: Hoare triple {1111#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; {1090#(and (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base) (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:46,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:39:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:46,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:46,062 INFO L280 TraceCheckUtils]: 0: Hoare triple {1091#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (* 2 ULTIMATE.start_cstrcspn_~s~0.offset))) (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base) (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base))} call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; {1142#(and (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base) (<= (+ (* 2 ULTIMATE.start_cstrcspn_~s~0.offset) (select |#length| |ULTIMATE.start_main_#t~malloc216.base|)) oldRank0) (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} is VALID [2020-07-29 01:39:46,064 INFO L280 TraceCheckUtils]: 1: Hoare triple {1142#(and (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base) (<= (+ (* 2 ULTIMATE.start_cstrcspn_~s~0.offset) (select |#length| |ULTIMATE.start_main_#t~malloc216.base|)) oldRank0) (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); {1142#(and (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base) (<= (+ (* 2 ULTIMATE.start_cstrcspn_~s~0.offset) (select |#length| |ULTIMATE.start_main_#t~malloc216.base|)) oldRank0) (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} is VALID [2020-07-29 01:39:46,066 INFO L280 TraceCheckUtils]: 2: Hoare triple {1142#(and (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base) (<= (+ (* 2 ULTIMATE.start_cstrcspn_~s~0.offset) (select |#length| |ULTIMATE.start_main_#t~malloc216.base|)) oldRank0) (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; {1093#(and (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base) (or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (* 2 ULTIMATE.start_cstrcspn_~s~0.offset)))) unseeded) (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base))} is VALID [2020-07-29 01:39:46,066 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 01:39:46,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:39:46,089 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 01:39:46,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,090 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 01:39:46,090 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-07-29 01:39:46,214 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 6 states. [2020-07-29 01:39:46,215 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 01:39:46,215 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:46,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. cyclomatic complexity: 11 [2020-07-29 01:39:46,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:46,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:46,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:39:46,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:46,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:46,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:46,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 58 transitions. [2020-07-29 01:39:46,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:46,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:46,218 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:46,218 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 36 transitions. cyclomatic complexity: 11 [2020-07-29 01:39:46,219 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:39:46,219 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:39:46,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:46,220 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:39:46,220 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 46 states and 58 transitions. cyclomatic complexity: 15 [2020-07-29 01:39:46,221 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:39:46,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:46,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:46,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:46,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 46 letters. Loop has 46 letters. [2020-07-29 01:39:46,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 46 letters. Loop has 46 letters. [2020-07-29 01:39:46,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 46 letters. Loop has 46 letters. [2020-07-29 01:39:46,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:39:46,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:39:46,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:39:46,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:46,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:46,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:46,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:39:46,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:39:46,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:39:46,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:39:46,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:39:46,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:39:46,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:46,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:46,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:46,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:39:46,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:39:46,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:39:46,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:39:46,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:39:46,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:39:46,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,234 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:46,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:39:46,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-07-29 01:39:46,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,236 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:39:46,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:46,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:39:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:46,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:46,339 INFO L280 TraceCheckUtils]: 0: Hoare triple {960#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {960#unseeded} is VALID [2020-07-29 01:39:46,340 INFO L280 TraceCheckUtils]: 1: Hoare triple {960#unseeded} havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; {960#unseeded} is VALID [2020-07-29 01:39:46,340 INFO L280 TraceCheckUtils]: 2: Hoare triple {960#unseeded} assume !(main_~length1~0 < 1); {960#unseeded} is VALID [2020-07-29 01:39:46,341 INFO L280 TraceCheckUtils]: 3: Hoare triple {960#unseeded} assume !(main_~length2~0 < 1); {960#unseeded} is VALID [2020-07-29 01:39:46,343 INFO L280 TraceCheckUtils]: 4: Hoare triple {960#unseeded} call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; {1222#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:46,344 INFO L280 TraceCheckUtils]: 5: Hoare triple {1222#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {1222#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:46,345 INFO L280 TraceCheckUtils]: 6: Hoare triple {1222#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; {1222#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:46,346 INFO L280 TraceCheckUtils]: 7: Hoare triple {1222#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; {1222#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:46,347 INFO L280 TraceCheckUtils]: 8: Hoare triple {1222#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); {1222#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:46,353 INFO L280 TraceCheckUtils]: 9: Hoare triple {1222#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; {1222#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:46,354 INFO L280 TraceCheckUtils]: 10: Hoare triple {1222#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); {1222#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:46,355 INFO L280 TraceCheckUtils]: 11: Hoare triple {1222#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; {1222#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:46,356 INFO L280 TraceCheckUtils]: 12: Hoare triple {1222#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; {1222#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:46,357 INFO L280 TraceCheckUtils]: 13: Hoare triple {1222#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {1222#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:46,358 INFO L280 TraceCheckUtils]: 14: Hoare triple {1222#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; {1090#(and (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base) (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:46,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:39:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:46,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:46,404 INFO L280 TraceCheckUtils]: 0: Hoare triple {1091#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (* 2 ULTIMATE.start_cstrcspn_~s~0.offset))) (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base) (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base))} call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; {1253#(and (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base) (<= (+ (* 2 ULTIMATE.start_cstrcspn_~s~0.offset) (select |#length| |ULTIMATE.start_main_#t~malloc216.base|)) oldRank0) (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} is VALID [2020-07-29 01:39:46,406 INFO L280 TraceCheckUtils]: 1: Hoare triple {1253#(and (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base) (<= (+ (* 2 ULTIMATE.start_cstrcspn_~s~0.offset) (select |#length| |ULTIMATE.start_main_#t~malloc216.base|)) oldRank0) (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); {1253#(and (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base) (<= (+ (* 2 ULTIMATE.start_cstrcspn_~s~0.offset) (select |#length| |ULTIMATE.start_main_#t~malloc216.base|)) oldRank0) (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} is VALID [2020-07-29 01:39:46,407 INFO L280 TraceCheckUtils]: 2: Hoare triple {1253#(and (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base) (<= (+ (* 2 ULTIMATE.start_cstrcspn_~s~0.offset) (select |#length| |ULTIMATE.start_main_#t~malloc216.base|)) oldRank0) (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; {1093#(and (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base) (or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (* 2 ULTIMATE.start_cstrcspn_~s~0.offset)))) unseeded) (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base))} is VALID [2020-07-29 01:39:46,407 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 01:39:46,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:39:46,429 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 01:39:46,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,430 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:39:46,431 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-07-29 01:39:46,530 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 6 states. [2020-07-29 01:39:46,530 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 01:39:46,531 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:46,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. cyclomatic complexity: 11 [2020-07-29 01:39:46,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:46,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:46,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:39:46,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:46,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:46,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:46,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 58 transitions. [2020-07-29 01:39:46,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:46,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:46,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:46,534 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 36 transitions. cyclomatic complexity: 11 [2020-07-29 01:39:46,534 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:39:46,534 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:39:46,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:46,535 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:39:46,535 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 46 states and 58 transitions. cyclomatic complexity: 15 [2020-07-29 01:39:46,535 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:39:46,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:46,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:46,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:46,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 46 letters. Loop has 46 letters. [2020-07-29 01:39:46,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 46 letters. Loop has 46 letters. [2020-07-29 01:39:46,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 46 letters. Loop has 46 letters. [2020-07-29 01:39:46,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:39:46,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:39:46,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:39:46,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:46,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:46,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:46,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:39:46,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:39:46,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:39:46,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:39:46,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:39:46,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:39:46,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:46,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:46,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:46,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:39:46,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:39:46,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:39:46,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:39:46,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:39:46,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:39:46,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,546 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:46,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:39:46,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-07-29 01:39:46,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,547 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:39:46,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:46,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:46,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:39:46,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:46,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:46,645 INFO L280 TraceCheckUtils]: 0: Hoare triple {960#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {960#unseeded} is VALID [2020-07-29 01:39:46,646 INFO L280 TraceCheckUtils]: 1: Hoare triple {960#unseeded} havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; {960#unseeded} is VALID [2020-07-29 01:39:46,647 INFO L280 TraceCheckUtils]: 2: Hoare triple {960#unseeded} assume !(main_~length1~0 < 1); {960#unseeded} is VALID [2020-07-29 01:39:46,648 INFO L280 TraceCheckUtils]: 3: Hoare triple {960#unseeded} assume !(main_~length2~0 < 1); {960#unseeded} is VALID [2020-07-29 01:39:46,650 INFO L280 TraceCheckUtils]: 4: Hoare triple {960#unseeded} call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; {1333#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:46,651 INFO L280 TraceCheckUtils]: 5: Hoare triple {1333#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {1333#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:46,656 INFO L280 TraceCheckUtils]: 6: Hoare triple {1333#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; {1333#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:46,657 INFO L280 TraceCheckUtils]: 7: Hoare triple {1333#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; {1333#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:46,658 INFO L280 TraceCheckUtils]: 8: Hoare triple {1333#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); {1333#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:46,659 INFO L280 TraceCheckUtils]: 9: Hoare triple {1333#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; {1333#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:46,659 INFO L280 TraceCheckUtils]: 10: Hoare triple {1333#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); {1333#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:46,660 INFO L280 TraceCheckUtils]: 11: Hoare triple {1333#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; {1333#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:46,660 INFO L280 TraceCheckUtils]: 12: Hoare triple {1333#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; {1333#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:46,661 INFO L280 TraceCheckUtils]: 13: Hoare triple {1333#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {1333#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:46,662 INFO L280 TraceCheckUtils]: 14: Hoare triple {1333#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; {1090#(and (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base) (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:46,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:39:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:46,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:46,717 INFO L280 TraceCheckUtils]: 0: Hoare triple {1091#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (* 2 ULTIMATE.start_cstrcspn_~s~0.offset))) (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base) (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base))} call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; {1364#(and (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base) (<= (+ (* 2 ULTIMATE.start_cstrcspn_~s~0.offset) (select |#length| |ULTIMATE.start_main_#t~malloc216.base|)) oldRank0) (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} is VALID [2020-07-29 01:39:46,719 INFO L280 TraceCheckUtils]: 1: Hoare triple {1364#(and (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base) (<= (+ (* 2 ULTIMATE.start_cstrcspn_~s~0.offset) (select |#length| |ULTIMATE.start_main_#t~malloc216.base|)) oldRank0) (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); {1364#(and (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base) (<= (+ (* 2 ULTIMATE.start_cstrcspn_~s~0.offset) (select |#length| |ULTIMATE.start_main_#t~malloc216.base|)) oldRank0) (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} is VALID [2020-07-29 01:39:46,720 INFO L280 TraceCheckUtils]: 2: Hoare triple {1364#(and (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base) (<= (+ (* 2 ULTIMATE.start_cstrcspn_~s~0.offset) (select |#length| |ULTIMATE.start_main_#t~malloc216.base|)) oldRank0) (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; {1093#(and (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base) (or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (* 2 ULTIMATE.start_cstrcspn_~s~0.offset)))) unseeded) (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base))} is VALID [2020-07-29 01:39:46,720 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 01:39:46,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:39:46,744 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 01:39:46,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,745 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:39:46,745 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-07-29 01:39:46,880 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 45 states and 60 transitions. Complement of second has 5 states. [2020-07-29 01:39:46,880 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 01:39:46,881 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:46,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. cyclomatic complexity: 11 [2020-07-29 01:39:46,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:46,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:46,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:39:46,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:46,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:46,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:46,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 60 transitions. [2020-07-29 01:39:46,883 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:39:46,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:39:46,885 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 36 transitions. cyclomatic complexity: 11 [2020-07-29 01:39:46,885 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:39:46,885 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:39:46,886 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:46,887 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:39:46,887 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 60 transitions. cyclomatic complexity: 18 [2020-07-29 01:39:46,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 60 transitions. cyclomatic complexity: 18 [2020-07-29 01:39:46,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:39:46,887 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:39:46,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 60 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:46,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:46,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 60 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:46,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 45 letters. Loop has 45 letters. [2020-07-29 01:39:46,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 45 letters. Loop has 45 letters. [2020-07-29 01:39:46,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 60 transitions. cyclomatic complexity: 18 Stem has 45 letters. Loop has 45 letters. [2020-07-29 01:39:46,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:39:46,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:39:46,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 60 transitions. cyclomatic complexity: 18 Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:39:46,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:46,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:46,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 60 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:46,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:39:46,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:39:46,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 60 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:39:46,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:39:46,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:39:46,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 60 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:39:46,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 60 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:46,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:46,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 60 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:46,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,900 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:46,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:39:46,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2020-07-29 01:39:46,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:39:46,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2020-07-29 01:39:46,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. cyclomatic complexity: 18 [2020-07-29 01:39:46,906 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:39:46,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2020-07-29 01:39:46,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:39:46,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:39:46,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:39:46,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:39:46,907 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:39:46,907 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:39:46,907 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:39:46,907 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:39:46,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:39:46,908 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:39:46,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:39:46,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:39:46 BoogieIcfgContainer [2020-07-29 01:39:46,914 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:39:46,915 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:39:46,915 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:39:46,915 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:39:46,915 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:39:29" (3/4) ... [2020-07-29 01:39:46,919 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:39:46,919 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:39:46,921 INFO L168 Benchmark]: Toolchain (without parser) took 18495.18 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 403.7 MB). Free memory was 953.5 MB in the beginning and 989.1 MB in the end (delta: -35.6 MB). Peak memory consumption was 368.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:46,922 INFO L168 Benchmark]: CDTParser took 0.31 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 01:39:46,922 INFO L168 Benchmark]: CACSL2BoogieTranslator took 703.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -165.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:46,923 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.30 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 01:39:46,923 INFO L168 Benchmark]: Boogie Preprocessor took 37.05 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:46,924 INFO L168 Benchmark]: RCFGBuilder took 637.99 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: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:46,924 INFO L168 Benchmark]: BuchiAutomizer took 17040.65 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 263.7 MB). Free memory was 1.1 GB in the beginning and 989.1 MB in the end (delta: 87.0 MB). Peak memory consumption was 350.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:46,924 INFO L168 Benchmark]: Witness Printer took 4.83 ms. Allocated memory is still 1.4 GB. Free memory is still 989.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:39:46,927 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.31 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 703.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -165.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.30 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 37.05 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 637.99 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: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17040.65 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 263.7 MB). Free memory was 1.1 GB in the beginning and 989.1 MB in the end (delta: 87.0 MB). Peak memory consumption was 350.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.83 ms. Allocated memory is still 1.4 GB. Free memory is still 989.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * sc1 + 1 and consists of 3 locations. One deterministic module has affine ranking function 2 * s + 1 and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] + 2 * s and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.9s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 14.5s. Construction of modules took 0.2s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 111 SDtfs, 141 SDslu, 79 SDs, 0 SdLazy, 107 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital285 mio100 ax100 hnf99 lsp107 ukn83 mio100 lsp43 div114 bol100 ite100 ukn100 eq181 hnf77 smp93 dnf821 smp24 tf100 neg94 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 191ms VariablesStem: 2 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 108 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...