./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/array15_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/array15_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 73a986a1d92244ec74fbbfc5c06684e9b6828bb2 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:38:32,054 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:38:32,057 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:38:32,069 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:38:32,071 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:38:32,073 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:38:32,074 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:38:32,078 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:38:32,087 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:38:32,090 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:38:32,091 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:38:32,093 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:38:32,094 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:38:32,097 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:38:32,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:38:32,101 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:38:32,102 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:38:32,107 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:38:32,109 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:38:32,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:38:32,116 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:38:32,119 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:38:32,123 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:38:32,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:38:32,127 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:38:32,130 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:38:32,130 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:38:32,132 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:38:32,133 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:38:32,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:38:32,134 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:38:32,136 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:38:32,137 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:38:32,138 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:38:32,141 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:38:32,141 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:38:32,142 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:38:32,142 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:38:32,142 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:38:32,143 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:38:32,145 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:38:32,145 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:38:32,187 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:38:32,190 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:38:32,191 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:38:32,193 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:38:32,194 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:38:32,194 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:38:32,194 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:38:32,194 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:38:32,195 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:38:32,196 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:38:32,196 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:38:32,197 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:38:32,197 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:38:32,197 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:38:32,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:38:32,198 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:38:32,199 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:38:32,200 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:38:32,200 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:38:32,201 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:38:32,201 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:38:32,201 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:38:32,201 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:38:32,202 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:38:32,202 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:38:32,203 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:38:32,203 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:38:32,203 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:38:32,204 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:38:32,205 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:38:32,206 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 -> 73a986a1d92244ec74fbbfc5c06684e9b6828bb2 [2020-07-29 01:38:32,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:38:32,565 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:38:32,569 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:38:32,571 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:38:32,571 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:38:32,572 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/array15_alloca.i [2020-07-29 01:38:32,631 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/438a5e05f/5e5374b17d334677821196280d21c5e4/FLAGd9faf5ac1 [2020-07-29 01:38:33,089 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:38:33,089 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array15_alloca.i [2020-07-29 01:38:33,102 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/438a5e05f/5e5374b17d334677821196280d21c5e4/FLAGd9faf5ac1 [2020-07-29 01:38:33,460 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/438a5e05f/5e5374b17d334677821196280d21c5e4 [2020-07-29 01:38:33,463 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:38:33,466 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:38:33,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:38:33,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:38:33,471 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:38:33,472 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:38:33" (1/1) ... [2020-07-29 01:38:33,475 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f0a3ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:33, skipping insertion in model container [2020-07-29 01:38:33,475 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:38:33" (1/1) ... [2020-07-29 01:38:33,483 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:38:33,534 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:38:33,926 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:38:33,942 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:38:34,040 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:38:34,144 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:38:34,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:34 WrapperNode [2020-07-29 01:38:34,145 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:38:34,147 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:38:34,147 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:38:34,147 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:38:34,158 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:38:34" (1/1) ... [2020-07-29 01:38:34,172 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:38:34" (1/1) ... [2020-07-29 01:38:34,199 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:38:34,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:38:34,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:38:34,199 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:38:34,208 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:34" (1/1) ... [2020-07-29 01:38:34,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:34" (1/1) ... [2020-07-29 01:38:34,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:34" (1/1) ... [2020-07-29 01:38:34,211 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:34" (1/1) ... [2020-07-29 01:38:34,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:34" (1/1) ... [2020-07-29 01:38:34,229 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:34" (1/1) ... [2020-07-29 01:38:34,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:34" (1/1) ... [2020-07-29 01:38:34,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:38:34,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:38:34,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:38:34,235 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:38:34,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:34" (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:38:34,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:38:34,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:38:34,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:38:34,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:38:34,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:38:34,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:38:34,634 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:38:34,635 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-29 01:38:34,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:38:34 BoogieIcfgContainer [2020-07-29 01:38:34,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:38:34,640 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:38:34,640 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:38:34,643 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:38:34,645 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:38:34,645 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:38:33" (1/3) ... [2020-07-29 01:38:34,646 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5343934f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:38:34, skipping insertion in model container [2020-07-29 01:38:34,646 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:38:34,647 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:34" (2/3) ... [2020-07-29 01:38:34,647 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5343934f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:38:34, skipping insertion in model container [2020-07-29 01:38:34,647 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:38:34,648 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:38:34" (3/3) ... [2020-07-29 01:38:34,649 INFO L371 chiAutomizerObserver]: Analyzing ICFG array15_alloca.i [2020-07-29 01:38:34,702 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:38:34,702 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:38:34,702 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:38:34,702 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:38:34,703 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:38:34,703 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:38:34,703 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:38:34,703 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:38:34,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 01:38:34,746 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:38:34,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:34,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:34,754 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:38:34,754 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:38:34,754 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:38:34,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 01:38:34,759 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:38:34,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:34,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:34,760 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:38:34,760 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:38:34,767 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 16#L367true assume !(main_~length~0 < 1); 5#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 12#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 17#L370-3true [2020-07-29 01:38:34,768 INFO L796 eck$LassoCheckResult]: Loop: 17#L370-3true assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 9#L372true assume main_#t~mem209 < 0;havoc main_#t~mem209;call write~int(0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 14#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 17#L370-3true [2020-07-29 01:38:34,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:34,773 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2020-07-29 01:38:34,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:34,783 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926441375] [2020-07-29 01:38:34,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:34,877 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:34,889 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:34,911 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:34,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:34,912 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2020-07-29 01:38:34,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:34,913 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622354256] [2020-07-29 01:38:34,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:34,926 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:34,940 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:34,944 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:34,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:34,946 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2020-07-29 01:38:34,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:34,947 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866105351] [2020-07-29 01:38:34,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:34,970 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:34,990 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:35,000 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:35,343 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:38:35,344 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:38:35,344 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:38:35,345 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:38:35,345 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:38:35,345 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:35,345 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:38:35,345 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:38:35,346 INFO L133 ssoRankerPreferences]: Filename of dumped script: array15_alloca.i_Iteration1_Lasso [2020-07-29 01:38:35,346 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:38:35,346 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:38:35,389 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:38:35,399 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:38:35,405 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:38:35,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:38:35,416 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:38:35,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:35,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:35,447 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:38:35,453 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:38:35,468 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:38:35,630 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:38:35,635 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:38:36,182 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:38:36,188 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:36,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:36,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:36,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:36,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:36,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:36,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:36,202 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:36,202 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:36,205 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:36,260 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:36,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:36,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:36,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:36,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:36,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:36,264 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:36,264 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:36,266 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:38:36,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:38:36,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:36,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:36,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:36,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:36,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:36,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:36,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:36,318 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:36,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:36,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:36,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:36,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:36,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:36,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:36,371 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:36,371 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:36,373 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:36,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:36,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:36,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:36,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:36,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:36,426 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:36,426 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:36,431 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:38:36,471 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:38:36,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:36,473 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:36,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:36,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:36,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:36,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:36,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:36,477 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:38:36,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:36,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:36,509 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:36,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:36,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:36,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:36,514 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:36,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:36,519 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:38:36,555 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:38:36,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:36,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:36,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:36,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:36,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:36,558 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:36,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:36,566 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:38:36,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:36,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:36,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:36,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:36,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:36,607 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:36,608 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:36,612 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:38:36,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:36,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:36,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:36,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:36,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:36,661 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:36,661 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:36,678 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:38:36,816 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-07-29 01:38:36,817 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. 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:38:36,838 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:38:36,846 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:38:36,847 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:38:36,849 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2020-07-29 01:38:36,907 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 01:38:36,913 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);" "assume main_#t~mem209 < 0;havoc main_#t~mem209;call write~int(0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);" "main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207;" [2020-07-29 01:38:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:36,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:36,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:38:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:37,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:37,026 INFO L280 TraceCheckUtils]: 0: Hoare triple {25#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {25#unseeded} is VALID [2020-07-29 01:38:37,027 INFO L280 TraceCheckUtils]: 1: Hoare triple {25#unseeded} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {25#unseeded} is VALID [2020-07-29 01:38:37,028 INFO L280 TraceCheckUtils]: 2: Hoare triple {25#unseeded} assume !(main_~length~0 < 1); {25#unseeded} is VALID [2020-07-29 01:38:37,029 INFO L280 TraceCheckUtils]: 3: Hoare triple {25#unseeded} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {25#unseeded} is VALID [2020-07-29 01:38:37,030 INFO L280 TraceCheckUtils]: 4: Hoare triple {25#unseeded} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {25#unseeded} is VALID [2020-07-29 01:38:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:37,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:38:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:37,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:37,070 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~length~0))} assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {70#(and (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~length~0))} is VALID [2020-07-29 01:38:37,071 INFO L280 TraceCheckUtils]: 1: Hoare triple {70#(and (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~length~0))} assume main_#t~mem209 < 0;havoc main_#t~mem209;call write~int(0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {70#(and (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~length~0))} is VALID [2020-07-29 01:38:37,072 INFO L280 TraceCheckUtils]: 2: Hoare triple {70#(and (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~length~0))} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {53#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~length~0))) unseeded)} is VALID [2020-07-29 01:38:37,073 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:38:37,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:38:37,097 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:38:37,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:38:37,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,107 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:38:37,109 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2020-07-29 01:38:37,236 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 35 states and 50 transitions. Complement of second has 7 states. [2020-07-29 01:38:37,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:38:37,237 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:37,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 01:38:37,240 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:38:37,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:37,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:37,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:38:37,247 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:38:37,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:37,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:37,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 50 transitions. [2020-07-29 01:38:37,250 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:37,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:37,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:37,253 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states. [2020-07-29 01:38:37,274 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:38:37,275 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:38:37,275 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:38:37,278 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:38:37,278 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:38:37,278 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 35 states and 50 transitions. cyclomatic complexity: 19 [2020-07-29 01:38:37,279 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:38:37,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:38:37,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:38:37,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:38:37,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:37,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:37,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:37,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:38:37,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:38:37,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:38:37,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:38:37,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:38:37,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:38:37,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:38:37,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:38:37,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:38:37,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:38:37,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:38:37,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:38:37,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:38:37,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:38:37,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:38:37,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:38:37,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:38:37,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:38:37,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:38:37,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:38:37,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:38:37,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:38:37,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:38:37,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:38:37,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:38:37,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:38:37,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:38:37,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:38:37,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:38:37,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:38:37,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:37,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:37,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:37,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:38:37,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:38:37,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:38:37,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:38:37,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:38:37,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:38:37,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,297 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:37,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:38:37,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-29 01:38:37,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:38:37,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:38:37,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2020-07-29 01:38:37,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:37,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. cyclomatic complexity: 19 [2020-07-29 01:38:37,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:37,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2020-07-29 01:38:37,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 01:38:37,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 01:38:37,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2020-07-29 01:38:37,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:38:37,317 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-07-29 01:38:37,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2020-07-29 01:38:37,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-29 01:38:37,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:38:37,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 17 transitions. Second operand 12 states. [2020-07-29 01:38:37,365 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 17 transitions. Second operand 12 states. [2020-07-29 01:38:37,367 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. Second operand 12 states. [2020-07-29 01:38:37,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:37,372 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2020-07-29 01:38:37,373 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2020-07-29 01:38:37,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:37,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:37,374 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states and 17 transitions. [2020-07-29 01:38:37,374 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states and 17 transitions. [2020-07-29 01:38:37,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:37,376 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2020-07-29 01:38:37,376 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2020-07-29 01:38:37,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:37,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:37,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:38:37,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:38:37,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:38:37,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2020-07-29 01:38:37,379 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-07-29 01:38:37,379 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-07-29 01:38:37,380 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:38:37,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2020-07-29 01:38:37,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:37,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:37,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:37,381 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:38:37,381 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:38:37,381 INFO L794 eck$LassoCheckResult]: Stem: 128#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 124#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 125#L367 assume !(main_~length~0 < 1); 130#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 131#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 132#L370-3 assume !(main_~i~0 < main_~length~0); 126#L370-4 main_~j~0 := 0; 127#L378-2 [2020-07-29 01:38:37,382 INFO L796 eck$LassoCheckResult]: Loop: 127#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 129#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 127#L378-2 [2020-07-29 01:38:37,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:37,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2020-07-29 01:38:37,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:37,384 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819575469] [2020-07-29 01:38:37,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:37,485 INFO L280 TraceCheckUtils]: 0: Hoare triple {161#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {161#true} is VALID [2020-07-29 01:38:37,486 INFO L280 TraceCheckUtils]: 1: Hoare triple {161#true} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {161#true} is VALID [2020-07-29 01:38:37,487 INFO L280 TraceCheckUtils]: 2: Hoare triple {161#true} assume !(main_~length~0 < 1); {163#(<= 1 ULTIMATE.start_main_~length~0)} is VALID [2020-07-29 01:38:37,488 INFO L280 TraceCheckUtils]: 3: Hoare triple {163#(<= 1 ULTIMATE.start_main_~length~0)} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {163#(<= 1 ULTIMATE.start_main_~length~0)} is VALID [2020-07-29 01:38:37,489 INFO L280 TraceCheckUtils]: 4: Hoare triple {163#(<= 1 ULTIMATE.start_main_~length~0)} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {164#(and (= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~length~0))} is VALID [2020-07-29 01:38:37,490 INFO L280 TraceCheckUtils]: 5: Hoare triple {164#(and (= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~length~0))} assume !(main_~i~0 < main_~length~0); {162#false} is VALID [2020-07-29 01:38:37,491 INFO L280 TraceCheckUtils]: 6: Hoare triple {162#false} main_~j~0 := 0; {162#false} is VALID [2020-07-29 01:38:37,492 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:38:37,492 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819575469] [2020-07-29 01:38:37,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:38:37,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:38:37,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028079282] [2020-07-29 01:38:37,498 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:38:37,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:37,498 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2020-07-29 01:38:37,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:37,499 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288694650] [2020-07-29 01:38:37,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:37,505 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:37,510 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:37,512 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:37,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:38:37,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:38:37,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:38:37,565 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-07-29 01:38:37,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:37,634 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2020-07-29 01:38:37,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:38:37,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:38:37,644 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:38:37,645 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2020-07-29 01:38:37,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:37,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2020-07-29 01:38:37,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 01:38:37,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 01:38:37,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2020-07-29 01:38:37,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:38:37,649 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-07-29 01:38:37,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2020-07-29 01:38:37,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2020-07-29 01:38:37,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:38:37,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 19 transitions. Second operand 12 states. [2020-07-29 01:38:37,651 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 19 transitions. Second operand 12 states. [2020-07-29 01:38:37,651 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 12 states. [2020-07-29 01:38:37,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:37,652 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2020-07-29 01:38:37,653 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2020-07-29 01:38:37,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:37,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:37,653 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 14 states and 19 transitions. [2020-07-29 01:38:37,654 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 14 states and 19 transitions. [2020-07-29 01:38:37,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:37,655 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2020-07-29 01:38:37,655 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2020-07-29 01:38:37,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:37,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:37,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:38:37,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:38:37,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:38:37,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2020-07-29 01:38:37,658 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-29 01:38:37,658 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-29 01:38:37,658 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:38:37,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2020-07-29 01:38:37,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:37,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:37,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:37,660 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:38:37,660 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:38:37,660 INFO L794 eck$LassoCheckResult]: Stem: 187#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 181#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 182#L367 assume !(main_~length~0 < 1); 189#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 190#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 191#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 183#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 184#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 192#L370-3 assume !(main_~i~0 < main_~length~0); 185#L370-4 main_~j~0 := 0; 186#L378-2 [2020-07-29 01:38:37,660 INFO L796 eck$LassoCheckResult]: Loop: 186#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 188#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 186#L378-2 [2020-07-29 01:38:37,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:37,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2020-07-29 01:38:37,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:37,661 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572565696] [2020-07-29 01:38:37,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:37,675 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:37,689 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:37,693 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:37,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:37,693 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2020-07-29 01:38:37,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:37,694 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72579539] [2020-07-29 01:38:37,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:37,699 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:37,703 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:37,705 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:37,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:37,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2020-07-29 01:38:37,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:37,707 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236125472] [2020-07-29 01:38:37,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:37,722 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:37,746 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:37,756 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:37,946 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2020-07-29 01:38:38,048 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:38:38,048 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:38:38,048 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:38:38,049 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:38:38,049 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:38:38,049 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:38,049 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:38:38,049 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:38:38,049 INFO L133 ssoRankerPreferences]: Filename of dumped script: array15_alloca.i_Iteration3_Lasso [2020-07-29 01:38:38,049 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:38:38,049 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:38:38,069 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:38:38,073 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:38:38,077 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:38:38,082 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:38:38,233 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:38:38,234 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:38:38,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:38:38,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:38:38,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:38,254 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:38:38,258 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:38:38,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:38:38,266 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:38:38,271 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:38:38,737 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:38:38,737 INFO L489 LassoAnalysis]: Using template 'affine'. 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:38:38,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:38,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:38,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:38,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:38,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:38,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:38,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:38,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:38,756 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:38,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:38,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:38,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:38,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:38,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:38,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:38,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:38,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:38,802 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:38:38,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:38,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:38,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:38,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:38,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:38,830 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:38,830 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:38,835 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:38:38,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:38:38,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:38,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:38,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:38,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:38,865 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:38,865 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:38,872 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:38,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:38,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:38,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:38,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:38,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:38,922 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:38,922 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:38,927 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) [2020-07-29 01:38:38,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:38:38,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:38,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:38,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:38,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:38,972 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:38,973 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:38,989 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:38:39,033 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2020-07-29 01:38:39,034 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 16 variables to zero. 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:38:39,036 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:38:39,038 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:38:39,038 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:38:39,038 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_2, ULTIMATE.start_main_~j~0) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_2 + 8*ULTIMATE.start_main_~j~0 Supporting invariants [] [2020-07-29 01:38:39,072 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 01:38:39,081 INFO L393 LassoCheck]: Loop: "assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);" "assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211;" [2020-07-29 01:38:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:39,095 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:38:39,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:39,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:38:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:39,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:39,161 INFO L280 TraceCheckUtils]: 0: Hoare triple {230#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {230#unseeded} is VALID [2020-07-29 01:38:39,162 INFO L280 TraceCheckUtils]: 1: Hoare triple {230#unseeded} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {230#unseeded} is VALID [2020-07-29 01:38:39,163 INFO L280 TraceCheckUtils]: 2: Hoare triple {230#unseeded} assume !(main_~length~0 < 1); {230#unseeded} is VALID [2020-07-29 01:38:39,164 INFO L280 TraceCheckUtils]: 3: Hoare triple {230#unseeded} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {259#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} is VALID [2020-07-29 01:38:39,165 INFO L280 TraceCheckUtils]: 4: Hoare triple {259#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {259#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} is VALID [2020-07-29 01:38:39,166 INFO L280 TraceCheckUtils]: 5: Hoare triple {259#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {259#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} is VALID [2020-07-29 01:38:39,167 INFO L280 TraceCheckUtils]: 6: Hoare triple {259#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} assume !(main_#t~mem209 < 0);havoc main_#t~mem209; {259#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} is VALID [2020-07-29 01:38:39,168 INFO L280 TraceCheckUtils]: 7: Hoare triple {259#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {259#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} is VALID [2020-07-29 01:38:39,169 INFO L280 TraceCheckUtils]: 8: Hoare triple {259#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} assume !(main_~i~0 < main_~length~0); {259#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} is VALID [2020-07-29 01:38:39,169 INFO L280 TraceCheckUtils]: 9: Hoare triple {259#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} main_~j~0 := 0; {259#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} is VALID [2020-07-29 01:38:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:39,175 WARN L261 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:38:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:39,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:39,257 INFO L280 TraceCheckUtils]: 0: Hoare triple {260#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc206.base|) (* 8 ULTIMATE.start_main_~j~0))))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {295#(and (<= 0 ULTIMATE.start_main_~j~0) (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) (<= 4 (select |#length| ULTIMATE.start_main_~arr~0.base)) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc206.base|) (* 8 ULTIMATE.start_main_~j~0)) oldRank0))} is VALID [2020-07-29 01:38:39,259 INFO L280 TraceCheckUtils]: 1: Hoare triple {295#(and (<= 0 ULTIMATE.start_main_~j~0) (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) (<= 4 (select |#length| ULTIMATE.start_main_~arr~0.base)) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc206.base|) (* 8 ULTIMATE.start_main_~j~0)) oldRank0))} assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; {262#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) (or (and (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc206.base|) (* 8 ULTIMATE.start_main_~j~0))) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:38:39,259 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:38:39,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:38:39,282 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:38:39,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:38:39,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,283 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:38:39,283 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2020-07-29 01:38:39,366 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 16 states and 22 transitions. Complement of second has 6 states. [2020-07-29 01:38:39,366 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:38:39,366 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:39,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. cyclomatic complexity: 6 [2020-07-29 01:38:39,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:39,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:39,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:38:39,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:39,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:39,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:39,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2020-07-29 01:38:39,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:39,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:39,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:39,372 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 16 transitions. cyclomatic complexity: 6 [2020-07-29 01:38:39,375 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:38:39,377 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:38:39,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:39,380 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:38:39,380 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 22 transitions. cyclomatic complexity: 9 [2020-07-29 01:38:39,381 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:38:39,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:38:39,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:38:39,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:38:39,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:38:39,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:38:39,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:38:39,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:38:39,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:38:39,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:38:39,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:38:39,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:38:39,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:38:39,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:38:39,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:38:39,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:38:39,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:38:39,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:38:39,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:38:39,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:38:39,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:38:39,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:38:39,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:38:39,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:38:39,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:38:39,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:38:39,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:38:39,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:38:39,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:38:39,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:38:39,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:38:39,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:38:39,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:38:39,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:38:39,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,402 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:39,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:38:39,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2020-07-29 01:38:39,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:38:39,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:38:39,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:38:39,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. cyclomatic complexity: 9 [2020-07-29 01:38:39,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:39,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2020-07-29 01:38:39,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:38:39,412 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:38:39,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2020-07-29 01:38:39,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:38:39,413 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-07-29 01:38:39,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2020-07-29 01:38:39,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-29 01:38:39,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:38:39,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 22 transitions. Second operand 16 states. [2020-07-29 01:38:39,415 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 22 transitions. Second operand 16 states. [2020-07-29 01:38:39,416 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 16 states. [2020-07-29 01:38:39,416 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:38:39,419 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2020-07-29 01:38:39,419 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2020-07-29 01:38:39,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:39,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:39,422 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states and 22 transitions. [2020-07-29 01:38:39,422 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states and 22 transitions. [2020-07-29 01:38:39,424 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:38:39,433 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2020-07-29 01:38:39,433 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2020-07-29 01:38:39,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:39,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:39,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:38:39,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:38:39,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 01:38:39,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2020-07-29 01:38:39,436 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-07-29 01:38:39,436 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-07-29 01:38:39,436 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:38:39,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2020-07-29 01:38:39,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:39,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:39,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:39,442 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:38:39,442 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:38:39,443 INFO L794 eck$LassoCheckResult]: Stem: 331#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 325#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 326#L367 assume !(main_~length~0 < 1); 337#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 338#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 339#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 327#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 328#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 340#L370-3 assume !(main_~i~0 < main_~length~0); 329#L370-4 main_~j~0 := 0; 330#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 336#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 332#L378-2 [2020-07-29 01:38:39,443 INFO L796 eck$LassoCheckResult]: Loop: 332#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 333#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 332#L378-2 [2020-07-29 01:38:39,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:39,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2020-07-29 01:38:39,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:39,444 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206209191] [2020-07-29 01:38:39,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:39,484 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:39,502 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:39,506 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:39,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:39,506 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2020-07-29 01:38:39,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:39,507 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430459463] [2020-07-29 01:38:39,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:39,514 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:39,517 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:39,519 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:39,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:39,519 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2020-07-29 01:38:39,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:39,520 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170876109] [2020-07-29 01:38:39,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:39,686 INFO L280 TraceCheckUtils]: 0: Hoare triple {436#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {436#true} is VALID [2020-07-29 01:38:39,686 INFO L280 TraceCheckUtils]: 1: Hoare triple {436#true} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {436#true} is VALID [2020-07-29 01:38:39,687 INFO L280 TraceCheckUtils]: 2: Hoare triple {436#true} assume !(main_~length~0 < 1); {436#true} is VALID [2020-07-29 01:38:39,688 INFO L280 TraceCheckUtils]: 3: Hoare triple {436#true} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {438#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:39,689 INFO L280 TraceCheckUtils]: 4: Hoare triple {438#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {439#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:39,691 INFO L280 TraceCheckUtils]: 5: Hoare triple {439#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {439#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:39,692 INFO L280 TraceCheckUtils]: 6: Hoare triple {439#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !(main_#t~mem209 < 0);havoc main_#t~mem209; {439#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:39,693 INFO L280 TraceCheckUtils]: 7: Hoare triple {439#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {440#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~arr~0.offset) (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 01:38:39,694 INFO L280 TraceCheckUtils]: 8: Hoare triple {440#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~arr~0.offset) (<= ULTIMATE.start_main_~i~0 1))} assume !(main_~i~0 < main_~length~0); {441#(and (<= (select |#length| ULTIMATE.start_main_~arr~0.base) 4) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:39,695 INFO L280 TraceCheckUtils]: 9: Hoare triple {441#(and (<= (select |#length| ULTIMATE.start_main_~arr~0.base) 4) (= 0 ULTIMATE.start_main_~arr~0.offset))} main_~j~0 := 0; {442#(and (<= (select |#length| ULTIMATE.start_main_~arr~0.base) 4) (= 0 ULTIMATE.start_main_~j~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:39,696 INFO L280 TraceCheckUtils]: 10: Hoare triple {442#(and (<= (select |#length| ULTIMATE.start_main_~arr~0.base) 4) (= 0 ULTIMATE.start_main_~j~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {442#(and (<= (select |#length| ULTIMATE.start_main_~arr~0.base) 4) (= 0 ULTIMATE.start_main_~j~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:39,697 INFO L280 TraceCheckUtils]: 11: Hoare triple {442#(and (<= (select |#length| ULTIMATE.start_main_~arr~0.base) 4) (= 0 ULTIMATE.start_main_~j~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; {443#(and (= 0 ULTIMATE.start_main_~arr~0.offset) (<= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~j~0)))} is VALID [2020-07-29 01:38:39,698 INFO L280 TraceCheckUtils]: 12: Hoare triple {443#(and (= 0 ULTIMATE.start_main_~arr~0.offset) (<= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~j~0)))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {437#false} is VALID [2020-07-29 01:38:39,698 INFO L280 TraceCheckUtils]: 13: Hoare triple {437#false} assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; {437#false} is VALID [2020-07-29 01:38:39,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:38:39,700 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170876109] [2020-07-29 01:38:39,701 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192961809] [2020-07-29 01:38:39,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:38:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:39,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:38:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:39,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:39,971 INFO L280 TraceCheckUtils]: 0: Hoare triple {436#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {436#true} is VALID [2020-07-29 01:38:39,972 INFO L280 TraceCheckUtils]: 1: Hoare triple {436#true} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {436#true} is VALID [2020-07-29 01:38:39,972 INFO L280 TraceCheckUtils]: 2: Hoare triple {436#true} assume !(main_~length~0 < 1); {436#true} is VALID [2020-07-29 01:38:39,972 INFO L280 TraceCheckUtils]: 3: Hoare triple {436#true} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {436#true} is VALID [2020-07-29 01:38:39,973 INFO L280 TraceCheckUtils]: 4: Hoare triple {436#true} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {459#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:38:39,974 INFO L280 TraceCheckUtils]: 5: Hoare triple {459#(<= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {459#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:38:39,975 INFO L280 TraceCheckUtils]: 6: Hoare triple {459#(<= ULTIMATE.start_main_~i~0 0)} assume !(main_#t~mem209 < 0);havoc main_#t~mem209; {459#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:38:39,976 INFO L280 TraceCheckUtils]: 7: Hoare triple {459#(<= ULTIMATE.start_main_~i~0 0)} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {469#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:38:39,976 INFO L280 TraceCheckUtils]: 8: Hoare triple {469#(<= ULTIMATE.start_main_~i~0 1)} assume !(main_~i~0 < main_~length~0); {473#(<= ULTIMATE.start_main_~length~0 1)} is VALID [2020-07-29 01:38:39,977 INFO L280 TraceCheckUtils]: 9: Hoare triple {473#(<= ULTIMATE.start_main_~length~0 1)} main_~j~0 := 0; {477#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:38:39,978 INFO L280 TraceCheckUtils]: 10: Hoare triple {477#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {477#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:38:39,984 INFO L280 TraceCheckUtils]: 11: Hoare triple {477#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; {484#(and (<= ULTIMATE.start_main_~length~0 1) (<= 1 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:38:39,986 INFO L280 TraceCheckUtils]: 12: Hoare triple {484#(and (<= ULTIMATE.start_main_~length~0 1) (<= 1 ULTIMATE.start_main_~j~0))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {437#false} is VALID [2020-07-29 01:38:39,986 INFO L280 TraceCheckUtils]: 13: Hoare triple {437#false} assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; {437#false} is VALID [2020-07-29 01:38:39,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:38:39,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:38:39,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2020-07-29 01:38:39,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18344863] [2020-07-29 01:38:40,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:38:40,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-29 01:38:40,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2020-07-29 01:38:40,093 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 13 states. [2020-07-29 01:38:40,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:40,682 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2020-07-29 01:38:40,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-29 01:38:40,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-29 01:38:40,721 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:38:40,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 45 transitions. [2020-07-29 01:38:40,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:40,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 28 transitions. [2020-07-29 01:38:40,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:38:40,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:38:40,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2020-07-29 01:38:40,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:38:40,725 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2020-07-29 01:38:40,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2020-07-29 01:38:40,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2020-07-29 01:38:40,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:38:40,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 28 transitions. Second operand 19 states. [2020-07-29 01:38:40,727 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 28 transitions. Second operand 19 states. [2020-07-29 01:38:40,727 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand 19 states. [2020-07-29 01:38:40,728 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:38:40,730 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2020-07-29 01:38:40,730 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2020-07-29 01:38:40,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:40,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:40,730 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 21 states and 28 transitions. [2020-07-29 01:38:40,730 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 21 states and 28 transitions. [2020-07-29 01:38:40,731 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:38:40,733 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2020-07-29 01:38:40,733 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2020-07-29 01:38:40,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:40,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:40,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:38:40,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:38:40,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-29 01:38:40,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2020-07-29 01:38:40,735 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-07-29 01:38:40,735 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-07-29 01:38:40,735 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:38:40,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2020-07-29 01:38:40,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:40,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:40,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:40,736 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:38:40,736 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:38:40,737 INFO L794 eck$LassoCheckResult]: Stem: 537#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 531#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 532#L367 assume !(main_~length~0 < 1); 543#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 544#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 545#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 548#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 546#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 547#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 533#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 534#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 549#L370-3 assume !(main_~i~0 < main_~length~0); 535#L370-4 main_~j~0 := 0; 536#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 541#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 538#L378-2 [2020-07-29 01:38:40,737 INFO L796 eck$LassoCheckResult]: Loop: 538#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 539#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 538#L378-2 [2020-07-29 01:38:40,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:40,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2020-07-29 01:38:40,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:40,738 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167551464] [2020-07-29 01:38:40,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:40,773 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:40,799 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:40,803 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:40,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:40,804 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2020-07-29 01:38:40,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:40,804 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983369122] [2020-07-29 01:38:40,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:40,808 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:40,810 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:40,812 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:40,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:40,812 INFO L82 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2020-07-29 01:38:40,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:40,813 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895342872] [2020-07-29 01:38:40,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:40,828 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:40,845 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:40,849 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:41,144 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 91 [2020-07-29 01:38:41,308 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:38:41,309 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:38:41,309 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:38:41,309 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:38:41,309 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:38:41,309 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:41,309 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:38:41,310 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:38:41,310 INFO L133 ssoRankerPreferences]: Filename of dumped script: array15_alloca.i_Iteration5_Lasso [2020-07-29 01:38:41,310 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:38:41,310 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:38:41,331 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:38:41,346 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:38:41,350 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:38:41,353 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:38:41,356 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:38:41,359 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:38:41,363 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:38:41,366 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:38:41,535 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 01:38:41,536 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:38:41,543 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:38:41,546 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:38:41,551 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:38:41,554 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:38:42,056 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:38:42,057 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:42,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:42,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:42,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:42,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:42,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:42,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:42,072 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:42,072 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:42,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:42,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:42,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:42,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:42,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:42,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:42,102 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:42,102 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:42,106 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:38:42,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:42,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:42,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:42,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:42,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:42,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:42,132 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:42,132 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:42,134 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:38:42,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:42,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:42,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:42,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:42,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:42,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:42,159 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:42,159 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:42,160 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:42,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:38:42,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:42,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:42,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:42,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:42,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:42,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:42,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:42,185 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:38:42,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:42,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:42,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:42,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:42,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:42,211 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:42,211 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:42,219 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:38:42,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:42,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:42,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:42,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:42,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:42,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:42,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:42,256 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:42,257 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:38:42,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:42,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:42,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:42,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:42,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:42,283 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:42,284 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:42,287 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:38:42,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:42,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:42,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:42,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:42,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:42,312 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:42,312 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:42,315 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:42,341 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:42,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:42,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:42,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:42,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:42,349 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:42,351 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:42,364 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:38:42,413 INFO L443 ModelExtractionUtils]: Simplification made 24 calls to the SMT solver. [2020-07-29 01:38:42,413 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 16 variables to zero. 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:38:42,415 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:38:42,417 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:38:42,417 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:38:42,417 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [] [2020-07-29 01:38:42,451 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-07-29 01:38:42,453 INFO L393 LassoCheck]: Loop: "assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);" "assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211;" [2020-07-29 01:38:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:42,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:42,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:38:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:42,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:42,503 INFO L280 TraceCheckUtils]: 0: Hoare triple {675#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {675#unseeded} is VALID [2020-07-29 01:38:42,504 INFO L280 TraceCheckUtils]: 1: Hoare triple {675#unseeded} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {675#unseeded} is VALID [2020-07-29 01:38:42,506 INFO L280 TraceCheckUtils]: 2: Hoare triple {675#unseeded} assume !(main_~length~0 < 1); {675#unseeded} is VALID [2020-07-29 01:38:42,507 INFO L280 TraceCheckUtils]: 3: Hoare triple {675#unseeded} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {675#unseeded} is VALID [2020-07-29 01:38:42,508 INFO L280 TraceCheckUtils]: 4: Hoare triple {675#unseeded} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {675#unseeded} is VALID [2020-07-29 01:38:42,508 INFO L280 TraceCheckUtils]: 5: Hoare triple {675#unseeded} assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {675#unseeded} is VALID [2020-07-29 01:38:42,510 INFO L280 TraceCheckUtils]: 6: Hoare triple {675#unseeded} assume !(main_#t~mem209 < 0);havoc main_#t~mem209; {675#unseeded} is VALID [2020-07-29 01:38:42,511 INFO L280 TraceCheckUtils]: 7: Hoare triple {675#unseeded} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {675#unseeded} is VALID [2020-07-29 01:38:42,511 INFO L280 TraceCheckUtils]: 8: Hoare triple {675#unseeded} assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {675#unseeded} is VALID [2020-07-29 01:38:42,512 INFO L280 TraceCheckUtils]: 9: Hoare triple {675#unseeded} assume !(main_#t~mem209 < 0);havoc main_#t~mem209; {675#unseeded} is VALID [2020-07-29 01:38:42,512 INFO L280 TraceCheckUtils]: 10: Hoare triple {675#unseeded} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {675#unseeded} is VALID [2020-07-29 01:38:42,512 INFO L280 TraceCheckUtils]: 11: Hoare triple {675#unseeded} assume !(main_~i~0 < main_~length~0); {675#unseeded} is VALID [2020-07-29 01:38:42,513 INFO L280 TraceCheckUtils]: 12: Hoare triple {675#unseeded} main_~j~0 := 0; {675#unseeded} is VALID [2020-07-29 01:38:42,513 INFO L280 TraceCheckUtils]: 13: Hoare triple {675#unseeded} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {675#unseeded} is VALID [2020-07-29 01:38:42,514 INFO L280 TraceCheckUtils]: 14: Hoare triple {675#unseeded} assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; {675#unseeded} is VALID [2020-07-29 01:38:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:42,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:38:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:42,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:42,548 INFO L280 TraceCheckUtils]: 0: Hoare triple {678#(>= oldRank0 (+ (* 2 ULTIMATE.start_main_~j~0) 1))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {755#(and (<= 0 ULTIMATE.start_main_~j~0) (<= (+ (* 2 ULTIMATE.start_main_~j~0) 1) oldRank0))} is VALID [2020-07-29 01:38:42,549 INFO L280 TraceCheckUtils]: 1: Hoare triple {755#(and (<= 0 ULTIMATE.start_main_~j~0) (<= (+ (* 2 ULTIMATE.start_main_~j~0) 1) oldRank0))} assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; {708#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* 2 ULTIMATE.start_main_~j~0) 1))))} is VALID [2020-07-29 01:38:42,550 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:38:42,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:38:42,560 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:38:42,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:38:42,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,561 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:38:42,561 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-07-29 01:38:42,598 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 23 states and 31 transitions. Complement of second has 5 states. [2020-07-29 01:38:42,598 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:38:42,598 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:42,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. cyclomatic complexity: 9 [2020-07-29 01:38:42,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:42,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:42,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:38:42,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:42,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:42,600 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:42,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2020-07-29 01:38:42,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:42,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:42,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:42,602 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 25 transitions. cyclomatic complexity: 9 [2020-07-29 01:38:42,603 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:38:42,603 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:38:42,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:42,605 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:38:42,605 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 23 states and 31 transitions. cyclomatic complexity: 12 [2020-07-29 01:38:42,606 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:38:42,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:38:42,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:38:42,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 31 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:38:42,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:42,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:42,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 31 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:42,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:38:42,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:38:42,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 31 transitions. cyclomatic complexity: 12 Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:38:42,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:38:42,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:38:42,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 31 transitions. cyclomatic complexity: 12 Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:38:42,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:38:42,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:38:42,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 31 transitions. cyclomatic complexity: 12 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:38:42,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:38:42,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:38:42,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 31 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:38:42,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:38:42,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:38:42,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 31 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:38:42,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:38:42,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:38:42,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 31 transitions. cyclomatic complexity: 12 Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:38:42,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:42,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:42,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 31 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:42,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:38:42,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:38:42,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 31 transitions. cyclomatic complexity: 12 Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:38:42,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 2 letters. [2020-07-29 01:38:42,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 2 letters. [2020-07-29 01:38:42,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 31 transitions. cyclomatic complexity: 12 Stem has 18 letters. Loop has 2 letters. [2020-07-29 01:38:42,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,621 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:42,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:38:42,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2020-07-29 01:38:42,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:38:42,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:38:42,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:38:42,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:42,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 31 transitions. cyclomatic complexity: 12 [2020-07-29 01:38:42,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:42,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 31 transitions. [2020-07-29 01:38:42,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 01:38:42,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 01:38:42,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2020-07-29 01:38:42,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:38:42,627 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2020-07-29 01:38:42,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2020-07-29 01:38:42,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-29 01:38:42,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:38:42,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states and 31 transitions. Second operand 23 states. [2020-07-29 01:38:42,630 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states and 31 transitions. Second operand 23 states. [2020-07-29 01:38:42,630 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 23 states. [2020-07-29 01:38:42,631 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:38:42,633 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2020-07-29 01:38:42,633 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2020-07-29 01:38:42,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:42,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:42,634 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states and 31 transitions. [2020-07-29 01:38:42,634 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states and 31 transitions. [2020-07-29 01:38:42,635 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:38:42,637 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2020-07-29 01:38:42,637 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2020-07-29 01:38:42,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:42,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:42,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:38:42,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:38:42,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-29 01:38:42,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2020-07-29 01:38:42,639 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2020-07-29 01:38:42,639 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2020-07-29 01:38:42,640 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:38:42,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2020-07-29 01:38:42,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:42,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:42,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:42,641 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:38:42,642 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:38:42,642 INFO L794 eck$LassoCheckResult]: Stem: 795#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 789#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 790#L367 assume !(main_~length~0 < 1); 801#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 802#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 803#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 807#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 804#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 805#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 791#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 792#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 808#L370-3 assume !(main_~i~0 < main_~length~0); 793#L370-4 main_~j~0 := 0; 794#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 799#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 806#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 809#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 796#L378-2 [2020-07-29 01:38:42,642 INFO L796 eck$LassoCheckResult]: Loop: 796#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 797#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 796#L378-2 [2020-07-29 01:38:42,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:42,643 INFO L82 PathProgramCache]: Analyzing trace with hash -685992544, now seen corresponding path program 3 times [2020-07-29 01:38:42,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:42,643 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565735654] [2020-07-29 01:38:42,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:42,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:42,659 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:42,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:42,675 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:42,682 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:42,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:42,683 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2020-07-29 01:38:42,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:42,684 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674696829] [2020-07-29 01:38:42,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:42,693 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:42,696 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:42,698 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:42,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:42,698 INFO L82 PathProgramCache]: Analyzing trace with hash -2108837149, now seen corresponding path program 3 times [2020-07-29 01:38:42,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:42,699 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000931703] [2020-07-29 01:38:42,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:42,896 INFO L280 TraceCheckUtils]: 0: Hoare triple {939#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {939#true} is VALID [2020-07-29 01:38:42,896 INFO L280 TraceCheckUtils]: 1: Hoare triple {939#true} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {939#true} is VALID [2020-07-29 01:38:42,896 INFO L280 TraceCheckUtils]: 2: Hoare triple {939#true} assume !(main_~length~0 < 1); {939#true} is VALID [2020-07-29 01:38:42,898 INFO L280 TraceCheckUtils]: 3: Hoare triple {939#true} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {941#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:42,899 INFO L280 TraceCheckUtils]: 4: Hoare triple {941#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {942#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:42,899 INFO L280 TraceCheckUtils]: 5: Hoare triple {942#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {942#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:42,900 INFO L280 TraceCheckUtils]: 6: Hoare triple {942#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !(main_#t~mem209 < 0);havoc main_#t~mem209; {942#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:42,901 INFO L280 TraceCheckUtils]: 7: Hoare triple {942#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {943#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~arr~0.offset) (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 01:38:42,902 INFO L280 TraceCheckUtils]: 8: Hoare triple {943#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~arr~0.offset) (<= ULTIMATE.start_main_~i~0 1))} assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {943#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~arr~0.offset) (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 01:38:42,903 INFO L280 TraceCheckUtils]: 9: Hoare triple {943#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~arr~0.offset) (<= ULTIMATE.start_main_~i~0 1))} assume !(main_#t~mem209 < 0);havoc main_#t~mem209; {943#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~arr~0.offset) (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 01:38:42,903 INFO L280 TraceCheckUtils]: 10: Hoare triple {943#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~arr~0.offset) (<= ULTIMATE.start_main_~i~0 1))} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {944#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~arr~0.offset) (<= ULTIMATE.start_main_~i~0 2))} is VALID [2020-07-29 01:38:42,904 INFO L280 TraceCheckUtils]: 11: Hoare triple {944#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~arr~0.offset) (<= ULTIMATE.start_main_~i~0 2))} assume !(main_~i~0 < main_~length~0); {945#(and (<= (select |#length| ULTIMATE.start_main_~arr~0.base) 8) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:42,905 INFO L280 TraceCheckUtils]: 12: Hoare triple {945#(and (<= (select |#length| ULTIMATE.start_main_~arr~0.base) 8) (= 0 ULTIMATE.start_main_~arr~0.offset))} main_~j~0 := 0; {946#(and (= 0 ULTIMATE.start_main_~j~0) (<= (select |#length| ULTIMATE.start_main_~arr~0.base) 8) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:42,907 INFO L280 TraceCheckUtils]: 13: Hoare triple {946#(and (= 0 ULTIMATE.start_main_~j~0) (<= (select |#length| ULTIMATE.start_main_~arr~0.base) 8) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {946#(and (= 0 ULTIMATE.start_main_~j~0) (<= (select |#length| ULTIMATE.start_main_~arr~0.base) 8) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:42,910 INFO L280 TraceCheckUtils]: 14: Hoare triple {946#(and (= 0 ULTIMATE.start_main_~j~0) (<= (select |#length| ULTIMATE.start_main_~arr~0.base) 8) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; {947#(and (<= (select |#length| ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) 4)) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:42,911 INFO L280 TraceCheckUtils]: 15: Hoare triple {947#(and (<= (select |#length| ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) 4)) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {947#(and (<= (select |#length| ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) 4)) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:42,912 INFO L280 TraceCheckUtils]: 16: Hoare triple {947#(and (<= (select |#length| ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) 4)) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; {948#(and (= 0 ULTIMATE.start_main_~arr~0.offset) (<= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~j~0)))} is VALID [2020-07-29 01:38:42,913 INFO L280 TraceCheckUtils]: 17: Hoare triple {948#(and (= 0 ULTIMATE.start_main_~arr~0.offset) (<= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~j~0)))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {940#false} is VALID [2020-07-29 01:38:42,914 INFO L280 TraceCheckUtils]: 18: Hoare triple {940#false} assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; {940#false} is VALID [2020-07-29 01:38:42,915 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:38:42,915 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000931703] [2020-07-29 01:38:42,916 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115229166] [2020-07-29 01:38:42,916 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:38:42,955 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-29 01:38:42,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:38:42,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:38:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:42,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:43,293 INFO L280 TraceCheckUtils]: 0: Hoare triple {939#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {939#true} is VALID [2020-07-29 01:38:43,293 INFO L280 TraceCheckUtils]: 1: Hoare triple {939#true} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {939#true} is VALID [2020-07-29 01:38:43,293 INFO L280 TraceCheckUtils]: 2: Hoare triple {939#true} assume !(main_~length~0 < 1); {939#true} is VALID [2020-07-29 01:38:43,294 INFO L280 TraceCheckUtils]: 3: Hoare triple {939#true} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {939#true} is VALID [2020-07-29 01:38:43,295 INFO L280 TraceCheckUtils]: 4: Hoare triple {939#true} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {964#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:38:43,295 INFO L280 TraceCheckUtils]: 5: Hoare triple {964#(<= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {964#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:38:43,296 INFO L280 TraceCheckUtils]: 6: Hoare triple {964#(<= ULTIMATE.start_main_~i~0 0)} assume !(main_#t~mem209 < 0);havoc main_#t~mem209; {964#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:38:43,297 INFO L280 TraceCheckUtils]: 7: Hoare triple {964#(<= ULTIMATE.start_main_~i~0 0)} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {974#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:38:43,298 INFO L280 TraceCheckUtils]: 8: Hoare triple {974#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {974#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:38:43,299 INFO L280 TraceCheckUtils]: 9: Hoare triple {974#(<= ULTIMATE.start_main_~i~0 1)} assume !(main_#t~mem209 < 0);havoc main_#t~mem209; {974#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:38:43,300 INFO L280 TraceCheckUtils]: 10: Hoare triple {974#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {984#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:38:43,301 INFO L280 TraceCheckUtils]: 11: Hoare triple {984#(<= ULTIMATE.start_main_~i~0 2)} assume !(main_~i~0 < main_~length~0); {988#(<= ULTIMATE.start_main_~length~0 2)} is VALID [2020-07-29 01:38:43,302 INFO L280 TraceCheckUtils]: 12: Hoare triple {988#(<= ULTIMATE.start_main_~length~0 2)} main_~j~0 := 0; {992#(and (<= ULTIMATE.start_main_~length~0 2) (<= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:38:43,303 INFO L280 TraceCheckUtils]: 13: Hoare triple {992#(and (<= ULTIMATE.start_main_~length~0 2) (<= 0 ULTIMATE.start_main_~j~0))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {992#(and (<= ULTIMATE.start_main_~length~0 2) (<= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:38:43,304 INFO L280 TraceCheckUtils]: 14: Hoare triple {992#(and (<= ULTIMATE.start_main_~length~0 2) (<= 0 ULTIMATE.start_main_~j~0))} assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; {999#(and (<= ULTIMATE.start_main_~length~0 2) (<= 1 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:38:43,305 INFO L280 TraceCheckUtils]: 15: Hoare triple {999#(and (<= ULTIMATE.start_main_~length~0 2) (<= 1 ULTIMATE.start_main_~j~0))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {999#(and (<= ULTIMATE.start_main_~length~0 2) (<= 1 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:38:43,311 INFO L280 TraceCheckUtils]: 16: Hoare triple {999#(and (<= ULTIMATE.start_main_~length~0 2) (<= 1 ULTIMATE.start_main_~j~0))} assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; {1006#(and (<= ULTIMATE.start_main_~length~0 2) (<= 2 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:38:43,316 INFO L280 TraceCheckUtils]: 17: Hoare triple {1006#(and (<= ULTIMATE.start_main_~length~0 2) (<= 2 ULTIMATE.start_main_~j~0))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {940#false} is VALID [2020-07-29 01:38:43,317 INFO L280 TraceCheckUtils]: 18: Hoare triple {940#false} assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; {940#false} is VALID [2020-07-29 01:38:43,317 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:38:43,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:38:43,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2020-07-29 01:38:43,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145510639] [2020-07-29 01:38:43,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:38:43,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-29 01:38:43,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2020-07-29 01:38:43,381 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. cyclomatic complexity: 12 Second operand 17 states. [2020-07-29 01:38:43,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:43,988 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2020-07-29 01:38:43,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-29 01:38:43,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-29 01:38:44,058 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:38:44,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 65 transitions. [2020-07-29 01:38:44,061 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 01:38:44,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 46 states and 62 transitions. [2020-07-29 01:38:44,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-07-29 01:38:44,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-07-29 01:38:44,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 62 transitions. [2020-07-29 01:38:44,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:38:44,063 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 62 transitions. [2020-07-29 01:38:44,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 62 transitions. [2020-07-29 01:38:44,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2020-07-29 01:38:44,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:38:44,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states and 62 transitions. Second operand 39 states. [2020-07-29 01:38:44,067 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states and 62 transitions. Second operand 39 states. [2020-07-29 01:38:44,067 INFO L87 Difference]: Start difference. First operand 46 states and 62 transitions. Second operand 39 states. [2020-07-29 01:38:44,067 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:38:44,070 INFO L93 Difference]: Finished difference Result 46 states and 62 transitions. [2020-07-29 01:38:44,070 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2020-07-29 01:38:44,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:44,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:44,071 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 46 states and 62 transitions. [2020-07-29 01:38:44,071 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 46 states and 62 transitions. [2020-07-29 01:38:44,072 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:38:44,074 INFO L93 Difference]: Finished difference Result 46 states and 62 transitions. [2020-07-29 01:38:44,074 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2020-07-29 01:38:44,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:44,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:44,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:38:44,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:38:44,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-29 01:38:44,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2020-07-29 01:38:44,076 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2020-07-29 01:38:44,077 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2020-07-29 01:38:44,077 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:38:44,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 53 transitions. [2020-07-29 01:38:44,077 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:38:44,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:44,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:44,078 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:38:44,078 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-07-29 01:38:44,078 INFO L794 eck$LassoCheckResult]: Stem: 1074#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1070#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 1071#L367 assume !(main_~length~0 < 1); 1080#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 1081#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 1082#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 1087#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 1090#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 1088#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 1089#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 1106#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 1105#L370-3 assume !(main_~i~0 < main_~length~0); 1104#L370-4 main_~j~0 := 0; 1093#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 1092#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 1091#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 1085#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 1086#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 1101#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 1099#L378-2 [2020-07-29 01:38:44,079 INFO L796 eck$LassoCheckResult]: Loop: 1099#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 1096#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 1075#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 1076#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 1099#L378-2 [2020-07-29 01:38:44,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:44,079 INFO L82 PathProgramCache]: Analyzing trace with hash -2108839069, now seen corresponding path program 4 times [2020-07-29 01:38:44,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:44,079 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939844734] [2020-07-29 01:38:44,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:44,095 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:44,109 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:44,113 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:44,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:44,114 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2020-07-29 01:38:44,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:44,114 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684991893] [2020-07-29 01:38:44,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:44,119 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:44,122 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:44,124 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:44,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:44,125 INFO L82 PathProgramCache]: Analyzing trace with hash 50792363, now seen corresponding path program 5 times [2020-07-29 01:38:44,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:44,125 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123452944] [2020-07-29 01:38:44,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:44,140 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:44,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:44,154 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:44,159 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:44,656 WARN L193 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 104 [2020-07-29 01:38:44,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:38:44 BoogieIcfgContainer [2020-07-29 01:38:44,840 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:38:44,841 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:38:44,841 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:38:44,841 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:38:44,842 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:38:34" (3/4) ... [2020-07-29 01:38:44,846 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-07-29 01:38:44,899 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:38:44,899 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:38:44,901 INFO L168 Benchmark]: Toolchain (without parser) took 11437.04 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.2 MB). Free memory was 961.6 MB in the beginning and 1.0 GB in the end (delta: -70.8 MB). Peak memory consumption was 247.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:38:44,902 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:38:44,903 INFO L168 Benchmark]: CACSL2BoogieTranslator took 678.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -153.7 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:38:44,903 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.76 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:38:44,903 INFO L168 Benchmark]: Boogie Preprocessor took 35.17 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:38:44,904 INFO L168 Benchmark]: RCFGBuilder took 404.53 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: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:38:44,905 INFO L168 Benchmark]: BuchiAutomizer took 10200.83 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.4 MB). Peak memory consumption was 227.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:38:44,905 INFO L168 Benchmark]: Witness Printer took 58.38 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:38:44,908 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 678.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -153.7 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.76 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 35.17 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 404.53 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: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10200.83 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.4 MB). Peak memory consumption was 227.9 MB. Max. memory is 11.5 GB. * Witness Printer took 58.38 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] + 8 * j and consists of 4 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 17 locations. The remainder module has 39 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.1s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 7.6s. Construction of modules took 0.4s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 39 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 60 SDtfs, 176 SDslu, 91 SDs, 0 SdLazy, 238 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital132 mio100 ax100 hnf97 lsp92 ukn80 mio100 lsp62 div100 bol100 ite100 ukn100 eq157 hnf91 smp94 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 377]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {NULL=0, \result=0, NULL=1, arr=2, arr=0, i=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@58b1ad00=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@521ee68c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2511868a=0, length=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@12c7d497=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2511868a=2, j=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@4c48bd6f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@6c219f13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@30d8fd1a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@7e7af5e8=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 377]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L365] int i, j; [L366] int length = __VERIFIER_nondet_int(); [L367] COND FALSE !(length < 1) [L368] int *arr = __builtin_alloca(length*sizeof(int)); [L369] COND FALSE !(!arr) [L370] i=0 [L370] COND TRUE i 0) [L381] j++ [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND TRUE arr[j] > 0 [L379] j-- [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND FALSE !(arr[j] > 0) [L381] j++ Loop: [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND TRUE arr[j] > 0 [L379] j-- [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND FALSE !(arr[j] > 0) [L381] j++ End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...