./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/nec11.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loops/nec11.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 956956519a5dd5945389347ef99ef2322ddc4acd ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 02:05:17,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 02:05:17,662 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 02:05:17,674 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 02:05:17,674 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 02:05:17,675 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 02:05:17,677 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 02:05:17,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 02:05:17,680 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 02:05:17,681 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 02:05:17,682 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 02:05:17,683 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 02:05:17,683 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 02:05:17,684 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 02:05:17,685 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 02:05:17,687 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 02:05:17,688 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 02:05:17,689 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 02:05:17,691 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 02:05:17,693 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 02:05:17,694 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 02:05:17,695 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 02:05:17,697 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 02:05:17,697 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 02:05:17,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 02:05:17,700 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 02:05:17,701 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 02:05:17,701 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 02:05:17,702 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 02:05:17,703 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 02:05:17,703 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 02:05:17,704 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 02:05:17,705 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 02:05:17,705 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 02:05:17,711 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 02:05:17,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 02:05:17,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 02:05:17,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 02:05:17,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 02:05:17,714 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 02:05:17,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 02:05:17,716 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 02:05:17,733 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 02:05:17,733 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 02:05:17,734 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 02:05:17,734 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 02:05:17,735 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 02:05:17,735 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 02:05:17,735 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 02:05:17,735 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 02:05:17,736 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 02:05:17,736 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 02:05:17,736 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 02:05:17,736 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 02:05:17,736 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 02:05:17,737 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 02:05:17,737 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 02:05:17,737 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 02:05:17,737 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 02:05:17,737 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 02:05:17,738 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 02:05:17,738 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 02:05:17,738 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 02:05:17,738 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 02:05:17,739 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 02:05:17,739 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 02:05:17,739 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 02:05:17,739 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 02:05:17,739 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 02:05:17,740 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 02:05:17,740 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 02:05:17,740 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 02:05:17,740 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 02:05:17,740 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 02:05:17,741 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 02:05:17,742 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 956956519a5dd5945389347ef99ef2322ddc4acd [2020-07-29 02:05:18,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 02:05:18,049 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 02:05:18,052 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 02:05:18,054 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 02:05:18,054 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 02:05:18,055 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/nec11.c [2020-07-29 02:05:18,132 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b72239d4f/1bd54269385b4b0584c3e47b72b346ae/FLAGd4a4dbad3 [2020-07-29 02:05:18,604 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 02:05:18,604 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/nec11.c [2020-07-29 02:05:18,611 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b72239d4f/1bd54269385b4b0584c3e47b72b346ae/FLAGd4a4dbad3 [2020-07-29 02:05:18,969 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b72239d4f/1bd54269385b4b0584c3e47b72b346ae [2020-07-29 02:05:18,973 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 02:05:18,977 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 02:05:18,978 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 02:05:18,978 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 02:05:18,981 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 02:05:18,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 02:05:18" (1/1) ... [2020-07-29 02:05:18,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25f8ad6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:18, skipping insertion in model container [2020-07-29 02:05:18,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 02:05:18" (1/1) ... [2020-07-29 02:05:18,994 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 02:05:19,011 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 02:05:19,207 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 02:05:19,214 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 02:05:19,230 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 02:05:19,245 INFO L208 MainTranslator]: Completed translation [2020-07-29 02:05:19,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:19 WrapperNode [2020-07-29 02:05:19,246 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 02:05:19,247 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 02:05:19,247 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 02:05:19,247 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 02:05:19,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:19" (1/1) ... [2020-07-29 02:05:19,262 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:19" (1/1) ... [2020-07-29 02:05:19,342 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 02:05:19,343 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 02:05:19,343 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 02:05:19,343 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 02:05:19,352 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:19" (1/1) ... [2020-07-29 02:05:19,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:19" (1/1) ... [2020-07-29 02:05:19,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:19" (1/1) ... [2020-07-29 02:05:19,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:19" (1/1) ... [2020-07-29 02:05:19,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:19" (1/1) ... [2020-07-29 02:05:19,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:19" (1/1) ... [2020-07-29 02:05:19,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:19" (1/1) ... [2020-07-29 02:05:19,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 02:05:19,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 02:05:19,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 02:05:19,364 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 02:05:19,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:19" (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 02:05:19,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 02:05:19,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 02:05:19,626 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 02:05:19,626 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-29 02:05:19,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 02:05:19 BoogieIcfgContainer [2020-07-29 02:05:19,631 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 02:05:19,631 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 02:05:19,632 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 02:05:19,636 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 02:05:19,638 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 02:05:19,638 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 02:05:18" (1/3) ... [2020-07-29 02:05:19,640 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76853d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 02:05:19, skipping insertion in model container [2020-07-29 02:05:19,640 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 02:05:19,640 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:19" (2/3) ... [2020-07-29 02:05:19,641 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76853d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 02:05:19, skipping insertion in model container [2020-07-29 02:05:19,641 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 02:05:19,641 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 02:05:19" (3/3) ... [2020-07-29 02:05:19,643 INFO L371 chiAutomizerObserver]: Analyzing ICFG nec11.c [2020-07-29 02:05:19,715 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 02:05:19,716 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 02:05:19,716 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 02:05:19,716 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 02:05:19,716 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 02:05:19,716 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 02:05:19,717 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 02:05:19,717 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 02:05:19,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 02:05:19,758 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 02:05:19,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:05:19,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:05:19,765 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 02:05:19,765 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 02:05:19,766 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 02:05:19,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 02:05:19,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 02:05:19,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:05:19,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:05:19,771 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 02:05:19,771 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 02:05:19,779 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; 7#L19-2true [2020-07-29 02:05:19,779 INFO L796 eck$LassoCheckResult]: Loop: 7#L19-2true assume !!(0 != main_~c~0 % 256); 3#L21true assume 4 == main_~len~0;main_~len~0 := 0; 11#L21-2true assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 7#L19-2true [2020-07-29 02:05:19,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:19,784 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2020-07-29 02:05:19,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:19,792 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254435779] [2020-07-29 02:05:19,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:19,853 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:19,857 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:19,873 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:05:19,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:19,874 INFO L82 PathProgramCache]: Analyzing trace with hash 39821, now seen corresponding path program 1 times [2020-07-29 02:05:19,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:19,875 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299993606] [2020-07-29 02:05:19,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:19,895 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:19,903 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:19,906 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:05:19,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:19,908 INFO L82 PathProgramCache]: Analyzing trace with hash 963342, now seen corresponding path program 1 times [2020-07-29 02:05:19,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:19,909 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835888412] [2020-07-29 02:05:19,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:19,993 INFO L280 TraceCheckUtils]: 0: Hoare triple {19#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; {21#(<= ULTIMATE.start_main_~len~0 0)} is VALID [2020-07-29 02:05:19,995 INFO L280 TraceCheckUtils]: 1: Hoare triple {21#(<= ULTIMATE.start_main_~len~0 0)} assume !!(0 != main_~c~0 % 256); {21#(<= ULTIMATE.start_main_~len~0 0)} is VALID [2020-07-29 02:05:19,997 INFO L280 TraceCheckUtils]: 2: Hoare triple {21#(<= ULTIMATE.start_main_~len~0 0)} assume 4 == main_~len~0;main_~len~0 := 0; {20#false} is VALID [2020-07-29 02:05:19,997 INFO L280 TraceCheckUtils]: 3: Hoare triple {20#false} assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; {20#false} is VALID [2020-07-29 02:05:19,999 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 02:05:20,000 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835888412] [2020-07-29 02:05:20,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 02:05:20,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 02:05:20,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117463234] [2020-07-29 02:05:20,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 02:05:20,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 02:05:20,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 02:05:20,140 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2020-07-29 02:05:20,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:05:20,216 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-29 02:05:20,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 02:05:20,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 02:05:20,230 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:05:20,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2020-07-29 02:05:20,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 02:05:20,243 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 7 states and 8 transitions. [2020-07-29 02:05:20,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 02:05:20,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 02:05:20,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2020-07-29 02:05:20,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 02:05:20,246 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-07-29 02:05:20,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2020-07-29 02:05:20,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2020-07-29 02:05:20,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:05:20,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states and 8 transitions. Second operand 6 states. [2020-07-29 02:05:20,271 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states and 8 transitions. Second operand 6 states. [2020-07-29 02:05:20,272 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 6 states. [2020-07-29 02:05:20,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:05:20,274 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2020-07-29 02:05:20,275 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2020-07-29 02:05:20,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:05:20,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:05:20,276 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 7 states and 8 transitions. [2020-07-29 02:05:20,276 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 7 states and 8 transitions. [2020-07-29 02:05:20,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:05:20,278 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2020-07-29 02:05:20,278 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2020-07-29 02:05:20,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:05:20,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:05:20,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:05:20,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:05:20,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 02:05:20,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2020-07-29 02:05:20,282 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2020-07-29 02:05:20,282 INFO L591 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2020-07-29 02:05:20,282 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 02:05:20,282 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2020-07-29 02:05:20,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 02:05:20,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:05:20,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:05:20,283 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 02:05:20,283 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 02:05:20,284 INFO L794 eck$LassoCheckResult]: Stem: 45#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; 46#L19-2 assume !!(0 != main_~c~0 % 256); 43#L21 assume !(4 == main_~len~0); 44#L21-2 [2020-07-29 02:05:20,284 INFO L796 eck$LassoCheckResult]: Loop: 44#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 47#L19-2 assume !!(0 != main_~c~0 % 256); 48#L21 assume 4 == main_~len~0;main_~len~0 := 0; 44#L21-2 [2020-07-29 02:05:20,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:20,284 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2020-07-29 02:05:20,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:20,285 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470878720] [2020-07-29 02:05:20,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:20,291 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:20,295 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:20,296 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:05:20,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:20,297 INFO L82 PathProgramCache]: Analyzing trace with hash 46451, now seen corresponding path program 2 times [2020-07-29 02:05:20,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:20,298 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128259424] [2020-07-29 02:05:20,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:20,305 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:20,311 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:20,313 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:05:20,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:20,314 INFO L82 PathProgramCache]: Analyzing trace with hash 925831567, now seen corresponding path program 1 times [2020-07-29 02:05:20,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:20,314 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354177946] [2020-07-29 02:05:20,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:20,369 INFO L280 TraceCheckUtils]: 0: Hoare triple {70#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; {72#(<= ULTIMATE.start_main_~len~0 0)} is VALID [2020-07-29 02:05:20,371 INFO L280 TraceCheckUtils]: 1: Hoare triple {72#(<= ULTIMATE.start_main_~len~0 0)} assume !!(0 != main_~c~0 % 256); {72#(<= ULTIMATE.start_main_~len~0 0)} is VALID [2020-07-29 02:05:20,372 INFO L280 TraceCheckUtils]: 2: Hoare triple {72#(<= ULTIMATE.start_main_~len~0 0)} assume !(4 == main_~len~0); {72#(<= ULTIMATE.start_main_~len~0 0)} is VALID [2020-07-29 02:05:20,374 INFO L280 TraceCheckUtils]: 3: Hoare triple {72#(<= ULTIMATE.start_main_~len~0 0)} assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; {73#(<= ULTIMATE.start_main_~len~0 1)} is VALID [2020-07-29 02:05:20,375 INFO L280 TraceCheckUtils]: 4: Hoare triple {73#(<= ULTIMATE.start_main_~len~0 1)} assume !!(0 != main_~c~0 % 256); {73#(<= ULTIMATE.start_main_~len~0 1)} is VALID [2020-07-29 02:05:20,376 INFO L280 TraceCheckUtils]: 5: Hoare triple {73#(<= ULTIMATE.start_main_~len~0 1)} assume 4 == main_~len~0;main_~len~0 := 0; {71#false} is VALID [2020-07-29 02:05:20,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:05:20,377 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354177946] [2020-07-29 02:05:20,377 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022888925] [2020-07-29 02:05:20,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 02:05:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:20,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 02:05:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:20,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:05:20,481 INFO L280 TraceCheckUtils]: 0: Hoare triple {70#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; {72#(<= ULTIMATE.start_main_~len~0 0)} is VALID [2020-07-29 02:05:20,482 INFO L280 TraceCheckUtils]: 1: Hoare triple {72#(<= ULTIMATE.start_main_~len~0 0)} assume !!(0 != main_~c~0 % 256); {72#(<= ULTIMATE.start_main_~len~0 0)} is VALID [2020-07-29 02:05:20,483 INFO L280 TraceCheckUtils]: 2: Hoare triple {72#(<= ULTIMATE.start_main_~len~0 0)} assume !(4 == main_~len~0); {72#(<= ULTIMATE.start_main_~len~0 0)} is VALID [2020-07-29 02:05:20,485 INFO L280 TraceCheckUtils]: 3: Hoare triple {72#(<= ULTIMATE.start_main_~len~0 0)} assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; {73#(<= ULTIMATE.start_main_~len~0 1)} is VALID [2020-07-29 02:05:20,486 INFO L280 TraceCheckUtils]: 4: Hoare triple {73#(<= ULTIMATE.start_main_~len~0 1)} assume !!(0 != main_~c~0 % 256); {73#(<= ULTIMATE.start_main_~len~0 1)} is VALID [2020-07-29 02:05:20,487 INFO L280 TraceCheckUtils]: 5: Hoare triple {73#(<= ULTIMATE.start_main_~len~0 1)} assume 4 == main_~len~0;main_~len~0 := 0; {71#false} is VALID [2020-07-29 02:05:20,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:05:20,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 02:05:20,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2020-07-29 02:05:20,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503739290] [2020-07-29 02:05:20,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 02:05:20,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 02:05:20,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 02:05:20,541 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 4 states. [2020-07-29 02:05:20,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:05:20,574 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2020-07-29 02:05:20,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 02:05:20,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 02:05:20,586 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:05:20,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2020-07-29 02:05:20,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 02:05:20,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2020-07-29 02:05:20,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 02:05:20,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 02:05:20,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2020-07-29 02:05:20,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 02:05:20,591 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-07-29 02:05:20,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2020-07-29 02:05:20,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2020-07-29 02:05:20,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:05:20,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states and 11 transitions. Second operand 9 states. [2020-07-29 02:05:20,593 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states and 11 transitions. Second operand 9 states. [2020-07-29 02:05:20,593 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 9 states. [2020-07-29 02:05:20,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:05:20,595 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2020-07-29 02:05:20,595 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2020-07-29 02:05:20,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:05:20,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:05:20,596 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 10 states and 11 transitions. [2020-07-29 02:05:20,596 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 10 states and 11 transitions. [2020-07-29 02:05:20,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:05:20,598 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2020-07-29 02:05:20,598 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2020-07-29 02:05:20,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:05:20,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:05:20,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:05:20,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:05:20,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 02:05:20,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2020-07-29 02:05:20,601 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-07-29 02:05:20,601 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-07-29 02:05:20,601 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 02:05:20,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2020-07-29 02:05:20,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 02:05:20,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:05:20,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:05:20,603 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 02:05:20,604 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2020-07-29 02:05:20,604 INFO L794 eck$LassoCheckResult]: Stem: 101#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; 102#L19-2 assume !!(0 != main_~c~0 % 256); 107#L21 assume !(4 == main_~len~0); 104#L21-2 [2020-07-29 02:05:20,604 INFO L796 eck$LassoCheckResult]: Loop: 104#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 103#L19-2 assume !!(0 != main_~c~0 % 256); 99#L21 assume !(4 == main_~len~0); 100#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 106#L19-2 assume !!(0 != main_~c~0 % 256); 105#L21 assume 4 == main_~len~0;main_~len~0 := 0; 104#L21-2 [2020-07-29 02:05:20,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:20,605 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 2 times [2020-07-29 02:05:20,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:20,606 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629761999] [2020-07-29 02:05:20,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:20,611 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:20,616 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:20,618 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:05:20,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:20,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1383897983, now seen corresponding path program 1 times [2020-07-29 02:05:20,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:20,620 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309517613] [2020-07-29 02:05:20,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:20,629 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:20,638 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:20,640 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:05:20,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:20,641 INFO L82 PathProgramCache]: Analyzing trace with hash -831686173, now seen corresponding path program 2 times [2020-07-29 02:05:20,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:20,642 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942194365] [2020-07-29 02:05:20,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:20,732 INFO L280 TraceCheckUtils]: 0: Hoare triple {135#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; {137#(<= ULTIMATE.start_main_~len~0 0)} is VALID [2020-07-29 02:05:20,734 INFO L280 TraceCheckUtils]: 1: Hoare triple {137#(<= ULTIMATE.start_main_~len~0 0)} assume !!(0 != main_~c~0 % 256); {137#(<= ULTIMATE.start_main_~len~0 0)} is VALID [2020-07-29 02:05:20,736 INFO L280 TraceCheckUtils]: 2: Hoare triple {137#(<= ULTIMATE.start_main_~len~0 0)} assume !(4 == main_~len~0); {137#(<= ULTIMATE.start_main_~len~0 0)} is VALID [2020-07-29 02:05:20,737 INFO L280 TraceCheckUtils]: 3: Hoare triple {137#(<= ULTIMATE.start_main_~len~0 0)} assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; {138#(<= ULTIMATE.start_main_~len~0 1)} is VALID [2020-07-29 02:05:20,738 INFO L280 TraceCheckUtils]: 4: Hoare triple {138#(<= ULTIMATE.start_main_~len~0 1)} assume !!(0 != main_~c~0 % 256); {138#(<= ULTIMATE.start_main_~len~0 1)} is VALID [2020-07-29 02:05:20,739 INFO L280 TraceCheckUtils]: 5: Hoare triple {138#(<= ULTIMATE.start_main_~len~0 1)} assume !(4 == main_~len~0); {138#(<= ULTIMATE.start_main_~len~0 1)} is VALID [2020-07-29 02:05:20,741 INFO L280 TraceCheckUtils]: 6: Hoare triple {138#(<= ULTIMATE.start_main_~len~0 1)} assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; {139#(<= ULTIMATE.start_main_~len~0 2)} is VALID [2020-07-29 02:05:20,742 INFO L280 TraceCheckUtils]: 7: Hoare triple {139#(<= ULTIMATE.start_main_~len~0 2)} assume !!(0 != main_~c~0 % 256); {139#(<= ULTIMATE.start_main_~len~0 2)} is VALID [2020-07-29 02:05:20,743 INFO L280 TraceCheckUtils]: 8: Hoare triple {139#(<= ULTIMATE.start_main_~len~0 2)} assume 4 == main_~len~0;main_~len~0 := 0; {136#false} is VALID [2020-07-29 02:05:20,746 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:05:20,746 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942194365] [2020-07-29 02:05:20,747 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44463890] [2020-07-29 02:05:20,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 02:05:20,786 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 02:05:20,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 02:05:20,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 02:05:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:20,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:05:20,900 INFO L280 TraceCheckUtils]: 0: Hoare triple {135#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; {137#(<= ULTIMATE.start_main_~len~0 0)} is VALID [2020-07-29 02:05:20,901 INFO L280 TraceCheckUtils]: 1: Hoare triple {137#(<= ULTIMATE.start_main_~len~0 0)} assume !!(0 != main_~c~0 % 256); {137#(<= ULTIMATE.start_main_~len~0 0)} is VALID [2020-07-29 02:05:20,902 INFO L280 TraceCheckUtils]: 2: Hoare triple {137#(<= ULTIMATE.start_main_~len~0 0)} assume !(4 == main_~len~0); {137#(<= ULTIMATE.start_main_~len~0 0)} is VALID [2020-07-29 02:05:20,904 INFO L280 TraceCheckUtils]: 3: Hoare triple {137#(<= ULTIMATE.start_main_~len~0 0)} assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; {138#(<= ULTIMATE.start_main_~len~0 1)} is VALID [2020-07-29 02:05:20,906 INFO L280 TraceCheckUtils]: 4: Hoare triple {138#(<= ULTIMATE.start_main_~len~0 1)} assume !!(0 != main_~c~0 % 256); {138#(<= ULTIMATE.start_main_~len~0 1)} is VALID [2020-07-29 02:05:20,907 INFO L280 TraceCheckUtils]: 5: Hoare triple {138#(<= ULTIMATE.start_main_~len~0 1)} assume !(4 == main_~len~0); {138#(<= ULTIMATE.start_main_~len~0 1)} is VALID [2020-07-29 02:05:20,909 INFO L280 TraceCheckUtils]: 6: Hoare triple {138#(<= ULTIMATE.start_main_~len~0 1)} assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; {139#(<= ULTIMATE.start_main_~len~0 2)} is VALID [2020-07-29 02:05:20,910 INFO L280 TraceCheckUtils]: 7: Hoare triple {139#(<= ULTIMATE.start_main_~len~0 2)} assume !!(0 != main_~c~0 % 256); {139#(<= ULTIMATE.start_main_~len~0 2)} is VALID [2020-07-29 02:05:20,911 INFO L280 TraceCheckUtils]: 8: Hoare triple {139#(<= ULTIMATE.start_main_~len~0 2)} assume 4 == main_~len~0;main_~len~0 := 0; {136#false} is VALID [2020-07-29 02:05:20,912 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:05:20,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 02:05:20,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2020-07-29 02:05:20,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761976156] [2020-07-29 02:05:21,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 02:05:21,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 02:05:21,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-29 02:05:21,001 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 5 states. [2020-07-29 02:05:21,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:05:21,044 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-07-29 02:05:21,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 02:05:21,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 02:05:21,064 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:05:21,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2020-07-29 02:05:21,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-29 02:05:21,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2020-07-29 02:05:21,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 02:05:21,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 02:05:21,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2020-07-29 02:05:21,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 02:05:21,074 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-07-29 02:05:21,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2020-07-29 02:05:21,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2020-07-29 02:05:21,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:05:21,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 14 transitions. Second operand 12 states. [2020-07-29 02:05:21,076 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 14 transitions. Second operand 12 states. [2020-07-29 02:05:21,076 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 12 states. [2020-07-29 02:05:21,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:05:21,078 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-07-29 02:05:21,079 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-29 02:05:21,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:05:21,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:05:21,079 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 13 states and 14 transitions. [2020-07-29 02:05:21,079 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 13 states and 14 transitions. [2020-07-29 02:05:21,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:05:21,081 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-07-29 02:05:21,081 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-29 02:05:21,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:05:21,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:05:21,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:05:21,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:05:21,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 02:05:21,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2020-07-29 02:05:21,083 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2020-07-29 02:05:21,083 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2020-07-29 02:05:21,083 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 02:05:21,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2020-07-29 02:05:21,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-29 02:05:21,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:05:21,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:05:21,085 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 02:05:21,085 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2020-07-29 02:05:21,085 INFO L794 eck$LassoCheckResult]: Stem: 179#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; 180#L19-2 assume !!(0 != main_~c~0 % 256); 188#L21 assume !(4 == main_~len~0); 183#L21-2 [2020-07-29 02:05:21,085 INFO L796 eck$LassoCheckResult]: Loop: 183#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 181#L19-2 assume !!(0 != main_~c~0 % 256); 182#L21 assume !(4 == main_~len~0); 186#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 187#L19-2 assume !!(0 != main_~c~0 % 256); 177#L21 assume !(4 == main_~len~0); 178#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 185#L19-2 assume !!(0 != main_~c~0 % 256); 184#L21 assume 4 == main_~len~0;main_~len~0 := 0; 183#L21-2 [2020-07-29 02:05:21,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:21,086 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2020-07-29 02:05:21,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:21,087 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397258514] [2020-07-29 02:05:21,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:21,091 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:21,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:21,095 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:21,097 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:05:21,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:21,097 INFO L82 PathProgramCache]: Analyzing trace with hash 313813491, now seen corresponding path program 2 times [2020-07-29 02:05:21,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:21,098 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168330660] [2020-07-29 02:05:21,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:21,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:21,108 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:21,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:21,130 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:21,138 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:05:21,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:21,139 INFO L82 PathProgramCache]: Analyzing trace with hash 903627023, now seen corresponding path program 3 times [2020-07-29 02:05:21,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:21,140 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498728075] [2020-07-29 02:05:21,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:21,259 INFO L280 TraceCheckUtils]: 0: Hoare triple {222#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; {224#(<= ULTIMATE.start_main_~len~0 0)} is VALID [2020-07-29 02:05:21,260 INFO L280 TraceCheckUtils]: 1: Hoare triple {224#(<= ULTIMATE.start_main_~len~0 0)} assume !!(0 != main_~c~0 % 256); {224#(<= ULTIMATE.start_main_~len~0 0)} is VALID [2020-07-29 02:05:21,261 INFO L280 TraceCheckUtils]: 2: Hoare triple {224#(<= ULTIMATE.start_main_~len~0 0)} assume !(4 == main_~len~0); {224#(<= ULTIMATE.start_main_~len~0 0)} is VALID [2020-07-29 02:05:21,262 INFO L280 TraceCheckUtils]: 3: Hoare triple {224#(<= ULTIMATE.start_main_~len~0 0)} assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; {225#(<= ULTIMATE.start_main_~len~0 1)} is VALID [2020-07-29 02:05:21,263 INFO L280 TraceCheckUtils]: 4: Hoare triple {225#(<= ULTIMATE.start_main_~len~0 1)} assume !!(0 != main_~c~0 % 256); {225#(<= ULTIMATE.start_main_~len~0 1)} is VALID [2020-07-29 02:05:21,264 INFO L280 TraceCheckUtils]: 5: Hoare triple {225#(<= ULTIMATE.start_main_~len~0 1)} assume !(4 == main_~len~0); {225#(<= ULTIMATE.start_main_~len~0 1)} is VALID [2020-07-29 02:05:21,266 INFO L280 TraceCheckUtils]: 6: Hoare triple {225#(<= ULTIMATE.start_main_~len~0 1)} assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; {226#(<= ULTIMATE.start_main_~len~0 2)} is VALID [2020-07-29 02:05:21,267 INFO L280 TraceCheckUtils]: 7: Hoare triple {226#(<= ULTIMATE.start_main_~len~0 2)} assume !!(0 != main_~c~0 % 256); {226#(<= ULTIMATE.start_main_~len~0 2)} is VALID [2020-07-29 02:05:21,268 INFO L280 TraceCheckUtils]: 8: Hoare triple {226#(<= ULTIMATE.start_main_~len~0 2)} assume !(4 == main_~len~0); {226#(<= ULTIMATE.start_main_~len~0 2)} is VALID [2020-07-29 02:05:21,270 INFO L280 TraceCheckUtils]: 9: Hoare triple {226#(<= ULTIMATE.start_main_~len~0 2)} assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; {227#(<= ULTIMATE.start_main_~len~0 3)} is VALID [2020-07-29 02:05:21,271 INFO L280 TraceCheckUtils]: 10: Hoare triple {227#(<= ULTIMATE.start_main_~len~0 3)} assume !!(0 != main_~c~0 % 256); {227#(<= ULTIMATE.start_main_~len~0 3)} is VALID [2020-07-29 02:05:21,272 INFO L280 TraceCheckUtils]: 11: Hoare triple {227#(<= ULTIMATE.start_main_~len~0 3)} assume 4 == main_~len~0;main_~len~0 := 0; {223#false} is VALID [2020-07-29 02:05:21,274 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:05:21,274 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498728075] [2020-07-29 02:05:21,274 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552956747] [2020-07-29 02:05:21,275 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 02:05:21,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-29 02:05:21,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 02:05:21,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 02:05:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:21,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:05:21,482 INFO L280 TraceCheckUtils]: 0: Hoare triple {222#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; {224#(<= ULTIMATE.start_main_~len~0 0)} is VALID [2020-07-29 02:05:21,483 INFO L280 TraceCheckUtils]: 1: Hoare triple {224#(<= ULTIMATE.start_main_~len~0 0)} assume !!(0 != main_~c~0 % 256); {224#(<= ULTIMATE.start_main_~len~0 0)} is VALID [2020-07-29 02:05:21,484 INFO L280 TraceCheckUtils]: 2: Hoare triple {224#(<= ULTIMATE.start_main_~len~0 0)} assume !(4 == main_~len~0); {224#(<= ULTIMATE.start_main_~len~0 0)} is VALID [2020-07-29 02:05:21,485 INFO L280 TraceCheckUtils]: 3: Hoare triple {224#(<= ULTIMATE.start_main_~len~0 0)} assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; {225#(<= ULTIMATE.start_main_~len~0 1)} is VALID [2020-07-29 02:05:21,486 INFO L280 TraceCheckUtils]: 4: Hoare triple {225#(<= ULTIMATE.start_main_~len~0 1)} assume !!(0 != main_~c~0 % 256); {225#(<= ULTIMATE.start_main_~len~0 1)} is VALID [2020-07-29 02:05:21,487 INFO L280 TraceCheckUtils]: 5: Hoare triple {225#(<= ULTIMATE.start_main_~len~0 1)} assume !(4 == main_~len~0); {225#(<= ULTIMATE.start_main_~len~0 1)} is VALID [2020-07-29 02:05:21,492 INFO L280 TraceCheckUtils]: 6: Hoare triple {225#(<= ULTIMATE.start_main_~len~0 1)} assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; {226#(<= ULTIMATE.start_main_~len~0 2)} is VALID [2020-07-29 02:05:21,493 INFO L280 TraceCheckUtils]: 7: Hoare triple {226#(<= ULTIMATE.start_main_~len~0 2)} assume !!(0 != main_~c~0 % 256); {226#(<= ULTIMATE.start_main_~len~0 2)} is VALID [2020-07-29 02:05:21,493 INFO L280 TraceCheckUtils]: 8: Hoare triple {226#(<= ULTIMATE.start_main_~len~0 2)} assume !(4 == main_~len~0); {226#(<= ULTIMATE.start_main_~len~0 2)} is VALID [2020-07-29 02:05:21,496 INFO L280 TraceCheckUtils]: 9: Hoare triple {226#(<= ULTIMATE.start_main_~len~0 2)} assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; {227#(<= ULTIMATE.start_main_~len~0 3)} is VALID [2020-07-29 02:05:21,497 INFO L280 TraceCheckUtils]: 10: Hoare triple {227#(<= ULTIMATE.start_main_~len~0 3)} assume !!(0 != main_~c~0 % 256); {227#(<= ULTIMATE.start_main_~len~0 3)} is VALID [2020-07-29 02:05:21,498 INFO L280 TraceCheckUtils]: 11: Hoare triple {227#(<= ULTIMATE.start_main_~len~0 3)} assume 4 == main_~len~0;main_~len~0 := 0; {223#false} is VALID [2020-07-29 02:05:21,499 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:05:21,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 02:05:21,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-07-29 02:05:21,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991245001] [2020-07-29 02:05:21,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 02:05:21,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 02:05:21,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-29 02:05:21,628 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 6 states. [2020-07-29 02:05:21,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:05:21,684 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2020-07-29 02:05:21,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 02:05:21,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 02:05:21,705 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 02:05:21,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 17 transitions. [2020-07-29 02:05:21,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-29 02:05:21,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 17 transitions. [2020-07-29 02:05:21,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-07-29 02:05:21,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-07-29 02:05:21,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions. [2020-07-29 02:05:21,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 02:05:21,711 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2020-07-29 02:05:21,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions. [2020-07-29 02:05:21,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-07-29 02:05:21,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:05:21,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 17 transitions. Second operand 15 states. [2020-07-29 02:05:21,714 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 17 transitions. Second operand 15 states. [2020-07-29 02:05:21,714 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 15 states. [2020-07-29 02:05:21,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:05:21,717 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2020-07-29 02:05:21,717 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2020-07-29 02:05:21,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:05:21,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:05:21,718 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states and 17 transitions. [2020-07-29 02:05:21,718 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states and 17 transitions. [2020-07-29 02:05:21,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:05:21,721 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2020-07-29 02:05:21,721 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2020-07-29 02:05:21,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:05:21,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:05:21,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:05:21,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:05:21,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 02:05:21,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-07-29 02:05:21,724 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-07-29 02:05:21,724 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-07-29 02:05:21,724 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 02:05:21,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2020-07-29 02:05:21,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-29 02:05:21,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:05:21,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:05:21,727 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 02:05:21,728 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1] [2020-07-29 02:05:21,728 INFO L794 eck$LassoCheckResult]: Stem: 279#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; 280#L19-2 assume !!(0 != main_~c~0 % 256); 277#L21 assume !(4 == main_~len~0); 278#L21-2 [2020-07-29 02:05:21,728 INFO L796 eck$LassoCheckResult]: Loop: 278#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 281#L19-2 assume !!(0 != main_~c~0 % 256); 291#L21 assume !(4 == main_~len~0); 290#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 289#L19-2 assume !!(0 != main_~c~0 % 256); 288#L21 assume !(4 == main_~len~0); 287#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 286#L19-2 assume !!(0 != main_~c~0 % 256); 285#L21 assume !(4 == main_~len~0); 283#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 284#L19-2 assume !!(0 != main_~c~0 % 256); 282#L21 assume 4 == main_~len~0;main_~len~0 := 0; 278#L21-2 [2020-07-29 02:05:21,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:21,729 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 4 times [2020-07-29 02:05:21,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:21,730 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342528825] [2020-07-29 02:05:21,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:21,739 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:21,755 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:21,757 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:05:21,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:21,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1326016769, now seen corresponding path program 3 times [2020-07-29 02:05:21,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:21,761 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075535576] [2020-07-29 02:05:21,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:21,775 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:21,798 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:21,802 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:05:21,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:21,803 INFO L82 PathProgramCache]: Analyzing trace with hash -902292893, now seen corresponding path program 4 times [2020-07-29 02:05:21,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:21,804 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333077985] [2020-07-29 02:05:21,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:21,817 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:21,826 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:21,829 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:05:21,974 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 38 [2020-07-29 02:05:22,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 02:05:22 BoogieIcfgContainer [2020-07-29 02:05:22,087 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 02:05:22,088 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 02:05:22,088 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 02:05:22,089 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 02:05:22,089 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 02:05:19" (3/4) ... [2020-07-29 02:05:22,093 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-07-29 02:05:22,148 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 02:05:22,149 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 02:05:22,151 INFO L168 Benchmark]: Toolchain (without parser) took 3176.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 954.9 MB in the beginning and 895.5 MB in the end (delta: 59.3 MB). Peak memory consumption was 197.7 MB. Max. memory is 11.5 GB. [2020-07-29 02:05:22,152 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 02:05:22,153 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.87 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 02:05:22,154 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -190.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 02:05:22,154 INFO L168 Benchmark]: Boogie Preprocessor took 20.83 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 02:05:22,155 INFO L168 Benchmark]: RCFGBuilder took 267.00 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: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. [2020-07-29 02:05:22,161 INFO L168 Benchmark]: BuchiAutomizer took 2456.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 902.2 MB in the end (delta: 213.3 MB). Peak memory consumption was 213.3 MB. Max. memory is 11.5 GB. [2020-07-29 02:05:22,162 INFO L168 Benchmark]: Witness Printer took 61.03 ms. Allocated memory is still 1.2 GB. Free memory was 902.2 MB in the beginning and 895.5 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 02:05:22,165 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 268.87 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 95.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -190.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.83 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 267.00 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: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2456.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 902.2 MB in the end (delta: 213.3 MB). Peak memory consumption was 213.3 MB. Max. memory is 11.5 GB. * Witness Printer took 61.03 ms. Allocated memory is still 1.2 GB. Free memory was 902.2 MB in the beginning and 895.5 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (4 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.4 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.3s and 5 iterations. TraceHistogramMax:4. Analysis of lassos took 1.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 15 states and ocurred in iteration 4. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 18 SDtfs, 17 SDslu, 16 SDs, 0 SdLazy, 30 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: 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: 19]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {len=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7e8e3b14=0, \result=0, c=257, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@73a4f5ce=0, i=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 21]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L13] int a[5]; [L14] int len=0; [L15] _Bool c=__VERIFIER_nondet_bool(); [L16] int i; [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) Loop: [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND TRUE len==4 [L22] len =0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...