./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrcspn_mixed_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_mixed_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 bee04d628cc50c5f036e0a10e9bd347013a62a54 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:26,683 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:39:26,685 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:39:26,698 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:39:26,699 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:39:26,700 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:39:26,702 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:39:26,704 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:39:26,709 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:39:26,710 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:39:26,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:39:26,714 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:39:26,721 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:39:26,723 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:39:26,725 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:39:26,727 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:39:26,730 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:39:26,733 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:39:26,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:39:26,739 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:39:26,743 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:39:26,746 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:39:26,749 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:39:26,752 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:39:26,755 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:39:26,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:39:26,757 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:39:26,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:39:26,760 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:39:26,761 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:39:26,762 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:39:26,763 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:39:26,765 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:39:26,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:39:26,768 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:39:26,768 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:39:26,769 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:39:26,769 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:39:26,770 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:39:26,771 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:39:26,773 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:39:26,774 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:26,815 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:39:26,815 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:39:26,816 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:39:26,816 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:39:26,816 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:39:26,817 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:39:26,817 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:39:26,817 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:39:26,817 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:39:26,817 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:39:26,818 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:39:26,818 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:39:26,818 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:39:26,820 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:39:26,821 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:39:26,821 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:39:26,821 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:39:26,822 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:39:26,822 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:39:26,822 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:39:26,822 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:39:26,823 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:39:26,823 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:39:26,826 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:39:26,827 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:39:26,827 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:39:26,827 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:39:26,828 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:39:26,828 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:39:26,830 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:39:26,830 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 -> bee04d628cc50c5f036e0a10e9bd347013a62a54 [2020-07-29 01:39:27,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:39:27,137 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:39:27,142 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:39:27,145 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:39:27,147 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:39:27,148 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrcspn_mixed_alloca.i [2020-07-29 01:39:27,234 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa8c69a0a/0ed5abcb8bb447b6b0a3e61f55765b54/FLAG064b0e030 [2020-07-29 01:39:27,779 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:39:27,780 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcspn_mixed_alloca.i [2020-07-29 01:39:27,790 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa8c69a0a/0ed5abcb8bb447b6b0a3e61f55765b54/FLAG064b0e030 [2020-07-29 01:39:28,086 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa8c69a0a/0ed5abcb8bb447b6b0a3e61f55765b54 [2020-07-29 01:39:28,090 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:39:28,093 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:39:28,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:39:28,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:39:28,097 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:39:28,099 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,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b73ba2c 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,102 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,110 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:39:28,154 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:39:28,662 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:39:28,682 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:39:28,731 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:39:28,798 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:39:28,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:28 WrapperNode [2020-07-29 01:39:28,799 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:39:28,800 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:39:28,800 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:39:28,800 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:39:28,809 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:28" (1/1) ... [2020-07-29 01:39:28,825 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:28" (1/1) ... [2020-07-29 01:39:28,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:39:28,861 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:39:28,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:39:28,862 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:39:28,872 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:28" (1/1) ... [2020-07-29 01:39:28,872 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:28" (1/1) ... [2020-07-29 01:39:28,875 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:28" (1/1) ... [2020-07-29 01:39:28,876 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:28" (1/1) ... [2020-07-29 01:39:28,888 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:28" (1/1) ... [2020-07-29 01:39:28,893 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:28" (1/1) ... [2020-07-29 01:39:28,895 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:28" (1/1) ... [2020-07-29 01:39:28,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:39:28,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:39:28,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:39:28,899 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:39:28,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:28" (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:28,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:39:28,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:39:28,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:39:28,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:39:28,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:39:28,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:39:29,387 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:39:29,387 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-29 01:39:29,391 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,391 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:39:29,392 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:39:29,392 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:39:29,396 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:39:29,397 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:29,397 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,398 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22c7cc0 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,398 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:29,398 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:28" (2/3) ... [2020-07-29 01:39:29,399 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22c7cc0 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,399 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:29,399 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,400 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrcspn_mixed_alloca.i [2020-07-29 01:39:29,451 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:39:29,451 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:39:29,451 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:39:29,452 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:39:29,452 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:39:29,452 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:39:29,452 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:39:29,452 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:39:29,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 01:39:29,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:39:29,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:29,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:29,494 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:39:29,494 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:39:29,494 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:39:29,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 01:39:29,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:39:29,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:29,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:29,499 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:39:29,499 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:39:29,509 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 10#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 + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 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:29,509 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, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 6#L369-4true [2020-07-29 01:39:29,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:29,515 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2020-07-29 01:39:29,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:29,523 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107019818] [2020-07-29 01:39:29,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:29,645 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:29,675 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:29,699 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:29,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:29,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2020-07-29 01:39:29,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:29,701 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550529209] [2020-07-29 01:39:29,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:29,751 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:29,752 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:29,753 INFO L280 TraceCheckUtils]: 2: Hoare triple {24#true} assume !true; {25#false} is VALID [2020-07-29 01:39:29,754 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:29,754 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:29,754 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, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; {25#false} is VALID [2020-07-29 01:39:29,756 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:29,757 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550529209] [2020-07-29 01:39:29,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:39:29,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:39:29,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608819252] [2020-07-29 01:39:29,764 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:39:29,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:39:29,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-29 01:39:29,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-29 01:39:29,781 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2020-07-29 01:39:29,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:29,818 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2020-07-29 01:39:29,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 01:39:29,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:39:29,834 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:29,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2020-07-29 01:39:29,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:39:29,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2020-07-29 01:39:29,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 01:39:29,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 01:39:29,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2020-07-29 01:39:29,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:39:29,848 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-07-29 01:39:29,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2020-07-29 01:39:29,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-29 01:39:29,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:39:29,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 17 transitions. Second operand 13 states. [2020-07-29 01:39:29,877 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 17 transitions. Second operand 13 states. [2020-07-29 01:39:29,879 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand 13 states. [2020-07-29 01:39:29,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:29,881 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2020-07-29 01:39:29,882 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:39:29,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:29,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:29,883 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states and 17 transitions. [2020-07-29 01:39:29,883 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states and 17 transitions. [2020-07-29 01:39:29,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:29,885 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2020-07-29 01:39:29,886 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:39:29,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:29,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:29,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:39:29,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:39:29,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:39:29,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2020-07-29 01:39:29,892 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-07-29 01:39:29,892 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-07-29 01:39:29,892 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:39:29,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:39:29,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:39:29,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:29,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:29,894 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:39:29,894 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:39:29,895 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 + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 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:29,895 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, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 47#L369-4 [2020-07-29 01:39:29,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:29,896 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2020-07-29 01:39:29,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:29,896 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262714225] [2020-07-29 01:39:29,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:29,919 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:29,949 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:29,963 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:29,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:29,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2020-07-29 01:39:29,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:29,964 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703728256] [2020-07-29 01:39:29,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:29,981 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:29,994 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:29,998 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:30,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:30,001 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2020-07-29 01:39:30,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:30,001 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821376387] [2020-07-29 01:39:30,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:30,040 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:30,086 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:30,096 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:30,315 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-29 01:39:30,930 WARN L193 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2020-07-29 01:39:31,126 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-07-29 01:39:31,141 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:39:31,142 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:39:31,142 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:39:31,143 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:39:31,143 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:39:31,143 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:31,143 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:39:31,143 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:39:31,144 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn_mixed_alloca.i_Iteration2_Lasso [2020-07-29 01:39:31,144 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:39:31,144 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:39:31,216 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,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:31,234 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,239 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,245 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,251 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,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:31,262 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,267 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,273 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,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:31,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:31,288 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,293 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,299 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,304 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,716 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2020-07-29 01:39:31,922 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2020-07-29 01:39:31,930 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,965 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,958 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2020-07-29 01:39:33,201 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:39:33,207 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,226 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,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:33,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:33,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:33,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:33,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:33,237 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:33,238 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:33,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 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,276 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,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:33,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:33,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:33,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:33,284 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:33,285 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:33,301 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,334 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:33,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:33,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:33,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:33,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:33,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:33,337 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:33,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:33,339 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) 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,366 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,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:33,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:33,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:33,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:33,374 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:33,374 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:33,379 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:33,409 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,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:33,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:33,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:33,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:33,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:33,413 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:33,413 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:33,415 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:33,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:33,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:33,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:33,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:33,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:33,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:33,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:33,443 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:33,445 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:33,485 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,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:33,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:33,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:33,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:33,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:33,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:33,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:33,490 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:33,517 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,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:33,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:33,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:33,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:33,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:33,520 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:33,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:33,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 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:33,552 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,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:33,554 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:33,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:33,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:33,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:33,555 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:33,555 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:33,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 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:33,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:33,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:33,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:33,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:33,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:33,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:33,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:33,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:33,588 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:33,627 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,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:33,629 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:33,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:33,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:33,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:33,630 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:33,630 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:33,631 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) [2020-07-29 01:39:33,657 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:33,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:33,659 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:33,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:33,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:33,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:33,660 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:33,660 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:33,663 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) [2020-07-29 01:39:33,687 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:33,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:33,689 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:33,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:33,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:33,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:33,690 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:33,690 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:33,691 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:33,715 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,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:33,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:33,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:33,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:33,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:33,717 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:33,717 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:33,722 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:33,747 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,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:33,749 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:33,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:33,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:33,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:33,752 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:33,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:33,754 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:33,784 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,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:33,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:33,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:33,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:33,791 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:33,791 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:33,797 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:33,821 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,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:33,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:33,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:33,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:33,836 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:33,836 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:33,850 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) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:33,874 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,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:33,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:33,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:33,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:33,878 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:33,878 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:33,882 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:33,909 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,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:33,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:33,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:33,911 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2020-07-29 01:39:33,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:33,917 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-07-29 01:39:33,917 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:33,936 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:33,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:33,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:33,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:33,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:33,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:33,966 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:33,966 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:33,970 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) [2020-07-29 01:39:34,006 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,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:34,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:34,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:34,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:34,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:34,009 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:34,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:34,011 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:34,036 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,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:34,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:34,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:34,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:34,042 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:34,042 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:34,049 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:34,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:34,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:34,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:34,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:34,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:34,087 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:34,088 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:34,111 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:39:34,175 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-07-29 01:39:34,175 INFO L444 ModelExtractionUtils]: 16 out of 43 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:34,202 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:34,240 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:39:34,241 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:39:34,242 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1, ULTIMATE.start_cstrcspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1 - 1*ULTIMATE.start_cstrcspn_~sc1~0.offset Supporting invariants [] [2020-07-29 01:39:34,375 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2020-07-29 01:39:34,383 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, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset;" [2020-07-29 01:39:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:34,403 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:39:34,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:34,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:39:34,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:34,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:34,557 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:34,559 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:34,559 INFO L280 TraceCheckUtils]: 2: Hoare triple {92#unseeded} assume !(main_~length1~0 < 1); {92#unseeded} is VALID [2020-07-29 01:39:34,560 INFO L280 TraceCheckUtils]: 3: Hoare triple {92#unseeded} assume !(main_~length2~0 < 1); {92#unseeded} is VALID [2020-07-29 01:39:34,562 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 + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 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; {146#(and (= ULTIMATE.start_cstrcspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc215.base|) unseeded)} is VALID [2020-07-29 01:39:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:34,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:39:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:34,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:34,629 INFO L280 TraceCheckUtils]: 0: Hoare triple {147#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc215.base|) (* (- 1) ULTIMATE.start_cstrcspn_~sc1~0.offset))) (= ULTIMATE.start_cstrcspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc215.base|))} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {167#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc215.base|) (+ ULTIMATE.start_cstrcspn_~sc1~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrcspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base)) (= ULTIMATE.start_cstrcspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc215.base|))} is VALID [2020-07-29 01:39:34,630 INFO L280 TraceCheckUtils]: 1: Hoare triple {167#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc215.base|) (+ ULTIMATE.start_cstrcspn_~sc1~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrcspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base)) (= ULTIMATE.start_cstrcspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc215.base|))} 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 (<= (select |#length| |ULTIMATE.start_main_#t~malloc215.base|) (+ ULTIMATE.start_cstrcspn_~sc1~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrcspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base)) (= ULTIMATE.start_cstrcspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc215.base|))} is VALID [2020-07-29 01:39:34,631 INFO L280 TraceCheckUtils]: 2: Hoare triple {167#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc215.base|) (+ ULTIMATE.start_cstrcspn_~sc1~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrcspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base)) (= ULTIMATE.start_cstrcspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc215.base|))} call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; {167#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc215.base|) (+ ULTIMATE.start_cstrcspn_~sc1~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrcspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base)) (= ULTIMATE.start_cstrcspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc215.base|))} is VALID [2020-07-29 01:39:34,632 INFO L280 TraceCheckUtils]: 3: Hoare triple {167#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc215.base|) (+ ULTIMATE.start_cstrcspn_~sc1~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrcspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base)) (= ULTIMATE.start_cstrcspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc215.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); {167#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc215.base|) (+ ULTIMATE.start_cstrcspn_~sc1~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrcspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base)) (= ULTIMATE.start_cstrcspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc215.base|))} is VALID [2020-07-29 01:39:34,633 INFO L280 TraceCheckUtils]: 4: Hoare triple {167#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc215.base|) (+ ULTIMATE.start_cstrcspn_~sc1~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrcspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base)) (= ULTIMATE.start_cstrcspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc215.base|))} assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; {167#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc215.base|) (+ ULTIMATE.start_cstrcspn_~sc1~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrcspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base)) (= ULTIMATE.start_cstrcspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc215.base|))} is VALID [2020-07-29 01:39:34,634 INFO L280 TraceCheckUtils]: 5: Hoare triple {167#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc215.base|) (+ ULTIMATE.start_cstrcspn_~sc1~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrcspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base)) (= ULTIMATE.start_cstrcspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc215.base|))} call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); {167#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc215.base|) (+ ULTIMATE.start_cstrcspn_~sc1~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrcspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base)) (= ULTIMATE.start_cstrcspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc215.base|))} is VALID [2020-07-29 01:39:34,635 INFO L280 TraceCheckUtils]: 6: Hoare triple {167#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc215.base|) (+ ULTIMATE.start_cstrcspn_~sc1~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrcspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base)) (= ULTIMATE.start_cstrcspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc215.base|))} assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; {167#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc215.base|) (+ ULTIMATE.start_cstrcspn_~sc1~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrcspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base)) (= ULTIMATE.start_cstrcspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc215.base|))} is VALID [2020-07-29 01:39:34,637 INFO L280 TraceCheckUtils]: 7: Hoare triple {167#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc215.base|) (+ ULTIMATE.start_cstrcspn_~sc1~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrcspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base)) (= ULTIMATE.start_cstrcspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc215.base|))} cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; {149#(and (or (and (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc215.base|) (* (- 1) ULTIMATE.start_cstrcspn_~sc1~0.offset))) (>= oldRank0 0)) unseeded) (= ULTIMATE.start_cstrcspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc215.base|))} is VALID [2020-07-29 01:39:34,637 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:34,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:39:34,657 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:34,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:34,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,663 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:34,664 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 01:39:34,782 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:34,782 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:34,782 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:34,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. cyclomatic complexity: 5 [2020-07-29 01:39:34,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:34,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:34,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:39:34,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:34,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:34,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:34,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2020-07-29 01:39:34,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:34,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:34,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:34,791 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 17 transitions. cyclomatic complexity: 5 [2020-07-29 01:39:34,794 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 01:39:34,794 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:39:34,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:34,797 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:39:34,797 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2020-07-29 01:39:34,797 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:39:34,798 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:34,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:34,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,799 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:34,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,799 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:34,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:34,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,800 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:34,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,800 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:34,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:34,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,801 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:34,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,801 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:34,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:39:34,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,802 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:34,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,802 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:34,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:39:34,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,803 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:34,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,803 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:34,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:34,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,803 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:34,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,804 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:34,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 8 letters. [2020-07-29 01:39:34,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,805 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:34,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,805 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:34,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:34,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,806 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:34,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,806 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:34,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:34,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,807 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:34,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,808 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:34,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:34,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,808 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:34,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,809 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:34,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 8 letters. [2020-07-29 01:39:34,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,809 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:34,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,810 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:34,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:39:34,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,811 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:34,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,811 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:34,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:39:34,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,812 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:34,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,813 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:34,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:34,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,813 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:34,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,814 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:34,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:34,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,814 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:34,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,815 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:34,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:34,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,815 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:34,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,816 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:34,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:34,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,816 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:34,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,817 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:34,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:34,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,817 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:34,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,818 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:34,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:39:34,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2020-07-29 01:39:34,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:34,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2020-07-29 01:39:34,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2020-07-29 01:39:34,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:34,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2020-07-29 01:39:34,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:34,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2020-07-29 01:39:34,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 01:39:34,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:39:34,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2020-07-29 01:39:34,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:39:34,825 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-07-29 01:39:34,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2020-07-29 01:39:34,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-29 01:39:34,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:39:34,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 25 transitions. Second operand 18 states. [2020-07-29 01:39:34,827 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 25 transitions. Second operand 18 states. [2020-07-29 01:39:34,827 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 18 states. [2020-07-29 01:39:34,828 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:34,831 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2020-07-29 01:39:34,831 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2020-07-29 01:39:34,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:34,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:34,832 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states and 25 transitions. [2020-07-29 01:39:34,832 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states and 25 transitions. [2020-07-29 01:39:34,833 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:34,835 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2020-07-29 01:39:34,835 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2020-07-29 01:39:34,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:34,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:34,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:39:34,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:39:34,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-29 01:39:34,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2020-07-29 01:39:34,837 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-07-29 01:39:34,837 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-07-29 01:39:34,837 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:39:34,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2020-07-29 01:39:34,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:34,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:34,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:34,839 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:39:34,839 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:39:34,839 INFO L794 eck$LassoCheckResult]: Stem: 232#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 225#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; 226#L382 assume !(main_~length1~0 < 1); 227#L382-2 assume !(main_~length2~0 < 1); 224#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 + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 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; 221#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 223#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; 233#L372-5 [2020-07-29 01:39:34,839 INFO L796 eck$LassoCheckResult]: Loop: 233#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 228#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); 229#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; 233#L372-5 [2020-07-29 01:39:34,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:34,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2020-07-29 01:39:34,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:34,840 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501927751] [2020-07-29 01:39:34,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:34,858 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:34,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:34,882 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:34,888 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:34,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:34,889 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2020-07-29 01:39:34,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:34,889 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220868594] [2020-07-29 01:39:34,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:34,902 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:34,916 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:34,922 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:34,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:34,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2020-07-29 01:39:34,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:34,926 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422087185] [2020-07-29 01:39:34,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:34,979 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:35,026 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:35,032 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:35,616 WARN L193 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 102 [2020-07-29 01:39:35,792 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-07-29 01:39:35,795 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:39:35,795 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:39:35,795 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:39:35,795 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:39:35,796 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:39:35,796 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:35,796 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:39:35,796 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:39:35,796 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn_mixed_alloca.i_Iteration3_Lasso [2020-07-29 01:39:35,796 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:39:35,797 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:39:35,830 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:35,836 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:35,840 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:35,843 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:35,846 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:35,850 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:35,854 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:35,859 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:35,864 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:35,869 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:35,872 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:35,875 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:35,879 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:35,887 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:35,890 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,285 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 81 [2020-07-29 01:39:36,406 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,411 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,415 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,387 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2020-07-29 01:39:37,695 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:39:37,696 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:37,706 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:37,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:37,708 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:37,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:37,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:37,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:37,709 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:37,709 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:37,710 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:37,742 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:37,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:37,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:37,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:37,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:37,745 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:37,745 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:37,748 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:37,771 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:37,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:37,772 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:37,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:37,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:37,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:37,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:37,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:37,774 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:37,797 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:37,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:37,798 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:37,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:37,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:37,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:37,799 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:37,799 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:37,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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:37,822 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:37,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:37,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:37,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:37,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:37,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:37,825 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:37,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:37,826 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:37,860 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:37,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:37,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:37,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:37,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:37,864 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:37,864 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:37,869 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:37,892 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:37,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:37,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:37,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:37,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:37,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:37,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:37,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:37,901 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) [2020-07-29 01:39:37,950 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:37,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:37,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:37,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:37,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:37,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:37,952 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:37,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:37,954 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:37,986 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:37,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:37,987 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:37,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:37,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:37,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:37,988 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:37,988 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:37,990 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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,011 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,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:38,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,013 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:38,013 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:38,014 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,037 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,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:38,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:38,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:38,041 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,066 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,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,068 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:38,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,068 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:38,069 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:38,074 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:38,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:38,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:38,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,099 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:38,099 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:38,102 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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,125 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,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,127 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:38,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,127 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:38,128 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:38,129 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:38,152 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,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,155 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:38,155 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:38,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 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:38,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:38,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,187 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:38,187 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:38,192 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:38,215 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,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,217 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:38,217 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:38,220 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:38,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:38,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,248 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:38,249 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:38,251 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:38,275 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,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,277 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:38,277 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:38,281 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:38,304 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,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,306 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-07-29 01:39:38,306 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2020-07-29 01:39:38,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,352 INFO L401 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2020-07-29 01:39:38,352 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2020-07-29 01:39:38,485 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:38,508 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,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,517 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:38,517 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:38,539 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:39:38,625 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2020-07-29 01:39:38,625 INFO L444 ModelExtractionUtils]: 15 out of 46 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:38,629 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:38,632 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 01:39:38,632 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:39:38,633 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_2, ULTIMATE.start_cstrcspn_#in~s2.offset, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_2 + 1*ULTIMATE.start_cstrcspn_#in~s2.offset + 2*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [-1*v_rep(select #length ULTIMATE.start_cstrcspn_~s~0.base)_2 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_2 + 1*ULTIMATE.start_cstrcspn_#in~s2.offset >= 0] [2020-07-29 01:39:38,759 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2020-07-29 01:39:38,765 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:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:38,773 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:39:38,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:38,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-29 01:39:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:38,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:39,127 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:39:39,128 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-07-29 01:39:39,129 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:39:39,157 INFO L624 ElimStorePlain]: treesize reduction 10, result has 72.2 percent of original size [2020-07-29 01:39:39,160 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:39:39,160 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2020-07-29 01:39:39,163 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:39:39,163 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_59|, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~length2~0]. (and (<= 1 (select |#length| |ULTIMATE.start_main_#t~malloc215.base|)) (= |#length| (store (store |v_#length_59| |ULTIMATE.start_main_#t~malloc215.base| ULTIMATE.start_main_~length1~0) ULTIMATE.start_cstrcspn_~s2.base ULTIMATE.start_main_~length2~0)) (<= ULTIMATE.start_main_~length2~0 (+ |ULTIMATE.start_cstrcspn_#in~s2.offset| 1)) unseeded) [2020-07-29 01:39:39,163 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 1 (select |#length| |ULTIMATE.start_main_#t~malloc215.base|)) (<= (select |#length| ULTIMATE.start_cstrcspn_~s2.base) (+ |ULTIMATE.start_cstrcspn_#in~s2.offset| 1)) unseeded) [2020-07-29 01:39:39,199 INFO L280 TraceCheckUtils]: 0: Hoare triple {324#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {324#unseeded} is VALID [2020-07-29 01:39:39,200 INFO L280 TraceCheckUtils]: 1: Hoare triple {324#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; {324#unseeded} is VALID [2020-07-29 01:39:39,201 INFO L280 TraceCheckUtils]: 2: Hoare triple {324#unseeded} assume !(main_~length1~0 < 1); {324#unseeded} is VALID [2020-07-29 01:39:39,204 INFO L280 TraceCheckUtils]: 3: Hoare triple {324#unseeded} assume !(main_~length2~0 < 1); {324#unseeded} is VALID [2020-07-29 01:39:39,207 INFO L280 TraceCheckUtils]: 4: Hoare triple {324#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 + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 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; {434#(and (<= 1 (select |#length| |ULTIMATE.start_main_#t~malloc215.base|)) (<= (select |#length| ULTIMATE.start_cstrcspn_~s2.base) (+ |ULTIMATE.start_cstrcspn_#in~s2.offset| 1)) unseeded)} is VALID [2020-07-29 01:39:39,208 INFO L280 TraceCheckUtils]: 5: Hoare triple {434#(and (<= 1 (select |#length| |ULTIMATE.start_main_#t~malloc215.base|)) (<= (select |#length| ULTIMATE.start_cstrcspn_~s2.base) (+ |ULTIMATE.start_cstrcspn_#in~s2.offset| 1)) unseeded)} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {434#(and (<= 1 (select |#length| |ULTIMATE.start_main_#t~malloc215.base|)) (<= (select |#length| ULTIMATE.start_cstrcspn_~s2.base) (+ |ULTIMATE.start_cstrcspn_#in~s2.offset| 1)) unseeded)} is VALID [2020-07-29 01:39:39,209 INFO L280 TraceCheckUtils]: 6: Hoare triple {434#(and (<= 1 (select |#length| |ULTIMATE.start_main_#t~malloc215.base|)) (<= (select |#length| ULTIMATE.start_cstrcspn_~s2.base) (+ |ULTIMATE.start_cstrcspn_#in~s2.offset| 1)) 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; {413#(and (>= (+ (* (- 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)) (select |#length| |ULTIMATE.start_main_#t~malloc215.base|) |ULTIMATE.start_cstrcspn_#in~s2.offset|) 0) unseeded)} is VALID [2020-07-29 01:39:39,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:39,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:39:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:39,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:39,263 INFO L280 TraceCheckUtils]: 0: Hoare triple {414#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc215.base|) |ULTIMATE.start_cstrcspn_#in~s2.offset| (* 2 ULTIMATE.start_cstrcspn_~s~0.offset))) (>= (+ (* (- 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)) (select |#length| |ULTIMATE.start_main_#t~malloc215.base|) |ULTIMATE.start_cstrcspn_#in~s2.offset|) 0))} call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; {441#(and (<= (+ (* 2 ULTIMATE.start_cstrcspn_~s~0.offset) |ULTIMATE.start_cstrcspn_#in~s2.offset| (select |#length| |ULTIMATE.start_main_#t~malloc215.base|)) oldRank0) (<= (select |#length| ULTIMATE.start_cstrcspn_~s~0.base) (+ |ULTIMATE.start_cstrcspn_#in~s2.offset| (select |#length| |ULTIMATE.start_main_#t~malloc215.base|))) (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} is VALID [2020-07-29 01:39:39,264 INFO L280 TraceCheckUtils]: 1: Hoare triple {441#(and (<= (+ (* 2 ULTIMATE.start_cstrcspn_~s~0.offset) |ULTIMATE.start_cstrcspn_#in~s2.offset| (select |#length| |ULTIMATE.start_main_#t~malloc215.base|)) oldRank0) (<= (select |#length| ULTIMATE.start_cstrcspn_~s~0.base) (+ |ULTIMATE.start_cstrcspn_#in~s2.offset| (select |#length| |ULTIMATE.start_main_#t~malloc215.base|))) (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (<= (+ 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); {441#(and (<= (+ (* 2 ULTIMATE.start_cstrcspn_~s~0.offset) |ULTIMATE.start_cstrcspn_#in~s2.offset| (select |#length| |ULTIMATE.start_main_#t~malloc215.base|)) oldRank0) (<= (select |#length| ULTIMATE.start_cstrcspn_~s~0.base) (+ |ULTIMATE.start_cstrcspn_#in~s2.offset| (select |#length| |ULTIMATE.start_main_#t~malloc215.base|))) (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} is VALID [2020-07-29 01:39:39,267 INFO L280 TraceCheckUtils]: 2: Hoare triple {441#(and (<= (+ (* 2 ULTIMATE.start_cstrcspn_~s~0.offset) |ULTIMATE.start_cstrcspn_#in~s2.offset| (select |#length| |ULTIMATE.start_main_#t~malloc215.base|)) oldRank0) (<= (select |#length| ULTIMATE.start_cstrcspn_~s~0.base) (+ |ULTIMATE.start_cstrcspn_#in~s2.offset| (select |#length| |ULTIMATE.start_main_#t~malloc215.base|))) (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (<= (+ 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; {416#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc215.base|) |ULTIMATE.start_cstrcspn_#in~s2.offset| (* 2 ULTIMATE.start_cstrcspn_~s~0.offset)))) unseeded) (>= (+ (* (- 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)) (select |#length| |ULTIMATE.start_main_#t~malloc215.base|) |ULTIMATE.start_cstrcspn_#in~s2.offset|) 0))} is VALID [2020-07-29 01:39:39,267 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,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:39:39,291 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,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:39,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,292 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:39,292 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-07-29 01:39:39,423 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2020-07-29 01:39:39,423 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:39,423 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:39,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. cyclomatic complexity: 9 [2020-07-29 01:39:39,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:39,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:39,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:39:39,425 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:39,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:39,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:39,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 57 transitions. [2020-07-29 01:39:39,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:39,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:39,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:39,428 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 25 transitions. cyclomatic complexity: 9 [2020-07-29 01:39:39,428 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:39:39,429 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:39:39,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:39,430 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:39:39,430 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 43 states and 57 transitions. cyclomatic complexity: 18 [2020-07-29 01:39:39,431 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:39:39,432 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,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:39,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,432 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,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:39,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:39,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:39,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,433 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,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:39,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,434 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,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,434 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,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 43 letters. Loop has 43 letters. [2020-07-29 01:39:39,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,435 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,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,435 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,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:39:39,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,435 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,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:39,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:39,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:39,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,436 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,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:39,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,437 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,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,437 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,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:39,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,438 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,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,438 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,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:39,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,439 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,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:39,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:39,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:39,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,440 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,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:39,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,441 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,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,441 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,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:39:39,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,441 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,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,442 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,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:39:39,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,442 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,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,443 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:39,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:39:39,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-07-29 01:39:39,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:39,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:39:39,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2020-07-29 01:39:39,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. cyclomatic complexity: 18 [2020-07-29 01:39:39,451 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:39,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2020-07-29 01:39:39,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:39:39,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:39:39,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2020-07-29 01:39:39,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:39:39,454 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2020-07-29 01:39:39,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2020-07-29 01:39:39,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2020-07-29 01:39:39,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:39:39,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states and 40 transitions. Second operand 24 states. [2020-07-29 01:39:39,462 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states and 40 transitions. Second operand 24 states. [2020-07-29 01:39:39,462 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand 24 states. [2020-07-29 01:39:39,463 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:39,466 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2020-07-29 01:39:39,466 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2020-07-29 01:39:39,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:39,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:39,467 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 30 states and 40 transitions. [2020-07-29 01:39:39,467 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 30 states and 40 transitions. [2020-07-29 01:39:39,468 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:39,471 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2020-07-29 01:39:39,471 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2020-07-29 01:39:39,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:39,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:39,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:39:39,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:39:39,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-29 01:39:39,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2020-07-29 01:39:39,478 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-07-29 01:39:39,478 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-07-29 01:39:39,478 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:39:39,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2020-07-29 01:39:39,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:39,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:39,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:39,480 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,480 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:39:39,483 INFO L794 eck$LassoCheckResult]: Stem: 517#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 510#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; 511#L382 assume !(main_~length1~0 < 1); 512#L382-2 assume !(main_~length2~0 < 1); 509#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 + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 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; 505#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 506#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; 519#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 515#L372-1 assume !cstrcspn_#t~short210; 516#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; 501#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 502#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 503#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 504#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 508#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; 518#L372-5 [2020-07-29 01:39:39,484 INFO L796 eck$LassoCheckResult]: Loop: 518#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 513#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); 514#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; 518#L372-5 [2020-07-29 01:39:39,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:39,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2020-07-29 01:39:39,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:39,484 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458035945] [2020-07-29 01:39:39,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:39,520 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:39,558 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:39,564 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:39,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:39,565 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2020-07-29 01:39:39,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:39,566 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075760354] [2020-07-29 01:39:39,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:39,571 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:39,575 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:39,578 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:39,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:39,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2020-07-29 01:39:39,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:39,579 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073366093] [2020-07-29 01:39:39,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:39,694 INFO L280 TraceCheckUtils]: 0: Hoare triple {653#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {653#true} is VALID [2020-07-29 01:39:39,694 INFO L280 TraceCheckUtils]: 1: Hoare triple {653#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; {653#true} is VALID [2020-07-29 01:39:39,695 INFO L280 TraceCheckUtils]: 2: Hoare triple {653#true} assume !(main_~length1~0 < 1); {653#true} is VALID [2020-07-29 01:39:39,695 INFO L280 TraceCheckUtils]: 3: Hoare triple {653#true} assume !(main_~length2~0 < 1); {653#true} is VALID [2020-07-29 01:39:39,695 INFO L280 TraceCheckUtils]: 4: Hoare triple {653#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 + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 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; {653#true} is VALID [2020-07-29 01:39:39,695 INFO L280 TraceCheckUtils]: 5: Hoare triple {653#true} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {653#true} is VALID [2020-07-29 01:39:39,697 INFO L280 TraceCheckUtils]: 6: Hoare triple {653#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; {655#(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,698 INFO L280 TraceCheckUtils]: 7: Hoare triple {655#(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; {656#(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,699 INFO L280 TraceCheckUtils]: 8: Hoare triple {656#(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; {657#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} is VALID [2020-07-29 01:39:39,699 INFO L280 TraceCheckUtils]: 9: Hoare triple {657#(= (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; {657#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} is VALID [2020-07-29 01:39:39,700 INFO L280 TraceCheckUtils]: 10: Hoare triple {657#(= (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); {657#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} is VALID [2020-07-29 01:39:39,700 INFO L280 TraceCheckUtils]: 11: Hoare triple {657#(= (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; {657#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} is VALID [2020-07-29 01:39:39,701 INFO L280 TraceCheckUtils]: 12: Hoare triple {657#(= (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, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; {657#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} is VALID [2020-07-29 01:39:39,702 INFO L280 TraceCheckUtils]: 13: Hoare triple {657#(= (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); {657#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} is VALID [2020-07-29 01:39:39,703 INFO L280 TraceCheckUtils]: 14: Hoare triple {657#(= (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; {658#(= 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,704 INFO L280 TraceCheckUtils]: 15: Hoare triple {658#(= 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; {659#(not |ULTIMATE.start_cstrcspn_#t~short210|)} is VALID [2020-07-29 01:39:39,704 INFO L280 TraceCheckUtils]: 16: Hoare triple {659#(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); {654#false} is VALID [2020-07-29 01:39:39,705 INFO L280 TraceCheckUtils]: 17: Hoare triple {654#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; {654#false} is VALID [2020-07-29 01:39:39,706 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,706 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073366093] [2020-07-29 01:39:39,706 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458677481] [2020-07-29 01:39:39,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:39:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:39,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-29 01:39:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:39,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:39,842 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:39:39,850 INFO L280 TraceCheckUtils]: 0: Hoare triple {653#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {653#true} is VALID [2020-07-29 01:39:39,850 INFO L280 TraceCheckUtils]: 1: Hoare triple {653#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; {653#true} is VALID [2020-07-29 01:39:39,850 INFO L280 TraceCheckUtils]: 2: Hoare triple {653#true} assume !(main_~length1~0 < 1); {653#true} is VALID [2020-07-29 01:39:39,851 INFO L280 TraceCheckUtils]: 3: Hoare triple {653#true} assume !(main_~length2~0 < 1); {653#true} is VALID [2020-07-29 01:39:39,851 INFO L280 TraceCheckUtils]: 4: Hoare triple {653#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 + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 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; {653#true} is VALID [2020-07-29 01:39:39,852 INFO L280 TraceCheckUtils]: 5: Hoare triple {653#true} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {653#true} is VALID [2020-07-29 01:39:39,853 INFO L280 TraceCheckUtils]: 6: Hoare triple {653#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; {655#(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,854 INFO L280 TraceCheckUtils]: 7: Hoare triple {655#(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; {684#(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,856 INFO L280 TraceCheckUtils]: 8: Hoare triple {684#(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; {657#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} is VALID [2020-07-29 01:39:39,857 INFO L280 TraceCheckUtils]: 9: Hoare triple {657#(= (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; {657#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} is VALID [2020-07-29 01:39:39,858 INFO L280 TraceCheckUtils]: 10: Hoare triple {657#(= (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); {657#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} is VALID [2020-07-29 01:39:39,860 INFO L280 TraceCheckUtils]: 11: Hoare triple {657#(= (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; {657#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} is VALID [2020-07-29 01:39:39,861 INFO L280 TraceCheckUtils]: 12: Hoare triple {657#(= (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, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; {657#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} is VALID [2020-07-29 01:39:39,862 INFO L280 TraceCheckUtils]: 13: Hoare triple {657#(= (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); {657#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} is VALID [2020-07-29 01:39:39,863 INFO L280 TraceCheckUtils]: 14: Hoare triple {657#(= (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; {658#(= 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,864 INFO L280 TraceCheckUtils]: 15: Hoare triple {658#(= 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; {659#(not |ULTIMATE.start_cstrcspn_#t~short210|)} is VALID [2020-07-29 01:39:39,865 INFO L280 TraceCheckUtils]: 16: Hoare triple {659#(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); {654#false} is VALID [2020-07-29 01:39:39,865 INFO L280 TraceCheckUtils]: 17: Hoare triple {654#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; {654#false} is VALID [2020-07-29 01:39:39,867 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,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:39:39,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-07-29 01:39:39,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459607145] [2020-07-29 01:39:39,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:39:39,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 01:39:39,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:39:39,993 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,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:40,335 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2020-07-29 01:39:40,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:39:40,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:39:40,366 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,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2020-07-29 01:39:40,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:40,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2020-07-29 01:39:40,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-29 01:39:40,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-29 01:39:40,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2020-07-29 01:39:40,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:39:40,373 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2020-07-29 01:39:40,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2020-07-29 01:39:40,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2020-07-29 01:39:40,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:39:40,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states and 53 transitions. Second operand 28 states. [2020-07-29 01:39:40,383 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states and 53 transitions. Second operand 28 states. [2020-07-29 01:39:40,383 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 28 states. [2020-07-29 01:39:40,384 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:40,387 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2020-07-29 01:39:40,387 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2020-07-29 01:39:40,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:40,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:40,388 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 43 states and 53 transitions. [2020-07-29 01:39:40,388 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 43 states and 53 transitions. [2020-07-29 01:39:40,389 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:40,392 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2020-07-29 01:39:40,392 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2020-07-29 01:39:40,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:40,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:40,393 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:39:40,393 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:39:40,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-29 01:39:40,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2020-07-29 01:39:40,395 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-07-29 01:39:40,395 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-07-29 01:39:40,395 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:39:40,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2020-07-29 01:39:40,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:40,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:40,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:40,397 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,398 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:39:40,398 INFO L794 eck$LassoCheckResult]: Stem: 794#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 787#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; 788#L382 assume !(main_~length1~0 < 1); 789#L382-2 assume !(main_~length2~0 < 1); 786#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 + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 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; 782#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 783#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; 802#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 792#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); 793#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; 778#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 779#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 780#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 781#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 785#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; 795#L372-5 [2020-07-29 01:39:40,398 INFO L796 eck$LassoCheckResult]: Loop: 795#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 790#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); 791#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; 795#L372-5 [2020-07-29 01:39:40,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:40,399 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2020-07-29 01:39:40,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:40,399 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499671025] [2020-07-29 01:39:40,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:40,418 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:40,437 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:40,443 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:40,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:40,444 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2020-07-29 01:39:40,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:40,445 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606607904] [2020-07-29 01:39:40,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:40,450 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:40,455 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:40,461 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:40,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:40,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2020-07-29 01:39:40,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:40,463 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154270971] [2020-07-29 01:39:40,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:40,509 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:40,555 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:40,562 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:41,513 WARN L193 SmtUtils]: Spent 816.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 142 [2020-07-29 01:39:41,826 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-07-29 01:39:41,830 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:39:41,830 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:39:41,830 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:39:41,830 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:39:41,830 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:39:41,830 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:41,830 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:39:41,830 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:39:41,831 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn_mixed_alloca.i_Iteration5_Lasso [2020-07-29 01:39:41,831 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:39:41,831 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:39:41,867 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,869 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,873 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,876 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,879 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,885 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,113 WARN L193 SmtUtils]: Spent 934.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 98 [2020-07-29 01:39:43,275 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2020-07-29 01:39:43,285 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,291 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,295 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,298 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,302 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,306 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,309 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,312 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,315 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,320 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,325 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,330 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,335 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,339 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,879 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2020-07-29 01:39:44,091 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2020-07-29 01:39:45,214 WARN L193 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2020-07-29 01:39:45,445 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2020-07-29 01:39:45,651 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:39:45,651 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-07-29 01:39:45,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:45,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:45,663 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:45,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:45,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:45,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:45,664 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:45,664 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 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,666 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,691 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,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:45,692 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:45,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:45,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:45,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:45,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:45,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:45,694 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) [2020-07-29 01:39:45,716 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,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. 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,718 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:45,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:45,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:45,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:45,719 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:45,719 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:45,720 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,742 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,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:45,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:45,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:45,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:45,750 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:45,750 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:45,753 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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,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:45,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:45,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:45,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:45,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:45,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:45,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:45,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:45,780 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:45,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:45,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:45,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:45,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:45,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:45,806 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:45,806 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:45,817 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) [2020-07-29 01:39:45,852 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,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:45,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:45,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:45,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:45,856 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:45,856 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 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,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 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,895 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,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:45,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:45,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:45,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:45,898 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:45,898 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:45,901 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,923 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,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:45,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:45,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:45,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:45,925 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:45,925 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:45,928 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,952 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,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:45,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:45,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:45,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:45,963 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:45,964 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:45,986 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:39:46,034 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2020-07-29 01:39:46,034 INFO L444 ModelExtractionUtils]: 20 out of 52 variables were initially zero. Simplification set additionally 29 variables to zero. 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:46,036 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:39:46,038 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:39:46,039 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:39:46,039 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrcspn_~s2.base)_1, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrcspn_~s2.base)_1 + 2*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2020-07-29 01:39:46,192 INFO L297 tatePredicateManager]: 25 out of 26 supporting invariants were superfluous and have been removed [2020-07-29 01:39:46,197 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:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:46,202 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:39:46,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:46,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:39:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:46,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:46,271 INFO L280 TraceCheckUtils]: 0: Hoare triple {975#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {975#unseeded} is VALID [2020-07-29 01:39:46,272 INFO L280 TraceCheckUtils]: 1: Hoare triple {975#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; {975#unseeded} is VALID [2020-07-29 01:39:46,273 INFO L280 TraceCheckUtils]: 2: Hoare triple {975#unseeded} assume !(main_~length1~0 < 1); {975#unseeded} is VALID [2020-07-29 01:39:46,273 INFO L280 TraceCheckUtils]: 3: Hoare triple {975#unseeded} assume !(main_~length2~0 < 1); {975#unseeded} is VALID [2020-07-29 01:39:46,274 INFO L280 TraceCheckUtils]: 4: Hoare triple {975#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 + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 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; {975#unseeded} is VALID [2020-07-29 01:39:46,275 INFO L280 TraceCheckUtils]: 5: Hoare triple {975#unseeded} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {975#unseeded} is VALID [2020-07-29 01:39:46,275 INFO L280 TraceCheckUtils]: 6: Hoare triple {975#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; {975#unseeded} is VALID [2020-07-29 01:39:46,276 INFO L280 TraceCheckUtils]: 7: Hoare triple {975#unseeded} call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; {975#unseeded} is VALID [2020-07-29 01:39:46,276 INFO L280 TraceCheckUtils]: 8: Hoare triple {975#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); {975#unseeded} is VALID [2020-07-29 01:39:46,277 INFO L280 TraceCheckUtils]: 9: Hoare triple {975#unseeded} assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; {975#unseeded} is VALID [2020-07-29 01:39:46,277 INFO L280 TraceCheckUtils]: 10: Hoare triple {975#unseeded} call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); {975#unseeded} is VALID [2020-07-29 01:39:46,277 INFO L280 TraceCheckUtils]: 11: Hoare triple {975#unseeded} assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; {975#unseeded} is VALID [2020-07-29 01:39:46,278 INFO L280 TraceCheckUtils]: 12: Hoare triple {975#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, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; {975#unseeded} is VALID [2020-07-29 01:39:46,278 INFO L280 TraceCheckUtils]: 13: Hoare triple {975#unseeded} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {975#unseeded} is VALID [2020-07-29 01:39:46,279 INFO L280 TraceCheckUtils]: 14: Hoare triple {975#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; {1119#(and (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:46,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:39:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:46,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:46,325 INFO L280 TraceCheckUtils]: 0: Hoare triple {1120#(and (>= oldRank0 (+ (select |#length| ULTIMATE.start_cstrcspn_~s2.base) (* 2 ULTIMATE.start_cstrcspn_~s~0.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; {1170#(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_cstrcspn_~s2.base)) oldRank0) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} is VALID [2020-07-29 01:39:46,326 INFO L280 TraceCheckUtils]: 1: Hoare triple {1170#(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_cstrcspn_~s2.base)) oldRank0) (<= (+ 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); {1170#(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_cstrcspn_~s2.base)) oldRank0) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} is VALID [2020-07-29 01:39:46,328 INFO L280 TraceCheckUtils]: 2: Hoare triple {1170#(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_cstrcspn_~s2.base)) oldRank0) (<= (+ 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; {1122#(and (or unseeded (and (> oldRank0 (+ (select |#length| ULTIMATE.start_cstrcspn_~s2.base) (* 2 ULTIMATE.start_cstrcspn_~s~0.offset))) (>= oldRank0 0))) (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base))} is VALID [2020-07-29 01:39:46,328 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,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:39:46,345 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,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,346 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:46,346 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2020-07-29 01:39:46,456 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 46 states and 58 transitions. Complement of second has 5 states. [2020-07-29 01:39:46,456 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:46,456 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:46,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. cyclomatic complexity: 11 [2020-07-29 01:39:46,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:46,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:46,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:39:46,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:46,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:46,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:46,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 58 transitions. [2020-07-29 01:39:46,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:46,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:46,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:46,459 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 36 transitions. cyclomatic complexity: 11 [2020-07-29 01:39:46,460 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:39:46,460 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:39:46,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:46,461 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:39:46,462 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 46 states and 58 transitions. cyclomatic complexity: 15 [2020-07-29 01:39:46,463 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:39:46,463 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,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,463 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,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:46,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:46,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:46,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,464 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,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,465 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,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,465 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,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 46 letters. Loop has 46 letters. [2020-07-29 01:39:46,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,466 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,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,466 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,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:39:46,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,467 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,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:46,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:46,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:46,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,468 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,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:39:46,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,468 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,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,469 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,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:39:46,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,469 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,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,469 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,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,470 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,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:46,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:46,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:46,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,471 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,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,472 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,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,472 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,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:39:46,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,472 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,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,473 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,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:39:46,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,473 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,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,474 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:46,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:39:46,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2020-07-29 01:39:46,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,475 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:39:46,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:46,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:39:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:46,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:46,562 INFO L280 TraceCheckUtils]: 0: Hoare triple {975#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {975#unseeded} is VALID [2020-07-29 01:39:46,562 INFO L280 TraceCheckUtils]: 1: Hoare triple {975#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; {975#unseeded} is VALID [2020-07-29 01:39:46,563 INFO L280 TraceCheckUtils]: 2: Hoare triple {975#unseeded} assume !(main_~length1~0 < 1); {975#unseeded} is VALID [2020-07-29 01:39:46,568 INFO L280 TraceCheckUtils]: 3: Hoare triple {975#unseeded} assume !(main_~length2~0 < 1); {975#unseeded} is VALID [2020-07-29 01:39:46,569 INFO L280 TraceCheckUtils]: 4: Hoare triple {975#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 + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 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; {975#unseeded} is VALID [2020-07-29 01:39:46,570 INFO L280 TraceCheckUtils]: 5: Hoare triple {975#unseeded} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {975#unseeded} is VALID [2020-07-29 01:39:46,570 INFO L280 TraceCheckUtils]: 6: Hoare triple {975#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; {975#unseeded} is VALID [2020-07-29 01:39:46,571 INFO L280 TraceCheckUtils]: 7: Hoare triple {975#unseeded} call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; {975#unseeded} is VALID [2020-07-29 01:39:46,571 INFO L280 TraceCheckUtils]: 8: Hoare triple {975#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); {975#unseeded} is VALID [2020-07-29 01:39:46,572 INFO L280 TraceCheckUtils]: 9: Hoare triple {975#unseeded} assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; {975#unseeded} is VALID [2020-07-29 01:39:46,572 INFO L280 TraceCheckUtils]: 10: Hoare triple {975#unseeded} call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); {975#unseeded} is VALID [2020-07-29 01:39:46,573 INFO L280 TraceCheckUtils]: 11: Hoare triple {975#unseeded} assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; {975#unseeded} is VALID [2020-07-29 01:39:46,573 INFO L280 TraceCheckUtils]: 12: Hoare triple {975#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, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; {975#unseeded} is VALID [2020-07-29 01:39:46,574 INFO L280 TraceCheckUtils]: 13: Hoare triple {975#unseeded} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {975#unseeded} is VALID [2020-07-29 01:39:46,574 INFO L280 TraceCheckUtils]: 14: Hoare triple {975#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; {1119#(and (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:46,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:39:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:46,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:46,619 INFO L280 TraceCheckUtils]: 0: Hoare triple {1120#(and (>= oldRank0 (+ (select |#length| ULTIMATE.start_cstrcspn_~s2.base) (* 2 ULTIMATE.start_cstrcspn_~s~0.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; {1278#(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_cstrcspn_~s2.base)) oldRank0) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} is VALID [2020-07-29 01:39:46,620 INFO L280 TraceCheckUtils]: 1: Hoare triple {1278#(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_cstrcspn_~s2.base)) oldRank0) (<= (+ 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); {1278#(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_cstrcspn_~s2.base)) oldRank0) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} is VALID [2020-07-29 01:39:46,622 INFO L280 TraceCheckUtils]: 2: Hoare triple {1278#(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_cstrcspn_~s2.base)) oldRank0) (<= (+ 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; {1122#(and (or unseeded (and (> oldRank0 (+ (select |#length| ULTIMATE.start_cstrcspn_~s2.base) (* 2 ULTIMATE.start_cstrcspn_~s~0.offset))) (>= oldRank0 0))) (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base))} is VALID [2020-07-29 01:39:46,622 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,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:39:46,637 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,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,638 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:39:46,638 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2020-07-29 01:39:46,733 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 46 states and 58 transitions. Complement of second has 5 states. [2020-07-29 01:39:46,733 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:46,733 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:46,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. cyclomatic complexity: 11 [2020-07-29 01:39:46,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:46,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:46,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:39:46,734 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:46,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:46,734 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:46,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 58 transitions. [2020-07-29 01:39:46,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:46,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:46,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:46,736 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 36 transitions. cyclomatic complexity: 11 [2020-07-29 01:39:46,736 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:39:46,736 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:39:46,737 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:46,737 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:39:46,737 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 46 states and 58 transitions. cyclomatic complexity: 15 [2020-07-29 01:39:46,738 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:39:46,738 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,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,739 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,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:46,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:46,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:46,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,740 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,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,741 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,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,741 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,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 46 letters. Loop has 46 letters. [2020-07-29 01:39:46,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,741 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,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,742 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,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:39:46,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,742 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,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:46,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:46,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:46,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,743 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,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:39:46,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,744 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,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,744 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,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:39:46,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,745 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,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,745 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,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,746 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,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:46,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:46,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:46,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,747 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,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:39:46,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,747 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,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,747 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,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,748 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,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,748 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,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:39:46,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,749 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,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,749 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:46,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:39:46,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2020-07-29 01:39:46,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,750 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:39:46,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:46,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:39:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:46,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:46,820 INFO L280 TraceCheckUtils]: 0: Hoare triple {975#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {975#unseeded} is VALID [2020-07-29 01:39:46,821 INFO L280 TraceCheckUtils]: 1: Hoare triple {975#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; {975#unseeded} is VALID [2020-07-29 01:39:46,821 INFO L280 TraceCheckUtils]: 2: Hoare triple {975#unseeded} assume !(main_~length1~0 < 1); {975#unseeded} is VALID [2020-07-29 01:39:46,822 INFO L280 TraceCheckUtils]: 3: Hoare triple {975#unseeded} assume !(main_~length2~0 < 1); {975#unseeded} is VALID [2020-07-29 01:39:46,823 INFO L280 TraceCheckUtils]: 4: Hoare triple {975#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 + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 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; {975#unseeded} is VALID [2020-07-29 01:39:46,823 INFO L280 TraceCheckUtils]: 5: Hoare triple {975#unseeded} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {975#unseeded} is VALID [2020-07-29 01:39:46,827 INFO L280 TraceCheckUtils]: 6: Hoare triple {975#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; {975#unseeded} is VALID [2020-07-29 01:39:46,828 INFO L280 TraceCheckUtils]: 7: Hoare triple {975#unseeded} call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; {975#unseeded} is VALID [2020-07-29 01:39:46,829 INFO L280 TraceCheckUtils]: 8: Hoare triple {975#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); {975#unseeded} is VALID [2020-07-29 01:39:46,829 INFO L280 TraceCheckUtils]: 9: Hoare triple {975#unseeded} assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; {975#unseeded} is VALID [2020-07-29 01:39:46,829 INFO L280 TraceCheckUtils]: 10: Hoare triple {975#unseeded} call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); {975#unseeded} is VALID [2020-07-29 01:39:46,830 INFO L280 TraceCheckUtils]: 11: Hoare triple {975#unseeded} assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; {975#unseeded} is VALID [2020-07-29 01:39:46,830 INFO L280 TraceCheckUtils]: 12: Hoare triple {975#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, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; {975#unseeded} is VALID [2020-07-29 01:39:46,831 INFO L280 TraceCheckUtils]: 13: Hoare triple {975#unseeded} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {975#unseeded} is VALID [2020-07-29 01:39:46,831 INFO L280 TraceCheckUtils]: 14: Hoare triple {975#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; {1119#(and (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:46,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:39:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:46,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:46,879 INFO L280 TraceCheckUtils]: 0: Hoare triple {1120#(and (>= oldRank0 (+ (select |#length| ULTIMATE.start_cstrcspn_~s2.base) (* 2 ULTIMATE.start_cstrcspn_~s~0.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; {1386#(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_cstrcspn_~s2.base)) oldRank0) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} is VALID [2020-07-29 01:39:46,880 INFO L280 TraceCheckUtils]: 1: Hoare triple {1386#(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_cstrcspn_~s2.base)) oldRank0) (<= (+ 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); {1386#(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_cstrcspn_~s2.base)) oldRank0) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} is VALID [2020-07-29 01:39:46,882 INFO L280 TraceCheckUtils]: 2: Hoare triple {1386#(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_cstrcspn_~s2.base)) oldRank0) (<= (+ 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; {1122#(and (or unseeded (and (> oldRank0 (+ (select |#length| ULTIMATE.start_cstrcspn_~s2.base) (* 2 ULTIMATE.start_cstrcspn_~s~0.offset))) (>= oldRank0 0))) (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base))} is VALID [2020-07-29 01:39:46,882 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,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:39:46,898 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,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:46,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:46,899 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:39:46,899 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2020-07-29 01:39:47,010 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 45 states and 60 transitions. Complement of second has 4 states. [2020-07-29 01:39:47,010 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:47,011 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:47,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. cyclomatic complexity: 11 [2020-07-29 01:39:47,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:47,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:47,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:39:47,012 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:47,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:47,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:47,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 60 transitions. [2020-07-29 01:39:47,013 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:39:47,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:39:47,014 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 36 transitions. cyclomatic complexity: 11 [2020-07-29 01:39:47,014 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:39:47,014 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:39:47,016 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:47,016 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:39:47,016 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 60 transitions. cyclomatic complexity: 18 [2020-07-29 01:39:47,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 60 transitions. cyclomatic complexity: 18 [2020-07-29 01:39:47,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:39:47,017 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:39:47,017 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:47,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:47,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,018 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:47,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:47,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:47,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 60 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:47,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,019 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:47,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 45 letters. Loop has 45 letters. [2020-07-29 01:39:47,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,020 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:47,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,020 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:47,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:39:47,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,021 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:47,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:47,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:47,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 60 transitions. cyclomatic complexity: 18 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:47,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,022 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:47,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:39:47,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,023 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:47,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,023 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:47,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:39:47,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,023 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:47,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,024 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:47,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:47,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,024 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:47,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:47,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:47,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 60 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:47,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,025 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:47,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:39:47,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2020-07-29 01:39:47,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:47,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:39:47,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2020-07-29 01:39:47,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. cyclomatic complexity: 18 [2020-07-29 01:39:47,029 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:39:47,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2020-07-29 01:39:47,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:39:47,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:39:47,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:39:47,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:39:47,030 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:39:47,030 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:39:47,030 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:39:47,030 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:39:47,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:39:47,030 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:39:47,030 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:39:47,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:39:47 BoogieIcfgContainer [2020-07-29 01:39:47,036 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:39:47,037 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:39:47,037 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:39:47,037 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:39:47,037 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:47,040 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:39:47,040 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:39:47,041 INFO L168 Benchmark]: Toolchain (without parser) took 18950.43 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 410.5 MB). Free memory was 954.9 MB in the beginning and 862.7 MB in the end (delta: 92.1 MB). Peak memory consumption was 502.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:47,042 INFO L168 Benchmark]: CDTParser took 0.37 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:47,042 INFO L168 Benchmark]: CACSL2BoogieTranslator took 705.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -166.7 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:47,043 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.33 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:47,043 INFO L168 Benchmark]: Boogie Preprocessor took 36.93 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:47,043 INFO L168 Benchmark]: RCFGBuilder took 492.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:47,044 INFO L168 Benchmark]: BuchiAutomizer took 17644.34 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 263.2 MB). Free memory was 1.1 GB in the beginning and 862.7 MB in the end (delta: 221.0 MB). Peak memory consumption was 484.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:47,044 INFO L168 Benchmark]: Witness Printer took 3.36 ms. Allocated memory is still 1.4 GB. Free memory is still 862.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:39:47,047 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.37 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 705.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -166.7 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.33 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 36.93 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 492.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17644.34 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 263.2 MB). Free memory was 1.1 GB in the beginning and 862.7 MB in the end (delta: 221.0 MB). Peak memory consumption was 484.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.36 ms. Allocated memory is still 1.4 GB. Free memory is still 862.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length1 * sizeof(char))] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length1 * sizeof(char))] + s2 + 2 * s and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s2] + 2 * s and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.5s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 15.0s. Construction of modules took 0.2s. Büchi inclusion checks took 2.0s. 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: 107 SDtfs, 135 SDslu, 65 SDs, 0 SdLazy, 114 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital279 mio100 ax100 hnf99 lsp105 ukn84 mio100 lsp38 div114 bol100 ite100 ukn100 eq177 hnf83 smp94 dnf835 smp24 tf100 neg94 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 183ms 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...