./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-new/count_by_1_variant.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/loop-new/count_by_1_variant.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d937f1273d3b64b50c20485f8adb84c04b99a7cd ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 18:17:24,265 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:17:24,268 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:17:24,280 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:17:24,281 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:17:24,282 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:17:24,284 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:17:24,286 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:17:24,290 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:17:24,292 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:17:24,295 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:17:24,296 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:17:24,299 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:17:24,301 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:17:24,303 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:17:24,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:17:24,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:17:24,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:17:24,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:17:24,310 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:17:24,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:17:24,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:17:24,315 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:17:24,316 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:17:24,319 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:17:24,319 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:17:24,319 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:17:24,320 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:17:24,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:17:24,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:17:24,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:17:24,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:17:24,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:17:24,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:17:24,327 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:17:24,327 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:17:24,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:17:24,328 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:17:24,328 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:17:24,329 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:17:24,330 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:17:24,331 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 18:17:24,346 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:17:24,346 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:17:24,347 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:17:24,348 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:17:24,348 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:17:24,348 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:17:24,349 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:17:24,349 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 18:17:24,352 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:17:24,353 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:17:24,353 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:17:24,353 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:17:24,354 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:17:24,354 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:17:24,354 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:17:24,354 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:17:24,355 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:17:24,355 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:17:24,355 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:17:24,355 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:17:24,356 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:17:24,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:17:24,359 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:17:24,359 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:17:24,359 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:17:24,360 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 18:17:24,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 18:17:24,360 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:17:24,361 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:17:24,362 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(G ! call(__VERIFIER_error())) ) 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 -> d937f1273d3b64b50c20485f8adb84c04b99a7cd [2020-07-28 18:17:24,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:17:24,683 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:17:24,686 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:17:24,688 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:17:24,689 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:17:24,689 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-new/count_by_1_variant.i [2020-07-28 18:17:24,753 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce99567c9/84103b49992f48b799140394d6d7fc06/FLAGec3939439 [2020-07-28 18:17:25,145 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:17:25,146 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-new/count_by_1_variant.i [2020-07-28 18:17:25,154 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce99567c9/84103b49992f48b799140394d6d7fc06/FLAGec3939439 [2020-07-28 18:17:25,527 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce99567c9/84103b49992f48b799140394d6d7fc06 [2020-07-28 18:17:25,530 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:17:25,533 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:17:25,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:17:25,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:17:25,539 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:17:25,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:17:25" (1/1) ... [2020-07-28 18:17:25,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c421b8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:17:25, skipping insertion in model container [2020-07-28 18:17:25,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:17:25" (1/1) ... [2020-07-28 18:17:25,552 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:17:25,568 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:17:25,795 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:17:25,809 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:17:25,833 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:17:25,845 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:17:25,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:17:25 WrapperNode [2020-07-28 18:17:25,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:17:25,847 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:17:25,847 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:17:25,847 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:17:25,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:17:25" (1/1) ... [2020-07-28 18:17:25,860 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:17:25" (1/1) ... [2020-07-28 18:17:25,929 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:17:25,929 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:17:25,929 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:17:25,929 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:17:25,940 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:17:25" (1/1) ... [2020-07-28 18:17:25,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:17:25" (1/1) ... [2020-07-28 18:17:25,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:17:25" (1/1) ... [2020-07-28 18:17:25,941 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:17:25" (1/1) ... [2020-07-28 18:17:25,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:17:25" (1/1) ... [2020-07-28 18:17:25,947 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:17:25" (1/1) ... [2020-07-28 18:17:25,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:17:25" (1/1) ... [2020-07-28 18:17:25,949 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:17:25,949 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:17:25,949 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:17:25,950 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:17:25,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:17:25" (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:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:17:26,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:17:26,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:17:26,268 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:17:26,269 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-28 18:17:26,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:17:26 BoogieIcfgContainer [2020-07-28 18:17:26,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:17:26,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:17:26,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:17:26,277 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:17:26,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:17:25" (1/3) ... [2020-07-28 18:17:26,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b15fe64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:17:26, skipping insertion in model container [2020-07-28 18:17:26,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:17:25" (2/3) ... [2020-07-28 18:17:26,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b15fe64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:17:26, skipping insertion in model container [2020-07-28 18:17:26,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:17:26" (3/3) ... [2020-07-28 18:17:26,287 INFO L109 eAbstractionObserver]: Analyzing ICFG count_by_1_variant.i [2020-07-28 18:17:26,297 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:17:26,305 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 18:17:26,319 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 18:17:26,339 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:17:26,340 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:17:26,340 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:17:26,340 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:17:26,340 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:17:26,340 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:17:26,340 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:17:26,341 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:17:26,353 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2020-07-28 18:17:26,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-28 18:17:26,359 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:17:26,359 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-28 18:17:26,360 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:17:26,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:17:26,365 INFO L82 PathProgramCache]: Analyzing trace with hash 962347, now seen corresponding path program 1 times [2020-07-28 18:17:26,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:17:26,375 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491015882] [2020-07-28 18:17:26,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:17:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:17:26,572 INFO L280 TraceCheckUtils]: 0: Hoare triple {13#true} havoc main_#res;havoc main_#t~post0, main_~i~0;havoc main_~i~0;main_~i~0 := 0; {15#(<= ULTIMATE.start_main_~i~0 1000000)} is VALID [2020-07-28 18:17:26,574 INFO L280 TraceCheckUtils]: 1: Hoare triple {15#(<= ULTIMATE.start_main_~i~0 1000000)} assume !!(1000000 != main_~i~0);__VERIFIER_assert_#in~cond := (if main_~i~0 <= 1000000 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {16#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:17:26,576 INFO L280 TraceCheckUtils]: 2: Hoare triple {16#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {14#false} is VALID [2020-07-28 18:17:26,576 INFO L280 TraceCheckUtils]: 3: Hoare triple {14#false} assume !false; {14#false} is VALID [2020-07-28 18:17:26,579 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-28 18:17:26,580 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491015882] [2020-07-28 18:17:26,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:17:26,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 18:17:26,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985584986] [2020-07-28 18:17:26,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-07-28 18:17:26,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:17:26,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 18:17:26,603 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-28 18:17:26,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 18:17:26,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:17:26,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 18:17:26,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:17:26,613 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 4 states. [2020-07-28 18:17:26,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:26,764 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-07-28 18:17:26,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 18:17:26,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-07-28 18:17:26,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:17:26,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:17:26,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2020-07-28 18:17:26,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:17:26,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2020-07-28 18:17:26,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2020-07-28 18:17:26,827 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:17:26,837 INFO L225 Difference]: With dead ends: 26 [2020-07-28 18:17:26,837 INFO L226 Difference]: Without dead ends: 9 [2020-07-28 18:17:26,840 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:17:26,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-07-28 18:17:26,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2020-07-28 18:17:26,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:17:26,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 8 states. [2020-07-28 18:17:26,881 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 8 states. [2020-07-28 18:17:26,881 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 8 states. [2020-07-28 18:17:26,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:26,883 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2020-07-28 18:17:26,884 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2020-07-28 18:17:26,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:26,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:17:26,885 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 9 states. [2020-07-28 18:17:26,885 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 9 states. [2020-07-28 18:17:26,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:26,886 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2020-07-28 18:17:26,887 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2020-07-28 18:17:26,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:26,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:17:26,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:17:26,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:17:26,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 18:17:26,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2020-07-28 18:17:26,891 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2020-07-28 18:17:26,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:17:26,891 INFO L479 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2020-07-28 18:17:26,892 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:17:26,892 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2020-07-28 18:17:26,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-28 18:17:26,893 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:17:26,893 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2020-07-28 18:17:26,893 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 18:17:26,894 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:17:26,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:17:26,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1390656418, now seen corresponding path program 1 times [2020-07-28 18:17:26,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:17:26,895 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168851807] [2020-07-28 18:17:26,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:17:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:17:26,964 INFO L280 TraceCheckUtils]: 0: Hoare triple {85#true} havoc main_#res;havoc main_#t~post0, main_~i~0;havoc main_~i~0;main_~i~0 := 0; {87#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-28 18:17:26,965 INFO L280 TraceCheckUtils]: 1: Hoare triple {87#(<= ULTIMATE.start_main_~i~0 0)} assume !!(1000000 != main_~i~0);__VERIFIER_assert_#in~cond := (if main_~i~0 <= 1000000 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {87#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-28 18:17:26,966 INFO L280 TraceCheckUtils]: 2: Hoare triple {87#(<= ULTIMATE.start_main_~i~0 0)} assume !(0 == __VERIFIER_assert_~cond); {87#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-28 18:17:26,967 INFO L280 TraceCheckUtils]: 3: Hoare triple {87#(<= ULTIMATE.start_main_~i~0 0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {88#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:17:26,969 INFO L280 TraceCheckUtils]: 4: Hoare triple {88#(<= ULTIMATE.start_main_~i~0 1)} assume !!(1000000 != main_~i~0);__VERIFIER_assert_#in~cond := (if main_~i~0 <= 1000000 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {89#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:17:26,970 INFO L280 TraceCheckUtils]: 5: Hoare triple {89#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {86#false} is VALID [2020-07-28 18:17:26,970 INFO L280 TraceCheckUtils]: 6: Hoare triple {86#false} assume !false; {86#false} is VALID [2020-07-28 18:17:26,971 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-28 18:17:26,971 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168851807] [2020-07-28 18:17:26,972 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847315157] [2020-07-28 18:17:26,972 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) [2020-07-28 18:17:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:17:26,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-28 18:17:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:17:27,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:17:27,147 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 18:17:27,184 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 18:17:27,248 INFO L280 TraceCheckUtils]: 0: Hoare triple {85#true} havoc main_#res;havoc main_#t~post0, main_~i~0;havoc main_~i~0;main_~i~0 := 0; {87#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-28 18:17:27,249 INFO L280 TraceCheckUtils]: 1: Hoare triple {87#(<= ULTIMATE.start_main_~i~0 0)} assume !!(1000000 != main_~i~0);__VERIFIER_assert_#in~cond := (if main_~i~0 <= 1000000 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {87#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-28 18:17:27,250 INFO L280 TraceCheckUtils]: 2: Hoare triple {87#(<= ULTIMATE.start_main_~i~0 0)} assume !(0 == __VERIFIER_assert_~cond); {87#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-28 18:17:27,251 INFO L280 TraceCheckUtils]: 3: Hoare triple {87#(<= ULTIMATE.start_main_~i~0 0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {88#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:17:27,253 INFO L280 TraceCheckUtils]: 4: Hoare triple {88#(<= ULTIMATE.start_main_~i~0 1)} assume !!(1000000 != main_~i~0);__VERIFIER_assert_#in~cond := (if main_~i~0 <= 1000000 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {105#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2020-07-28 18:17:27,254 INFO L280 TraceCheckUtils]: 5: Hoare triple {105#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {86#false} is VALID [2020-07-28 18:17:27,254 INFO L280 TraceCheckUtils]: 6: Hoare triple {86#false} assume !false; {86#false} is VALID [2020-07-28 18:17:27,255 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-28 18:17:27,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:17:27,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-07-28 18:17:27,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721446883] [2020-07-28 18:17:27,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-07-28 18:17:27,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:17:27,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 18:17:27,270 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-28 18:17:27,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 18:17:27,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:17:27,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 18:17:27,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-28 18:17:27,272 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 6 states. [2020-07-28 18:17:27,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:27,376 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2020-07-28 18:17:27,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-28 18:17:27,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-07-28 18:17:27,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:17:27,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:17:27,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2020-07-28 18:17:27,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:17:27,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2020-07-28 18:17:27,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 15 transitions. [2020-07-28 18:17:27,404 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:17:27,405 INFO L225 Difference]: With dead ends: 15 [2020-07-28 18:17:27,406 INFO L226 Difference]: Without dead ends: 13 [2020-07-28 18:17:27,407 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-28 18:17:27,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-28 18:17:27,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2020-07-28 18:17:27,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:17:27,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 11 states. [2020-07-28 18:17:27,423 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 11 states. [2020-07-28 18:17:27,423 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 11 states. [2020-07-28 18:17:27,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:27,425 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2020-07-28 18:17:27,425 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2020-07-28 18:17:27,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:27,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:17:27,426 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 13 states. [2020-07-28 18:17:27,426 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 13 states. [2020-07-28 18:17:27,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:27,428 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2020-07-28 18:17:27,428 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2020-07-28 18:17:27,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:27,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:17:27,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:17:27,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:17:27,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-28 18:17:27,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2020-07-28 18:17:27,431 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2020-07-28 18:17:27,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:17:27,431 INFO L479 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2020-07-28 18:17:27,431 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 18:17:27,431 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2020-07-28 18:17:27,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-28 18:17:27,432 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:17:27,432 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2020-07-28 18:17:27,643 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-28 18:17:27,644 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:17:27,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:17:27,644 INFO L82 PathProgramCache]: Analyzing trace with hash 214023755, now seen corresponding path program 2 times [2020-07-28 18:17:27,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:17:27,645 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344203617] [2020-07-28 18:17:27,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:17:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:17:27,723 INFO L280 TraceCheckUtils]: 0: Hoare triple {179#true} havoc main_#res;havoc main_#t~post0, main_~i~0;havoc main_~i~0;main_~i~0 := 0; {181#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-28 18:17:27,725 INFO L280 TraceCheckUtils]: 1: Hoare triple {181#(<= ULTIMATE.start_main_~i~0 0)} assume !!(1000000 != main_~i~0);__VERIFIER_assert_#in~cond := (if main_~i~0 <= 1000000 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {181#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-28 18:17:27,726 INFO L280 TraceCheckUtils]: 2: Hoare triple {181#(<= ULTIMATE.start_main_~i~0 0)} assume !(0 == __VERIFIER_assert_~cond); {181#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-28 18:17:27,728 INFO L280 TraceCheckUtils]: 3: Hoare triple {181#(<= ULTIMATE.start_main_~i~0 0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {182#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:17:27,729 INFO L280 TraceCheckUtils]: 4: Hoare triple {182#(<= ULTIMATE.start_main_~i~0 1)} assume !!(1000000 != main_~i~0);__VERIFIER_assert_#in~cond := (if main_~i~0 <= 1000000 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {182#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:17:27,730 INFO L280 TraceCheckUtils]: 5: Hoare triple {182#(<= ULTIMATE.start_main_~i~0 1)} assume !(0 == __VERIFIER_assert_~cond); {182#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:17:27,731 INFO L280 TraceCheckUtils]: 6: Hoare triple {182#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {183#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:17:27,732 INFO L280 TraceCheckUtils]: 7: Hoare triple {183#(<= ULTIMATE.start_main_~i~0 2)} assume !!(1000000 != main_~i~0);__VERIFIER_assert_#in~cond := (if main_~i~0 <= 1000000 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {184#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:17:27,734 INFO L280 TraceCheckUtils]: 8: Hoare triple {184#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {180#false} is VALID [2020-07-28 18:17:27,735 INFO L280 TraceCheckUtils]: 9: Hoare triple {180#false} assume !false; {180#false} is VALID [2020-07-28 18:17:27,736 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-28 18:17:27,736 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344203617] [2020-07-28 18:17:27,737 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311507430] [2020-07-28 18:17:27,737 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-28 18:17:27,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 18:17:27,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:17:27,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-28 18:17:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:17:27,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:17:27,880 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 18:17:27,910 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 18:17:27,964 INFO L280 TraceCheckUtils]: 0: Hoare triple {179#true} havoc main_#res;havoc main_#t~post0, main_~i~0;havoc main_~i~0;main_~i~0 := 0; {181#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-28 18:17:27,965 INFO L280 TraceCheckUtils]: 1: Hoare triple {181#(<= ULTIMATE.start_main_~i~0 0)} assume !!(1000000 != main_~i~0);__VERIFIER_assert_#in~cond := (if main_~i~0 <= 1000000 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {181#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-28 18:17:27,966 INFO L280 TraceCheckUtils]: 2: Hoare triple {181#(<= ULTIMATE.start_main_~i~0 0)} assume !(0 == __VERIFIER_assert_~cond); {181#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-28 18:17:27,967 INFO L280 TraceCheckUtils]: 3: Hoare triple {181#(<= ULTIMATE.start_main_~i~0 0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {182#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:17:27,968 INFO L280 TraceCheckUtils]: 4: Hoare triple {182#(<= ULTIMATE.start_main_~i~0 1)} assume !!(1000000 != main_~i~0);__VERIFIER_assert_#in~cond := (if main_~i~0 <= 1000000 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {182#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:17:27,969 INFO L280 TraceCheckUtils]: 5: Hoare triple {182#(<= ULTIMATE.start_main_~i~0 1)} assume !(0 == __VERIFIER_assert_~cond); {182#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:17:27,970 INFO L280 TraceCheckUtils]: 6: Hoare triple {182#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {183#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:17:27,972 INFO L280 TraceCheckUtils]: 7: Hoare triple {183#(<= ULTIMATE.start_main_~i~0 2)} assume !!(1000000 != main_~i~0);__VERIFIER_assert_#in~cond := (if main_~i~0 <= 1000000 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {209#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2020-07-28 18:17:27,973 INFO L280 TraceCheckUtils]: 8: Hoare triple {209#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {180#false} is VALID [2020-07-28 18:17:27,973 INFO L280 TraceCheckUtils]: 9: Hoare triple {180#false} assume !false; {180#false} is VALID [2020-07-28 18:17:27,974 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-28 18:17:27,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:17:27,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-28 18:17:27,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075821796] [2020-07-28 18:17:27,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2020-07-28 18:17:27,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:17:27,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-28 18:17:27,992 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-28 18:17:27,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-28 18:17:27,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:17:27,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-28 18:17:27,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-28 18:17:27,994 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 7 states. [2020-07-28 18:17:28,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:28,134 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-28 18:17:28,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-28 18:17:28,135 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2020-07-28 18:17:28,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:17:28,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 18:17:28,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2020-07-28 18:17:28,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 18:17:28,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2020-07-28 18:17:28,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 18 transitions. [2020-07-28 18:17:28,165 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:17:28,166 INFO L225 Difference]: With dead ends: 18 [2020-07-28 18:17:28,166 INFO L226 Difference]: Without dead ends: 16 [2020-07-28 18:17:28,167 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-07-28 18:17:28,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-28 18:17:28,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2020-07-28 18:17:28,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:17:28,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 14 states. [2020-07-28 18:17:28,188 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 14 states. [2020-07-28 18:17:28,188 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 14 states. [2020-07-28 18:17:28,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:28,189 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-28 18:17:28,190 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-28 18:17:28,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:28,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:17:28,191 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 16 states. [2020-07-28 18:17:28,191 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 16 states. [2020-07-28 18:17:28,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:28,193 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-28 18:17:28,193 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-28 18:17:28,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:28,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:17:28,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:17:28,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:17:28,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-28 18:17:28,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2020-07-28 18:17:28,196 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2020-07-28 18:17:28,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:17:28,196 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2020-07-28 18:17:28,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-28 18:17:28,197 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-28 18:17:28,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-28 18:17:28,198 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:17:28,198 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2020-07-28 18:17:28,411 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:17:28,412 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:17:28,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:17:28,412 INFO L82 PathProgramCache]: Analyzing trace with hash -2039914178, now seen corresponding path program 3 times [2020-07-28 18:17:28,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:17:28,413 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33445358] [2020-07-28 18:17:28,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:17:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:17:28,503 INFO L280 TraceCheckUtils]: 0: Hoare triple {301#true} havoc main_#res;havoc main_#t~post0, main_~i~0;havoc main_~i~0;main_~i~0 := 0; {303#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-28 18:17:28,503 INFO L280 TraceCheckUtils]: 1: Hoare triple {303#(<= ULTIMATE.start_main_~i~0 0)} assume !!(1000000 != main_~i~0);__VERIFIER_assert_#in~cond := (if main_~i~0 <= 1000000 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {303#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-28 18:17:28,504 INFO L280 TraceCheckUtils]: 2: Hoare triple {303#(<= ULTIMATE.start_main_~i~0 0)} assume !(0 == __VERIFIER_assert_~cond); {303#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-28 18:17:28,505 INFO L280 TraceCheckUtils]: 3: Hoare triple {303#(<= ULTIMATE.start_main_~i~0 0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {304#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:17:28,506 INFO L280 TraceCheckUtils]: 4: Hoare triple {304#(<= ULTIMATE.start_main_~i~0 1)} assume !!(1000000 != main_~i~0);__VERIFIER_assert_#in~cond := (if main_~i~0 <= 1000000 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {304#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:17:28,507 INFO L280 TraceCheckUtils]: 5: Hoare triple {304#(<= ULTIMATE.start_main_~i~0 1)} assume !(0 == __VERIFIER_assert_~cond); {304#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:17:28,508 INFO L280 TraceCheckUtils]: 6: Hoare triple {304#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {305#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:17:28,509 INFO L280 TraceCheckUtils]: 7: Hoare triple {305#(<= ULTIMATE.start_main_~i~0 2)} assume !!(1000000 != main_~i~0);__VERIFIER_assert_#in~cond := (if main_~i~0 <= 1000000 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {305#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:17:28,510 INFO L280 TraceCheckUtils]: 8: Hoare triple {305#(<= ULTIMATE.start_main_~i~0 2)} assume !(0 == __VERIFIER_assert_~cond); {305#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:17:28,511 INFO L280 TraceCheckUtils]: 9: Hoare triple {305#(<= ULTIMATE.start_main_~i~0 2)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {306#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:17:28,512 INFO L280 TraceCheckUtils]: 10: Hoare triple {306#(<= ULTIMATE.start_main_~i~0 3)} assume !!(1000000 != main_~i~0);__VERIFIER_assert_#in~cond := (if main_~i~0 <= 1000000 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {307#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:17:28,513 INFO L280 TraceCheckUtils]: 11: Hoare triple {307#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {302#false} is VALID [2020-07-28 18:17:28,513 INFO L280 TraceCheckUtils]: 12: Hoare triple {302#false} assume !false; {302#false} is VALID [2020-07-28 18:17:28,514 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-28 18:17:28,515 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33445358] [2020-07-28 18:17:28,515 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289430083] [2020-07-28 18:17:28,515 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-28 18:17:28,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-28 18:17:28,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:17:28,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-28 18:17:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:17:28,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:17:28,608 INFO L342 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-07-28 18:17:28,608 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 18:17:28,722 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 18:17:28,747 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 18:17:28,779 INFO L280 TraceCheckUtils]: 0: Hoare triple {301#true} havoc main_#res;havoc main_#t~post0, main_~i~0;havoc main_~i~0;main_~i~0 := 0; {301#true} is VALID [2020-07-28 18:17:28,779 INFO L280 TraceCheckUtils]: 1: Hoare triple {301#true} assume !!(1000000 != main_~i~0);__VERIFIER_assert_#in~cond := (if main_~i~0 <= 1000000 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {301#true} is VALID [2020-07-28 18:17:28,779 INFO L280 TraceCheckUtils]: 2: Hoare triple {301#true} assume !(0 == __VERIFIER_assert_~cond); {301#true} is VALID [2020-07-28 18:17:28,780 INFO L280 TraceCheckUtils]: 3: Hoare triple {301#true} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {301#true} is VALID [2020-07-28 18:17:28,780 INFO L280 TraceCheckUtils]: 4: Hoare triple {301#true} assume !!(1000000 != main_~i~0);__VERIFIER_assert_#in~cond := (if main_~i~0 <= 1000000 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {301#true} is VALID [2020-07-28 18:17:28,780 INFO L280 TraceCheckUtils]: 5: Hoare triple {301#true} assume !(0 == __VERIFIER_assert_~cond); {301#true} is VALID [2020-07-28 18:17:28,780 INFO L280 TraceCheckUtils]: 6: Hoare triple {301#true} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {301#true} is VALID [2020-07-28 18:17:28,781 INFO L280 TraceCheckUtils]: 7: Hoare triple {301#true} assume !!(1000000 != main_~i~0);__VERIFIER_assert_#in~cond := (if main_~i~0 <= 1000000 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {332#(and (or (and (< 1000000 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (and (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= ULTIMATE.start_main_~i~0 1000000))) (not (= ULTIMATE.start_main_~i~0 1000000)))} is VALID [2020-07-28 18:17:28,782 INFO L280 TraceCheckUtils]: 8: Hoare triple {332#(and (or (and (< 1000000 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (and (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= ULTIMATE.start_main_~i~0 1000000))) (not (= ULTIMATE.start_main_~i~0 1000000)))} assume !(0 == __VERIFIER_assert_~cond); {336#(and (<= ULTIMATE.start_main_~i~0 1000000) (not (= ULTIMATE.start_main_~i~0 1000000)))} is VALID [2020-07-28 18:17:28,784 INFO L280 TraceCheckUtils]: 9: Hoare triple {336#(and (<= ULTIMATE.start_main_~i~0 1000000) (not (= ULTIMATE.start_main_~i~0 1000000)))} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {340#(<= ULTIMATE.start_main_~i~0 1000000)} is VALID [2020-07-28 18:17:28,784 INFO L280 TraceCheckUtils]: 10: Hoare triple {340#(<= ULTIMATE.start_main_~i~0 1000000)} assume !!(1000000 != main_~i~0);__VERIFIER_assert_#in~cond := (if main_~i~0 <= 1000000 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {344#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2020-07-28 18:17:28,785 INFO L280 TraceCheckUtils]: 11: Hoare triple {344#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {302#false} is VALID [2020-07-28 18:17:28,786 INFO L280 TraceCheckUtils]: 12: Hoare triple {302#false} assume !false; {302#false} is VALID [2020-07-28 18:17:28,786 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-28 18:17:28,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:17:28,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2020-07-28 18:17:28,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544780471] [2020-07-28 18:17:28,787 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2020-07-28 18:17:28,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:17:28,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-28 18:17:28,816 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:17:28,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-28 18:17:28,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:17:28,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-28 18:17:28,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-07-28 18:17:28,817 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 11 states. [2020-07-28 18:17:29,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:29,170 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2020-07-28 18:17:29,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-28 18:17:29,171 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2020-07-28 18:17:29,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:17:29,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-28 18:17:29,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. [2020-07-28 18:17:29,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-28 18:17:29,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. [2020-07-28 18:17:29,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 20 transitions. [2020-07-28 18:17:29,225 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:17:29,225 INFO L225 Difference]: With dead ends: 19 [2020-07-28 18:17:29,225 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 18:17:29,226 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2020-07-28 18:17:29,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 18:17:29,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 18:17:29,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:17:29,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 18:17:29,227 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:17:29,227 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:17:29,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:29,228 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:17:29,228 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:17:29,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:29,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:17:29,229 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:17:29,229 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:17:29,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:29,229 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:17:29,229 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:17:29,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:29,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:17:29,230 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:17:29,230 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:17:29,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 18:17:29,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 18:17:29,236 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2020-07-28 18:17:29,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:17:29,237 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 18:17:29,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-28 18:17:29,237 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:17:29,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:29,444 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:17:29,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 18:17:29,598 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 18:17:29,598 INFO L264 CegarLoopResult]: At program point L15-2(lines 15 17) the Hoare annotation is: (or (<= ULTIMATE.start_main_~i~0 0) (and (<= ULTIMATE.start_main_~i~0 1000000) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond))) [2020-07-28 18:17:29,598 INFO L268 CegarLoopResult]: For program point L15-3(lines 15 17) no Hoare annotation was computed. [2020-07-28 18:17:29,599 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:17:29,599 INFO L264 CegarLoopResult]: At program point L7-2(lines 1 19) the Hoare annotation is: (and (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= ULTIMATE.start_main_~i~0 1000000) (not (= ULTIMATE.start_main_~i~0 1000000))) [2020-07-28 18:17:29,599 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 18:17:29,599 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 18:17:29,599 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:17:29,599 INFO L264 CegarLoopResult]: At program point L18(lines 13 19) the Hoare annotation is: (<= ULTIMATE.start_main_~i~0 1000000) [2020-07-28 18:17:29,599 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-28 18:17:29,604 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 18:17:29,604 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2020-07-28 18:17:29,604 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2020-07-28 18:17:29,604 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-28 18:17:29,604 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2020-07-28 18:17:29,604 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-28 18:17:29,605 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-28 18:17:29,605 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:17:29,605 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-28 18:17:29,605 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-28 18:17:29,608 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:17:29,608 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 18:17:29,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 06:17:29 BoogieIcfgContainer [2020-07-28 18:17:29,619 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 18:17:29,619 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 18:17:29,619 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 18:17:29,619 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 18:17:29,620 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:17:26" (3/4) ... [2020-07-28 18:17:29,624 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 18:17:29,632 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-07-28 18:17:29,632 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-28 18:17:29,671 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 18:17:29,671 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 18:17:29,675 INFO L168 Benchmark]: Toolchain (without parser) took 4142.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.9 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:17:29,675 INFO L168 Benchmark]: CDTParser took 0.33 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-28 18:17:29,676 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.13 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:17:29,677 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -153.1 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2020-07-28 18:17:29,678 INFO L168 Benchmark]: Boogie Preprocessor took 19.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2020-07-28 18:17:29,678 INFO L168 Benchmark]: RCFGBuilder took 323.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2020-07-28 18:17:29,679 INFO L168 Benchmark]: TraceAbstraction took 3345.51 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 81.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -80.0 MB). Peak memory consumption was 1.2 MB. Max. memory is 11.5 GB. [2020-07-28 18:17:29,680 INFO L168 Benchmark]: Witness Printer took 52.34 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-28 18:17:29,684 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.33 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 312.13 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 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 81.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -153.1 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 323.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3345.51 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 81.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -80.0 MB). Peak memory consumption was 1.2 MB. Max. memory is 11.5 GB. * Witness Printer took 52.34 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (1 == cond && i <= 1000000) && !(i == 1000000) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: i <= 1000000 - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: i <= 0 || (i <= 1000000 && 1 <= cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.1s, OverallIterations: 4, TraceHistogramMax: 4, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 18 SDtfs, 50 SDslu, 29 SDs, 0 SdLazy, 57 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 16 NumberOfFragments, 25 HoareAnnotationTreeSize, 3 FomulaSimplifications, 419 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 117 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 64 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 1605 SizeOfPredicates, 11 NumberOfNonLiveVariables, 76 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 14/48 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...