/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/nested6.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:47:11,497 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:47:11,500 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:47:11,515 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:47:11,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:47:11,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:47:11,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:47:11,520 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:47:11,521 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:47:11,522 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:47:11,523 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:47:11,524 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:47:11,525 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:47:11,526 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:47:11,527 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:47:11,528 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:47:11,529 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:47:11,530 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:47:11,531 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:47:11,533 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:47:11,535 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:47:11,536 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:47:11,537 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:47:11,538 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:47:11,540 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:47:11,541 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:47:11,541 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:47:11,542 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:47:11,542 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:47:11,543 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:47:11,544 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:47:11,544 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:47:11,545 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:47:11,546 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:47:11,547 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:47:11,547 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:47:11,548 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:47:11,548 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:47:11,548 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:47:11,549 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:47:11,550 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:47:11,550 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-08 12:47:11,565 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:47:11,565 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:47:11,567 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:47:11,567 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:47:11,567 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:47:11,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:47:11,568 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:47:11,568 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:47:11,568 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:47:11,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:47:11,568 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:47:11,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:47:11,569 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:47:11,569 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:47:11,569 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:47:11,569 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:47:11,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:47:11,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:47:11,570 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:47:11,570 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:47:11,570 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:47:11,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:47:11,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:47:11,571 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:47:11,571 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:47:11,571 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:47:11,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:47:11,572 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:47:11,572 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:47:11,572 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:47:11,843 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:47:11,856 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:47:11,860 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:47:11,861 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:47:11,862 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:47:11,863 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested6.i [2020-07-08 12:47:11,945 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5e3c2efb/5bb47d0e360642c9b2f86b1515cac368/FLAG77a5c577b [2020-07-08 12:47:12,422 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:47:12,423 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6.i [2020-07-08 12:47:12,430 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5e3c2efb/5bb47d0e360642c9b2f86b1515cac368/FLAG77a5c577b [2020-07-08 12:47:12,795 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5e3c2efb/5bb47d0e360642c9b2f86b1515cac368 [2020-07-08 12:47:12,804 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:47:12,806 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:47:12,807 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:47:12,808 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:47:12,811 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:47:12,813 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:47:12" (1/1) ... [2020-07-08 12:47:12,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3615f435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:12, skipping insertion in model container [2020-07-08 12:47:12,818 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:47:12" (1/1) ... [2020-07-08 12:47:12,828 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:47:12,850 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:47:13,023 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:47:13,028 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:47:13,048 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:47:13,064 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:47:13,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:13 WrapperNode [2020-07-08 12:47:13,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:47:13,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:47:13,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:47:13,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:47:13,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:13" (1/1) ... [2020-07-08 12:47:13,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:13" (1/1) ... [2020-07-08 12:47:13,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:13" (1/1) ... [2020-07-08 12:47:13,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:13" (1/1) ... [2020-07-08 12:47:13,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:13" (1/1) ... [2020-07-08 12:47:13,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:13" (1/1) ... [2020-07-08 12:47:13,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:13" (1/1) ... [2020-07-08 12:47:13,104 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:47:13,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:47:13,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:47:13,105 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:47:13,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:13" (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-08 12:47:13,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:47:13,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:47:13,250 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 12:47:13,250 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 12:47:13,250 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:47:13,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:47:13,251 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 12:47:13,251 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 12:47:13,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 12:47:13,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:47:13,251 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:47:13,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:47:13,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:47:13,664 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:47:13,664 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-08 12:47:13,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:47:13 BoogieIcfgContainer [2020-07-08 12:47:13,668 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:47:13,669 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:47:13,669 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:47:13,673 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:47:13,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:47:12" (1/3) ... [2020-07-08 12:47:13,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f29f034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:47:13, skipping insertion in model container [2020-07-08 12:47:13,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:13" (2/3) ... [2020-07-08 12:47:13,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f29f034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:47:13, skipping insertion in model container [2020-07-08 12:47:13,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:47:13" (3/3) ... [2020-07-08 12:47:13,676 INFO L109 eAbstractionObserver]: Analyzing ICFG nested6.i [2020-07-08 12:47:13,686 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:47:13,692 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:47:13,703 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:47:13,727 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:47:13,728 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:47:13,728 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:47:13,728 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:47:13,728 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:47:13,728 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:47:13,728 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:47:13,729 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:47:13,748 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-07-08 12:47:13,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-08 12:47:13,755 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:13,756 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:47:13,757 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:13,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:13,764 INFO L82 PathProgramCache]: Analyzing trace with hash 404168940, now seen corresponding path program 1 times [2020-07-08 12:47:13,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:13,774 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926346724] [2020-07-08 12:47:13,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:14,026 INFO L280 TraceCheckUtils]: 0: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-08 12:47:14,027 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {32#true} {32#true} #84#return; {32#true} is VALID [2020-07-08 12:47:14,029 INFO L263 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2020-07-08 12:47:14,030 INFO L280 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-08 12:47:14,030 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #84#return; {32#true} is VALID [2020-07-08 12:47:14,031 INFO L263 TraceCheckUtils]: 3: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2020-07-08 12:47:14,031 INFO L280 TraceCheckUtils]: 4: Hoare triple {32#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {32#true} is VALID [2020-07-08 12:47:14,032 INFO L280 TraceCheckUtils]: 5: Hoare triple {32#true} assume !!(~n~0 < 1000000); {32#true} is VALID [2020-07-08 12:47:14,033 INFO L280 TraceCheckUtils]: 6: Hoare triple {32#true} assume ~k~0 == ~n~0; {36#(<= main_~n~0 main_~k~0)} is VALID [2020-07-08 12:47:14,035 INFO L280 TraceCheckUtils]: 7: Hoare triple {36#(<= main_~n~0 main_~k~0)} ~i~0 := 0; {36#(<= main_~n~0 main_~k~0)} is VALID [2020-07-08 12:47:14,036 INFO L280 TraceCheckUtils]: 8: Hoare triple {36#(<= main_~n~0 main_~k~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {36#(<= main_~n~0 main_~k~0)} is VALID [2020-07-08 12:47:14,037 INFO L280 TraceCheckUtils]: 9: Hoare triple {36#(<= main_~n~0 main_~k~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {36#(<= main_~n~0 main_~k~0)} is VALID [2020-07-08 12:47:14,038 INFO L280 TraceCheckUtils]: 10: Hoare triple {36#(<= main_~n~0 main_~k~0)} assume !(0 != #t~nondet4);havoc #t~nondet4; {36#(<= main_~n~0 main_~k~0)} is VALID [2020-07-08 12:47:14,041 INFO L263 TraceCheckUtils]: 11: Hoare triple {36#(<= main_~n~0 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {37#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:47:14,042 INFO L280 TraceCheckUtils]: 12: Hoare triple {37#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {38#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:47:14,044 INFO L280 TraceCheckUtils]: 13: Hoare triple {38#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {33#false} is VALID [2020-07-08 12:47:14,044 INFO L280 TraceCheckUtils]: 14: Hoare triple {33#false} assume !false; {33#false} is VALID [2020-07-08 12:47:14,046 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-08 12:47:14,048 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926346724] [2020-07-08 12:47:14,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:47:14,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:47:14,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032708929] [2020-07-08 12:47:14,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-08 12:47:14,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:14,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:47:14,099 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-08 12:47:14,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:47:14,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:14,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:47:14,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:47:14,113 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 5 states. [2020-07-08 12:47:14,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:14,416 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2020-07-08 12:47:14,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:47:14,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-08 12:47:14,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:14,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:47:14,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2020-07-08 12:47:14,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:47:14,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2020-07-08 12:47:14,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 80 transitions. [2020-07-08 12:47:14,568 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:14,597 INFO L225 Difference]: With dead ends: 57 [2020-07-08 12:47:14,597 INFO L226 Difference]: Without dead ends: 28 [2020-07-08 12:47:14,601 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:47:14,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-08 12:47:14,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-08 12:47:14,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:14,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-08 12:47:14,657 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-08 12:47:14,657 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-08 12:47:14,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:14,662 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2020-07-08 12:47:14,663 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-08 12:47:14,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:14,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:14,664 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-08 12:47:14,664 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-08 12:47:14,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:14,668 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2020-07-08 12:47:14,669 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-08 12:47:14,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:14,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:14,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:14,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:14,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-08 12:47:14,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-07-08 12:47:14,675 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2020-07-08 12:47:14,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:14,676 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-07-08 12:47:14,676 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:47:14,676 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-08 12:47:14,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-08 12:47:14,678 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:14,678 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:47:14,678 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:47:14,678 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:14,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:14,679 INFO L82 PathProgramCache]: Analyzing trace with hash -849304486, now seen corresponding path program 1 times [2020-07-08 12:47:14,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:14,680 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634605364] [2020-07-08 12:47:14,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:14,803 INFO L280 TraceCheckUtils]: 0: Hoare triple {218#true} assume true; {218#true} is VALID [2020-07-08 12:47:14,804 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {218#true} {218#true} #84#return; {218#true} is VALID [2020-07-08 12:47:14,804 INFO L263 TraceCheckUtils]: 0: Hoare triple {218#true} call ULTIMATE.init(); {218#true} is VALID [2020-07-08 12:47:14,805 INFO L280 TraceCheckUtils]: 1: Hoare triple {218#true} assume true; {218#true} is VALID [2020-07-08 12:47:14,805 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {218#true} {218#true} #84#return; {218#true} is VALID [2020-07-08 12:47:14,805 INFO L263 TraceCheckUtils]: 3: Hoare triple {218#true} call #t~ret6 := main(); {218#true} is VALID [2020-07-08 12:47:14,806 INFO L280 TraceCheckUtils]: 4: Hoare triple {218#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {218#true} is VALID [2020-07-08 12:47:14,806 INFO L280 TraceCheckUtils]: 5: Hoare triple {218#true} assume !!(~n~0 < 1000000); {218#true} is VALID [2020-07-08 12:47:14,806 INFO L280 TraceCheckUtils]: 6: Hoare triple {218#true} assume ~k~0 == ~n~0; {218#true} is VALID [2020-07-08 12:47:14,807 INFO L280 TraceCheckUtils]: 7: Hoare triple {218#true} ~i~0 := 0; {218#true} is VALID [2020-07-08 12:47:14,808 INFO L280 TraceCheckUtils]: 8: Hoare triple {218#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {222#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-08 12:47:14,809 INFO L280 TraceCheckUtils]: 9: Hoare triple {222#(<= (* 2 main_~i~0) main_~j~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {222#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-08 12:47:14,810 INFO L280 TraceCheckUtils]: 10: Hoare triple {222#(<= (* 2 main_~i~0) main_~j~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~k~0 := ~j~0; {223#(<= (* 2 main_~i~0) main_~k~0)} is VALID [2020-07-08 12:47:14,811 INFO L280 TraceCheckUtils]: 11: Hoare triple {223#(<= (* 2 main_~i~0) main_~k~0)} assume !!(~k~0 < ~n~0); {223#(<= (* 2 main_~i~0) main_~k~0)} is VALID [2020-07-08 12:47:14,812 INFO L263 TraceCheckUtils]: 12: Hoare triple {223#(<= (* 2 main_~i~0) main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {224#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:47:14,813 INFO L280 TraceCheckUtils]: 13: Hoare triple {224#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {225#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:47:14,814 INFO L280 TraceCheckUtils]: 14: Hoare triple {225#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {219#false} is VALID [2020-07-08 12:47:14,814 INFO L280 TraceCheckUtils]: 15: Hoare triple {219#false} assume !false; {219#false} is VALID [2020-07-08 12:47:14,816 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-08 12:47:14,816 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634605364] [2020-07-08 12:47:14,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:47:14,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:47:14,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479596835] [2020-07-08 12:47:14,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-08 12:47:14,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:14,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:47:14,841 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:14,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:47:14,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:14,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:47:14,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:47:14,843 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 6 states. [2020-07-08 12:47:15,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:15,201 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2020-07-08 12:47:15,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:47:15,202 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-08 12:47:15,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:15,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:47:15,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2020-07-08 12:47:15,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:47:15,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2020-07-08 12:47:15,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2020-07-08 12:47:15,293 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:15,296 INFO L225 Difference]: With dead ends: 40 [2020-07-08 12:47:15,297 INFO L226 Difference]: Without dead ends: 38 [2020-07-08 12:47:15,298 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:47:15,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-08 12:47:15,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2020-07-08 12:47:15,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:15,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 32 states. [2020-07-08 12:47:15,336 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 32 states. [2020-07-08 12:47:15,337 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 32 states. [2020-07-08 12:47:15,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:15,344 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2020-07-08 12:47:15,344 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2020-07-08 12:47:15,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:15,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:15,347 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 38 states. [2020-07-08 12:47:15,347 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 38 states. [2020-07-08 12:47:15,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:15,361 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2020-07-08 12:47:15,362 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2020-07-08 12:47:15,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:15,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:15,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:15,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:15,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-08 12:47:15,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2020-07-08 12:47:15,370 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 16 [2020-07-08 12:47:15,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:15,371 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2020-07-08 12:47:15,371 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:47:15,371 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-07-08 12:47:15,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-08 12:47:15,372 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:15,373 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:47:15,373 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:47:15,373 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:15,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:15,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1573212483, now seen corresponding path program 1 times [2020-07-08 12:47:15,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:15,375 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962899460] [2020-07-08 12:47:15,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:15,478 INFO L280 TraceCheckUtils]: 0: Hoare triple {409#true} assume true; {409#true} is VALID [2020-07-08 12:47:15,478 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {409#true} {409#true} #84#return; {409#true} is VALID [2020-07-08 12:47:15,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:15,495 INFO L280 TraceCheckUtils]: 0: Hoare triple {409#true} ~cond := #in~cond; {409#true} is VALID [2020-07-08 12:47:15,496 INFO L280 TraceCheckUtils]: 1: Hoare triple {409#true} assume !(0 == ~cond); {409#true} is VALID [2020-07-08 12:47:15,496 INFO L280 TraceCheckUtils]: 2: Hoare triple {409#true} assume true; {409#true} is VALID [2020-07-08 12:47:15,497 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {409#true} {413#(<= main_~k~0 main_~n~0)} #90#return; {413#(<= main_~k~0 main_~n~0)} is VALID [2020-07-08 12:47:15,498 INFO L263 TraceCheckUtils]: 0: Hoare triple {409#true} call ULTIMATE.init(); {409#true} is VALID [2020-07-08 12:47:15,498 INFO L280 TraceCheckUtils]: 1: Hoare triple {409#true} assume true; {409#true} is VALID [2020-07-08 12:47:15,499 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {409#true} {409#true} #84#return; {409#true} is VALID [2020-07-08 12:47:15,499 INFO L263 TraceCheckUtils]: 3: Hoare triple {409#true} call #t~ret6 := main(); {409#true} is VALID [2020-07-08 12:47:15,500 INFO L280 TraceCheckUtils]: 4: Hoare triple {409#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {409#true} is VALID [2020-07-08 12:47:15,500 INFO L280 TraceCheckUtils]: 5: Hoare triple {409#true} assume !!(~n~0 < 1000000); {409#true} is VALID [2020-07-08 12:47:15,506 INFO L280 TraceCheckUtils]: 6: Hoare triple {409#true} assume ~k~0 == ~n~0; {413#(<= main_~k~0 main_~n~0)} is VALID [2020-07-08 12:47:15,508 INFO L280 TraceCheckUtils]: 7: Hoare triple {413#(<= main_~k~0 main_~n~0)} ~i~0 := 0; {413#(<= main_~k~0 main_~n~0)} is VALID [2020-07-08 12:47:15,509 INFO L280 TraceCheckUtils]: 8: Hoare triple {413#(<= main_~k~0 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {413#(<= main_~k~0 main_~n~0)} is VALID [2020-07-08 12:47:15,513 INFO L280 TraceCheckUtils]: 9: Hoare triple {413#(<= main_~k~0 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {413#(<= main_~k~0 main_~n~0)} is VALID [2020-07-08 12:47:15,514 INFO L280 TraceCheckUtils]: 10: Hoare triple {413#(<= main_~k~0 main_~n~0)} assume !(0 != #t~nondet4);havoc #t~nondet4; {413#(<= main_~k~0 main_~n~0)} is VALID [2020-07-08 12:47:15,515 INFO L263 TraceCheckUtils]: 11: Hoare triple {413#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {409#true} is VALID [2020-07-08 12:47:15,515 INFO L280 TraceCheckUtils]: 12: Hoare triple {409#true} ~cond := #in~cond; {409#true} is VALID [2020-07-08 12:47:15,516 INFO L280 TraceCheckUtils]: 13: Hoare triple {409#true} assume !(0 == ~cond); {409#true} is VALID [2020-07-08 12:47:15,516 INFO L280 TraceCheckUtils]: 14: Hoare triple {409#true} assume true; {409#true} is VALID [2020-07-08 12:47:15,518 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {409#true} {413#(<= main_~k~0 main_~n~0)} #90#return; {413#(<= main_~k~0 main_~n~0)} is VALID [2020-07-08 12:47:15,519 INFO L263 TraceCheckUtils]: 16: Hoare triple {413#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {418#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:47:15,521 INFO L280 TraceCheckUtils]: 17: Hoare triple {418#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {419#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:47:15,521 INFO L280 TraceCheckUtils]: 18: Hoare triple {419#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {410#false} is VALID [2020-07-08 12:47:15,522 INFO L280 TraceCheckUtils]: 19: Hoare triple {410#false} assume !false; {410#false} is VALID [2020-07-08 12:47:15,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:47:15,524 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962899460] [2020-07-08 12:47:15,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:47:15,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:47:15,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680007385] [2020-07-08 12:47:15,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-08 12:47:15,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:15,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:47:15,551 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-08 12:47:15,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:47:15,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:15,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:47:15,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:47:15,552 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 5 states. [2020-07-08 12:47:15,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:15,778 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2020-07-08 12:47:15,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:47:15,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-08 12:47:15,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:15,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:47:15,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2020-07-08 12:47:15,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:47:15,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2020-07-08 12:47:15,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2020-07-08 12:47:15,852 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:15,855 INFO L225 Difference]: With dead ends: 45 [2020-07-08 12:47:15,855 INFO L226 Difference]: Without dead ends: 43 [2020-07-08 12:47:15,856 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:47:15,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-08 12:47:15,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-08 12:47:15,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:15,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2020-07-08 12:47:15,884 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-08 12:47:15,885 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-08 12:47:15,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:15,888 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2020-07-08 12:47:15,888 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2020-07-08 12:47:15,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:15,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:15,889 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-08 12:47:15,890 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-08 12:47:15,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:15,893 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2020-07-08 12:47:15,893 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2020-07-08 12:47:15,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:15,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:15,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:15,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:15,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-08 12:47:15,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2020-07-08 12:47:15,897 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 20 [2020-07-08 12:47:15,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:15,898 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2020-07-08 12:47:15,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:47:15,898 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2020-07-08 12:47:15,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 12:47:15,899 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:15,900 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:47:15,900 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 12:47:15,900 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:15,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:15,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1604756500, now seen corresponding path program 1 times [2020-07-08 12:47:15,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:15,901 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872688839] [2020-07-08 12:47:15,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:15,973 INFO L280 TraceCheckUtils]: 0: Hoare triple {634#true} assume true; {634#true} is VALID [2020-07-08 12:47:15,973 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {634#true} {634#true} #84#return; {634#true} is VALID [2020-07-08 12:47:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:15,978 INFO L280 TraceCheckUtils]: 0: Hoare triple {634#true} ~cond := #in~cond; {634#true} is VALID [2020-07-08 12:47:15,979 INFO L280 TraceCheckUtils]: 1: Hoare triple {634#true} assume !(0 == ~cond); {634#true} is VALID [2020-07-08 12:47:15,979 INFO L280 TraceCheckUtils]: 2: Hoare triple {634#true} assume true; {634#true} is VALID [2020-07-08 12:47:15,979 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {634#true} {635#false} #90#return; {635#false} is VALID [2020-07-08 12:47:15,980 INFO L263 TraceCheckUtils]: 0: Hoare triple {634#true} call ULTIMATE.init(); {634#true} is VALID [2020-07-08 12:47:15,980 INFO L280 TraceCheckUtils]: 1: Hoare triple {634#true} assume true; {634#true} is VALID [2020-07-08 12:47:15,980 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {634#true} {634#true} #84#return; {634#true} is VALID [2020-07-08 12:47:15,981 INFO L263 TraceCheckUtils]: 3: Hoare triple {634#true} call #t~ret6 := main(); {634#true} is VALID [2020-07-08 12:47:15,981 INFO L280 TraceCheckUtils]: 4: Hoare triple {634#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {634#true} is VALID [2020-07-08 12:47:15,981 INFO L280 TraceCheckUtils]: 5: Hoare triple {634#true} assume !!(~n~0 < 1000000); {634#true} is VALID [2020-07-08 12:47:15,982 INFO L280 TraceCheckUtils]: 6: Hoare triple {634#true} assume ~k~0 == ~n~0; {634#true} is VALID [2020-07-08 12:47:15,982 INFO L280 TraceCheckUtils]: 7: Hoare triple {634#true} ~i~0 := 0; {638#(<= main_~i~0 0)} is VALID [2020-07-08 12:47:15,984 INFO L280 TraceCheckUtils]: 8: Hoare triple {638#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {639#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-08 12:47:15,984 INFO L280 TraceCheckUtils]: 9: Hoare triple {639#(<= (+ main_~j~0 1) main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {639#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-08 12:47:15,985 INFO L280 TraceCheckUtils]: 10: Hoare triple {639#(<= (+ main_~j~0 1) main_~n~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~k~0 := ~j~0; {640#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2020-07-08 12:47:15,986 INFO L280 TraceCheckUtils]: 11: Hoare triple {640#(<= (+ main_~k~0 1) main_~n~0)} assume !(~k~0 < ~n~0); {635#false} is VALID [2020-07-08 12:47:15,986 INFO L280 TraceCheckUtils]: 12: Hoare triple {635#false} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {635#false} is VALID [2020-07-08 12:47:15,987 INFO L280 TraceCheckUtils]: 13: Hoare triple {635#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {635#false} is VALID [2020-07-08 12:47:15,987 INFO L280 TraceCheckUtils]: 14: Hoare triple {635#false} assume !(0 != #t~nondet4);havoc #t~nondet4; {635#false} is VALID [2020-07-08 12:47:15,987 INFO L263 TraceCheckUtils]: 15: Hoare triple {635#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {634#true} is VALID [2020-07-08 12:47:15,988 INFO L280 TraceCheckUtils]: 16: Hoare triple {634#true} ~cond := #in~cond; {634#true} is VALID [2020-07-08 12:47:15,988 INFO L280 TraceCheckUtils]: 17: Hoare triple {634#true} assume !(0 == ~cond); {634#true} is VALID [2020-07-08 12:47:15,988 INFO L280 TraceCheckUtils]: 18: Hoare triple {634#true} assume true; {634#true} is VALID [2020-07-08 12:47:15,989 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {634#true} {635#false} #90#return; {635#false} is VALID [2020-07-08 12:47:15,989 INFO L263 TraceCheckUtils]: 20: Hoare triple {635#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {635#false} is VALID [2020-07-08 12:47:15,989 INFO L280 TraceCheckUtils]: 21: Hoare triple {635#false} ~cond := #in~cond; {635#false} is VALID [2020-07-08 12:47:15,989 INFO L280 TraceCheckUtils]: 22: Hoare triple {635#false} assume 0 == ~cond; {635#false} is VALID [2020-07-08 12:47:15,990 INFO L280 TraceCheckUtils]: 23: Hoare triple {635#false} assume !false; {635#false} is VALID [2020-07-08 12:47:15,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:47:15,991 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872688839] [2020-07-08 12:47:15,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:47:15,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:47:15,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969620861] [2020-07-08 12:47:15,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-08 12:47:15,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:15,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:47:16,019 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:16,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:47:16,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:16,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:47:16,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:47:16,020 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 5 states. [2020-07-08 12:47:16,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:16,331 INFO L93 Difference]: Finished difference Result 97 states and 122 transitions. [2020-07-08 12:47:16,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:47:16,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-08 12:47:16,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:16,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:47:16,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2020-07-08 12:47:16,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:47:16,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2020-07-08 12:47:16,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2020-07-08 12:47:16,432 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:16,435 INFO L225 Difference]: With dead ends: 97 [2020-07-08 12:47:16,435 INFO L226 Difference]: Without dead ends: 62 [2020-07-08 12:47:16,436 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:47:16,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-08 12:47:16,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 46. [2020-07-08 12:47:16,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:16,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 46 states. [2020-07-08 12:47:16,486 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 46 states. [2020-07-08 12:47:16,486 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 46 states. [2020-07-08 12:47:16,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:16,490 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2020-07-08 12:47:16,491 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2020-07-08 12:47:16,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:16,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:16,492 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 62 states. [2020-07-08 12:47:16,492 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 62 states. [2020-07-08 12:47:16,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:16,496 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2020-07-08 12:47:16,497 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2020-07-08 12:47:16,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:16,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:16,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:16,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:16,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-08 12:47:16,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2020-07-08 12:47:16,501 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 24 [2020-07-08 12:47:16,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:16,501 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2020-07-08 12:47:16,501 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:47:16,502 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2020-07-08 12:47:16,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-08 12:47:16,503 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:16,503 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:47:16,503 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 12:47:16,503 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:16,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:16,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1598241856, now seen corresponding path program 1 times [2020-07-08 12:47:16,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:16,504 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795898659] [2020-07-08 12:47:16,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:16,618 INFO L280 TraceCheckUtils]: 0: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-08 12:47:16,619 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {985#true} {985#true} #84#return; {985#true} is VALID [2020-07-08 12:47:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:16,638 INFO L280 TraceCheckUtils]: 0: Hoare triple {985#true} ~cond := #in~cond; {985#true} is VALID [2020-07-08 12:47:16,639 INFO L280 TraceCheckUtils]: 1: Hoare triple {985#true} assume !(0 == ~cond); {985#true} is VALID [2020-07-08 12:47:16,639 INFO L280 TraceCheckUtils]: 2: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-08 12:47:16,640 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {985#true} {989#(<= main_~k~0 main_~j~0)} #88#return; {989#(<= main_~k~0 main_~j~0)} is VALID [2020-07-08 12:47:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:16,646 INFO L280 TraceCheckUtils]: 0: Hoare triple {985#true} ~cond := #in~cond; {985#true} is VALID [2020-07-08 12:47:16,646 INFO L280 TraceCheckUtils]: 1: Hoare triple {985#true} assume !(0 == ~cond); {985#true} is VALID [2020-07-08 12:47:16,647 INFO L280 TraceCheckUtils]: 2: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-08 12:47:16,647 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {985#true} {986#false} #90#return; {986#false} is VALID [2020-07-08 12:47:16,647 INFO L263 TraceCheckUtils]: 0: Hoare triple {985#true} call ULTIMATE.init(); {985#true} is VALID [2020-07-08 12:47:16,648 INFO L280 TraceCheckUtils]: 1: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-08 12:47:16,648 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {985#true} {985#true} #84#return; {985#true} is VALID [2020-07-08 12:47:16,648 INFO L263 TraceCheckUtils]: 3: Hoare triple {985#true} call #t~ret6 := main(); {985#true} is VALID [2020-07-08 12:47:16,649 INFO L280 TraceCheckUtils]: 4: Hoare triple {985#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {985#true} is VALID [2020-07-08 12:47:16,649 INFO L280 TraceCheckUtils]: 5: Hoare triple {985#true} assume !!(~n~0 < 1000000); {985#true} is VALID [2020-07-08 12:47:16,649 INFO L280 TraceCheckUtils]: 6: Hoare triple {985#true} assume ~k~0 == ~n~0; {985#true} is VALID [2020-07-08 12:47:16,649 INFO L280 TraceCheckUtils]: 7: Hoare triple {985#true} ~i~0 := 0; {985#true} is VALID [2020-07-08 12:47:16,650 INFO L280 TraceCheckUtils]: 8: Hoare triple {985#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {985#true} is VALID [2020-07-08 12:47:16,650 INFO L280 TraceCheckUtils]: 9: Hoare triple {985#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {985#true} is VALID [2020-07-08 12:47:16,651 INFO L280 TraceCheckUtils]: 10: Hoare triple {985#true} assume 0 != #t~nondet4;havoc #t~nondet4;~k~0 := ~j~0; {989#(<= main_~k~0 main_~j~0)} is VALID [2020-07-08 12:47:16,652 INFO L280 TraceCheckUtils]: 11: Hoare triple {989#(<= main_~k~0 main_~j~0)} assume !!(~k~0 < ~n~0); {989#(<= main_~k~0 main_~j~0)} is VALID [2020-07-08 12:47:16,653 INFO L263 TraceCheckUtils]: 12: Hoare triple {989#(<= main_~k~0 main_~j~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {985#true} is VALID [2020-07-08 12:47:16,653 INFO L280 TraceCheckUtils]: 13: Hoare triple {985#true} ~cond := #in~cond; {985#true} is VALID [2020-07-08 12:47:16,653 INFO L280 TraceCheckUtils]: 14: Hoare triple {985#true} assume !(0 == ~cond); {985#true} is VALID [2020-07-08 12:47:16,653 INFO L280 TraceCheckUtils]: 15: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-08 12:47:16,654 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {985#true} {989#(<= main_~k~0 main_~j~0)} #88#return; {989#(<= main_~k~0 main_~j~0)} is VALID [2020-07-08 12:47:16,656 INFO L280 TraceCheckUtils]: 17: Hoare triple {989#(<= main_~k~0 main_~j~0)} #t~post5 := ~k~0;~k~0 := 1 + #t~post5;havoc #t~post5; {994#(<= main_~k~0 (+ main_~j~0 1))} is VALID [2020-07-08 12:47:16,659 INFO L280 TraceCheckUtils]: 18: Hoare triple {994#(<= main_~k~0 (+ main_~j~0 1))} assume !(~k~0 < ~n~0); {995#(and (<= main_~k~0 (+ main_~j~0 1)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-08 12:47:16,660 INFO L280 TraceCheckUtils]: 19: Hoare triple {995#(and (<= main_~k~0 (+ main_~j~0 1)) (<= main_~n~0 main_~k~0))} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {996#(and (<= main_~k~0 main_~j~0) (<= main_~n~0 main_~k~0))} is VALID [2020-07-08 12:47:16,661 INFO L280 TraceCheckUtils]: 20: Hoare triple {996#(and (<= main_~k~0 main_~j~0) (<= main_~n~0 main_~k~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {986#false} is VALID [2020-07-08 12:47:16,662 INFO L280 TraceCheckUtils]: 21: Hoare triple {986#false} assume !(0 != #t~nondet4);havoc #t~nondet4; {986#false} is VALID [2020-07-08 12:47:16,662 INFO L263 TraceCheckUtils]: 22: Hoare triple {986#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {985#true} is VALID [2020-07-08 12:47:16,662 INFO L280 TraceCheckUtils]: 23: Hoare triple {985#true} ~cond := #in~cond; {985#true} is VALID [2020-07-08 12:47:16,663 INFO L280 TraceCheckUtils]: 24: Hoare triple {985#true} assume !(0 == ~cond); {985#true} is VALID [2020-07-08 12:47:16,663 INFO L280 TraceCheckUtils]: 25: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-08 12:47:16,663 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {985#true} {986#false} #90#return; {986#false} is VALID [2020-07-08 12:47:16,663 INFO L263 TraceCheckUtils]: 27: Hoare triple {986#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {986#false} is VALID [2020-07-08 12:47:16,664 INFO L280 TraceCheckUtils]: 28: Hoare triple {986#false} ~cond := #in~cond; {986#false} is VALID [2020-07-08 12:47:16,664 INFO L280 TraceCheckUtils]: 29: Hoare triple {986#false} assume 0 == ~cond; {986#false} is VALID [2020-07-08 12:47:16,664 INFO L280 TraceCheckUtils]: 30: Hoare triple {986#false} assume !false; {986#false} is VALID [2020-07-08 12:47:16,666 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-08 12:47:16,666 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795898659] [2020-07-08 12:47:16,666 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076012256] [2020-07-08 12:47:16,666 INFO L94 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-08 12:47:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:16,711 INFO L264 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-08 12:47:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:16,741 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:47:16,869 INFO L263 TraceCheckUtils]: 0: Hoare triple {985#true} call ULTIMATE.init(); {985#true} is VALID [2020-07-08 12:47:16,869 INFO L280 TraceCheckUtils]: 1: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-08 12:47:16,870 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {985#true} {985#true} #84#return; {985#true} is VALID [2020-07-08 12:47:16,870 INFO L263 TraceCheckUtils]: 3: Hoare triple {985#true} call #t~ret6 := main(); {985#true} is VALID [2020-07-08 12:47:16,871 INFO L280 TraceCheckUtils]: 4: Hoare triple {985#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {985#true} is VALID [2020-07-08 12:47:16,871 INFO L280 TraceCheckUtils]: 5: Hoare triple {985#true} assume !!(~n~0 < 1000000); {985#true} is VALID [2020-07-08 12:47:16,871 INFO L280 TraceCheckUtils]: 6: Hoare triple {985#true} assume ~k~0 == ~n~0; {985#true} is VALID [2020-07-08 12:47:16,872 INFO L280 TraceCheckUtils]: 7: Hoare triple {985#true} ~i~0 := 0; {985#true} is VALID [2020-07-08 12:47:16,872 INFO L280 TraceCheckUtils]: 8: Hoare triple {985#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {985#true} is VALID [2020-07-08 12:47:16,872 INFO L280 TraceCheckUtils]: 9: Hoare triple {985#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {985#true} is VALID [2020-07-08 12:47:16,873 INFO L280 TraceCheckUtils]: 10: Hoare triple {985#true} assume 0 != #t~nondet4;havoc #t~nondet4;~k~0 := ~j~0; {989#(<= main_~k~0 main_~j~0)} is VALID [2020-07-08 12:47:16,874 INFO L280 TraceCheckUtils]: 11: Hoare triple {989#(<= main_~k~0 main_~j~0)} assume !!(~k~0 < ~n~0); {989#(<= main_~k~0 main_~j~0)} is VALID [2020-07-08 12:47:16,874 INFO L263 TraceCheckUtils]: 12: Hoare triple {989#(<= main_~k~0 main_~j~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {985#true} is VALID [2020-07-08 12:47:16,874 INFO L280 TraceCheckUtils]: 13: Hoare triple {985#true} ~cond := #in~cond; {985#true} is VALID [2020-07-08 12:47:16,875 INFO L280 TraceCheckUtils]: 14: Hoare triple {985#true} assume !(0 == ~cond); {985#true} is VALID [2020-07-08 12:47:16,875 INFO L280 TraceCheckUtils]: 15: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-08 12:47:16,876 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {985#true} {989#(<= main_~k~0 main_~j~0)} #88#return; {989#(<= main_~k~0 main_~j~0)} is VALID [2020-07-08 12:47:16,877 INFO L280 TraceCheckUtils]: 17: Hoare triple {989#(<= main_~k~0 main_~j~0)} #t~post5 := ~k~0;~k~0 := 1 + #t~post5;havoc #t~post5; {994#(<= main_~k~0 (+ main_~j~0 1))} is VALID [2020-07-08 12:47:16,878 INFO L280 TraceCheckUtils]: 18: Hoare triple {994#(<= main_~k~0 (+ main_~j~0 1))} assume !(~k~0 < ~n~0); {1058#(<= main_~n~0 (+ main_~j~0 1))} is VALID [2020-07-08 12:47:16,880 INFO L280 TraceCheckUtils]: 19: Hoare triple {1058#(<= main_~n~0 (+ main_~j~0 1))} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1062#(<= main_~n~0 main_~j~0)} is VALID [2020-07-08 12:47:16,881 INFO L280 TraceCheckUtils]: 20: Hoare triple {1062#(<= main_~n~0 main_~j~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {986#false} is VALID [2020-07-08 12:47:16,881 INFO L280 TraceCheckUtils]: 21: Hoare triple {986#false} assume !(0 != #t~nondet4);havoc #t~nondet4; {986#false} is VALID [2020-07-08 12:47:16,882 INFO L263 TraceCheckUtils]: 22: Hoare triple {986#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {986#false} is VALID [2020-07-08 12:47:16,882 INFO L280 TraceCheckUtils]: 23: Hoare triple {986#false} ~cond := #in~cond; {986#false} is VALID [2020-07-08 12:47:16,882 INFO L280 TraceCheckUtils]: 24: Hoare triple {986#false} assume !(0 == ~cond); {986#false} is VALID [2020-07-08 12:47:16,883 INFO L280 TraceCheckUtils]: 25: Hoare triple {986#false} assume true; {986#false} is VALID [2020-07-08 12:47:16,883 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {986#false} {986#false} #90#return; {986#false} is VALID [2020-07-08 12:47:16,883 INFO L263 TraceCheckUtils]: 27: Hoare triple {986#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {986#false} is VALID [2020-07-08 12:47:16,883 INFO L280 TraceCheckUtils]: 28: Hoare triple {986#false} ~cond := #in~cond; {986#false} is VALID [2020-07-08 12:47:16,884 INFO L280 TraceCheckUtils]: 29: Hoare triple {986#false} assume 0 == ~cond; {986#false} is VALID [2020-07-08 12:47:16,884 INFO L280 TraceCheckUtils]: 30: Hoare triple {986#false} assume !false; {986#false} is VALID [2020-07-08 12:47:16,885 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-08 12:47:16,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:47:16,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-07-08 12:47:16,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531209063] [2020-07-08 12:47:16,887 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2020-07-08 12:47:16,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:16,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 12:47:16,931 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:16,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 12:47:16,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:16,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 12:47:16,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:47:16,932 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 8 states. [2020-07-08 12:47:17,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:17,147 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2020-07-08 12:47:17,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:47:17,147 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2020-07-08 12:47:17,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:17,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:47:17,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2020-07-08 12:47:17,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:47:17,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2020-07-08 12:47:17,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2020-07-08 12:47:17,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:17,236 INFO L225 Difference]: With dead ends: 80 [2020-07-08 12:47:17,237 INFO L226 Difference]: Without dead ends: 55 [2020-07-08 12:47:17,238 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:47:17,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-08 12:47:17,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2020-07-08 12:47:17,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:17,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 51 states. [2020-07-08 12:47:17,305 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 51 states. [2020-07-08 12:47:17,306 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 51 states. [2020-07-08 12:47:17,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:17,310 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2020-07-08 12:47:17,311 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2020-07-08 12:47:17,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:17,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:17,311 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 55 states. [2020-07-08 12:47:17,312 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 55 states. [2020-07-08 12:47:17,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:17,319 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2020-07-08 12:47:17,319 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2020-07-08 12:47:17,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:17,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:17,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:17,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:17,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-08 12:47:17,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2020-07-08 12:47:17,326 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 31 [2020-07-08 12:47:17,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:17,326 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2020-07-08 12:47:17,327 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 12:47:17,327 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2020-07-08 12:47:17,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-08 12:47:17,328 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:17,328 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:47:17,542 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:47:17,542 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:17,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:17,543 INFO L82 PathProgramCache]: Analyzing trace with hash 2099424040, now seen corresponding path program 1 times [2020-07-08 12:47:17,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:17,544 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145589993] [2020-07-08 12:47:17,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:17,640 INFO L280 TraceCheckUtils]: 0: Hoare triple {1396#true} assume true; {1396#true} is VALID [2020-07-08 12:47:17,641 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1396#true} {1396#true} #84#return; {1396#true} is VALID [2020-07-08 12:47:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:17,647 INFO L280 TraceCheckUtils]: 0: Hoare triple {1396#true} ~cond := #in~cond; {1396#true} is VALID [2020-07-08 12:47:17,648 INFO L280 TraceCheckUtils]: 1: Hoare triple {1396#true} assume !(0 == ~cond); {1396#true} is VALID [2020-07-08 12:47:17,648 INFO L280 TraceCheckUtils]: 2: Hoare triple {1396#true} assume true; {1396#true} is VALID [2020-07-08 12:47:17,649 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1396#true} {1402#(<= main_~k~0 main_~i~0)} #88#return; {1402#(<= main_~k~0 main_~i~0)} is VALID [2020-07-08 12:47:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:17,660 INFO L280 TraceCheckUtils]: 0: Hoare triple {1396#true} ~cond := #in~cond; {1396#true} is VALID [2020-07-08 12:47:17,660 INFO L280 TraceCheckUtils]: 1: Hoare triple {1396#true} assume !(0 == ~cond); {1396#true} is VALID [2020-07-08 12:47:17,660 INFO L280 TraceCheckUtils]: 2: Hoare triple {1396#true} assume true; {1396#true} is VALID [2020-07-08 12:47:17,661 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1396#true} {1397#false} #90#return; {1397#false} is VALID [2020-07-08 12:47:17,661 INFO L263 TraceCheckUtils]: 0: Hoare triple {1396#true} call ULTIMATE.init(); {1396#true} is VALID [2020-07-08 12:47:17,661 INFO L280 TraceCheckUtils]: 1: Hoare triple {1396#true} assume true; {1396#true} is VALID [2020-07-08 12:47:17,662 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1396#true} {1396#true} #84#return; {1396#true} is VALID [2020-07-08 12:47:17,662 INFO L263 TraceCheckUtils]: 3: Hoare triple {1396#true} call #t~ret6 := main(); {1396#true} is VALID [2020-07-08 12:47:17,662 INFO L280 TraceCheckUtils]: 4: Hoare triple {1396#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1396#true} is VALID [2020-07-08 12:47:17,662 INFO L280 TraceCheckUtils]: 5: Hoare triple {1396#true} assume !!(~n~0 < 1000000); {1396#true} is VALID [2020-07-08 12:47:17,663 INFO L280 TraceCheckUtils]: 6: Hoare triple {1396#true} assume ~k~0 == ~n~0; {1396#true} is VALID [2020-07-08 12:47:17,663 INFO L280 TraceCheckUtils]: 7: Hoare triple {1396#true} ~i~0 := 0; {1400#(<= main_~i~0 0)} is VALID [2020-07-08 12:47:17,664 INFO L280 TraceCheckUtils]: 8: Hoare triple {1400#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1401#(<= main_~j~0 main_~i~0)} is VALID [2020-07-08 12:47:17,665 INFO L280 TraceCheckUtils]: 9: Hoare triple {1401#(<= main_~j~0 main_~i~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1401#(<= main_~j~0 main_~i~0)} is VALID [2020-07-08 12:47:17,666 INFO L280 TraceCheckUtils]: 10: Hoare triple {1401#(<= main_~j~0 main_~i~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~k~0 := ~j~0; {1402#(<= main_~k~0 main_~i~0)} is VALID [2020-07-08 12:47:17,667 INFO L280 TraceCheckUtils]: 11: Hoare triple {1402#(<= main_~k~0 main_~i~0)} assume !!(~k~0 < ~n~0); {1402#(<= main_~k~0 main_~i~0)} is VALID [2020-07-08 12:47:17,667 INFO L263 TraceCheckUtils]: 12: Hoare triple {1402#(<= main_~k~0 main_~i~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {1396#true} is VALID [2020-07-08 12:47:17,667 INFO L280 TraceCheckUtils]: 13: Hoare triple {1396#true} ~cond := #in~cond; {1396#true} is VALID [2020-07-08 12:47:17,667 INFO L280 TraceCheckUtils]: 14: Hoare triple {1396#true} assume !(0 == ~cond); {1396#true} is VALID [2020-07-08 12:47:17,668 INFO L280 TraceCheckUtils]: 15: Hoare triple {1396#true} assume true; {1396#true} is VALID [2020-07-08 12:47:17,668 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1396#true} {1402#(<= main_~k~0 main_~i~0)} #88#return; {1402#(<= main_~k~0 main_~i~0)} is VALID [2020-07-08 12:47:17,669 INFO L280 TraceCheckUtils]: 17: Hoare triple {1402#(<= main_~k~0 main_~i~0)} #t~post5 := ~k~0;~k~0 := 1 + #t~post5;havoc #t~post5; {1407#(<= main_~k~0 (+ main_~i~0 1))} is VALID [2020-07-08 12:47:17,670 INFO L280 TraceCheckUtils]: 18: Hoare triple {1407#(<= main_~k~0 (+ main_~i~0 1))} assume !(~k~0 < ~n~0); {1408#(<= main_~n~0 (+ main_~i~0 1))} is VALID [2020-07-08 12:47:17,671 INFO L280 TraceCheckUtils]: 19: Hoare triple {1408#(<= main_~n~0 (+ main_~i~0 1))} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1408#(<= main_~n~0 (+ main_~i~0 1))} is VALID [2020-07-08 12:47:17,672 INFO L280 TraceCheckUtils]: 20: Hoare triple {1408#(<= main_~n~0 (+ main_~i~0 1))} assume !(~j~0 < ~n~0); {1408#(<= main_~n~0 (+ main_~i~0 1))} is VALID [2020-07-08 12:47:17,673 INFO L280 TraceCheckUtils]: 21: Hoare triple {1408#(<= main_~n~0 (+ main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1409#(<= main_~n~0 main_~i~0)} is VALID [2020-07-08 12:47:17,674 INFO L280 TraceCheckUtils]: 22: Hoare triple {1409#(<= main_~n~0 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1397#false} is VALID [2020-07-08 12:47:17,674 INFO L280 TraceCheckUtils]: 23: Hoare triple {1397#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1397#false} is VALID [2020-07-08 12:47:17,674 INFO L280 TraceCheckUtils]: 24: Hoare triple {1397#false} assume !(0 != #t~nondet4);havoc #t~nondet4; {1397#false} is VALID [2020-07-08 12:47:17,675 INFO L263 TraceCheckUtils]: 25: Hoare triple {1397#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {1396#true} is VALID [2020-07-08 12:47:17,675 INFO L280 TraceCheckUtils]: 26: Hoare triple {1396#true} ~cond := #in~cond; {1396#true} is VALID [2020-07-08 12:47:17,675 INFO L280 TraceCheckUtils]: 27: Hoare triple {1396#true} assume !(0 == ~cond); {1396#true} is VALID [2020-07-08 12:47:17,675 INFO L280 TraceCheckUtils]: 28: Hoare triple {1396#true} assume true; {1396#true} is VALID [2020-07-08 12:47:17,676 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1396#true} {1397#false} #90#return; {1397#false} is VALID [2020-07-08 12:47:17,676 INFO L263 TraceCheckUtils]: 30: Hoare triple {1397#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {1397#false} is VALID [2020-07-08 12:47:17,676 INFO L280 TraceCheckUtils]: 31: Hoare triple {1397#false} ~cond := #in~cond; {1397#false} is VALID [2020-07-08 12:47:17,676 INFO L280 TraceCheckUtils]: 32: Hoare triple {1397#false} assume 0 == ~cond; {1397#false} is VALID [2020-07-08 12:47:17,677 INFO L280 TraceCheckUtils]: 33: Hoare triple {1397#false} assume !false; {1397#false} is VALID [2020-07-08 12:47:17,678 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-08 12:47:17,678 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145589993] [2020-07-08 12:47:17,679 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588244195] [2020-07-08 12:47:17,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-08 12:47:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:17,708 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-08 12:47:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:17,718 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:47:17,957 INFO L263 TraceCheckUtils]: 0: Hoare triple {1396#true} call ULTIMATE.init(); {1396#true} is VALID [2020-07-08 12:47:17,957 INFO L280 TraceCheckUtils]: 1: Hoare triple {1396#true} assume true; {1396#true} is VALID [2020-07-08 12:47:17,957 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1396#true} {1396#true} #84#return; {1396#true} is VALID [2020-07-08 12:47:17,958 INFO L263 TraceCheckUtils]: 3: Hoare triple {1396#true} call #t~ret6 := main(); {1396#true} is VALID [2020-07-08 12:47:17,958 INFO L280 TraceCheckUtils]: 4: Hoare triple {1396#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1396#true} is VALID [2020-07-08 12:47:17,958 INFO L280 TraceCheckUtils]: 5: Hoare triple {1396#true} assume !!(~n~0 < 1000000); {1396#true} is VALID [2020-07-08 12:47:17,958 INFO L280 TraceCheckUtils]: 6: Hoare triple {1396#true} assume ~k~0 == ~n~0; {1396#true} is VALID [2020-07-08 12:47:17,959 INFO L280 TraceCheckUtils]: 7: Hoare triple {1396#true} ~i~0 := 0; {1400#(<= main_~i~0 0)} is VALID [2020-07-08 12:47:17,959 INFO L280 TraceCheckUtils]: 8: Hoare triple {1400#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1441#(and (<= main_~i~0 0) (<= main_~j~0 (* 2 main_~i~0)))} is VALID [2020-07-08 12:47:17,965 INFO L280 TraceCheckUtils]: 9: Hoare triple {1441#(and (<= main_~i~0 0) (<= main_~j~0 (* 2 main_~i~0)))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1441#(and (<= main_~i~0 0) (<= main_~j~0 (* 2 main_~i~0)))} is VALID [2020-07-08 12:47:17,966 INFO L280 TraceCheckUtils]: 10: Hoare triple {1441#(and (<= main_~i~0 0) (<= main_~j~0 (* 2 main_~i~0)))} assume 0 != #t~nondet4;havoc #t~nondet4;~k~0 := ~j~0; {1448#(and (<= main_~i~0 0) (<= main_~k~0 (* 2 main_~i~0)))} is VALID [2020-07-08 12:47:17,967 INFO L280 TraceCheckUtils]: 11: Hoare triple {1448#(and (<= main_~i~0 0) (<= main_~k~0 (* 2 main_~i~0)))} assume !!(~k~0 < ~n~0); {1448#(and (<= main_~i~0 0) (<= main_~k~0 (* 2 main_~i~0)))} is VALID [2020-07-08 12:47:17,967 INFO L263 TraceCheckUtils]: 12: Hoare triple {1448#(and (<= main_~i~0 0) (<= main_~k~0 (* 2 main_~i~0)))} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {1396#true} is VALID [2020-07-08 12:47:17,968 INFO L280 TraceCheckUtils]: 13: Hoare triple {1396#true} ~cond := #in~cond; {1396#true} is VALID [2020-07-08 12:47:17,968 INFO L280 TraceCheckUtils]: 14: Hoare triple {1396#true} assume !(0 == ~cond); {1396#true} is VALID [2020-07-08 12:47:17,968 INFO L280 TraceCheckUtils]: 15: Hoare triple {1396#true} assume true; {1396#true} is VALID [2020-07-08 12:47:17,969 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1396#true} {1448#(and (<= main_~i~0 0) (<= main_~k~0 (* 2 main_~i~0)))} #88#return; {1448#(and (<= main_~i~0 0) (<= main_~k~0 (* 2 main_~i~0)))} is VALID [2020-07-08 12:47:17,970 INFO L280 TraceCheckUtils]: 17: Hoare triple {1448#(and (<= main_~i~0 0) (<= main_~k~0 (* 2 main_~i~0)))} #t~post5 := ~k~0;~k~0 := 1 + #t~post5;havoc #t~post5; {1470#(and (<= main_~i~0 0) (<= main_~k~0 (+ (* 2 main_~i~0) 1)))} is VALID [2020-07-08 12:47:17,971 INFO L280 TraceCheckUtils]: 18: Hoare triple {1470#(and (<= main_~i~0 0) (<= main_~k~0 (+ (* 2 main_~i~0) 1)))} assume !(~k~0 < ~n~0); {1474#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* 2 main_~i~0) 1)))} is VALID [2020-07-08 12:47:17,972 INFO L280 TraceCheckUtils]: 19: Hoare triple {1474#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* 2 main_~i~0) 1)))} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1474#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* 2 main_~i~0) 1)))} is VALID [2020-07-08 12:47:17,973 INFO L280 TraceCheckUtils]: 20: Hoare triple {1474#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* 2 main_~i~0) 1)))} assume !(~j~0 < ~n~0); {1474#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* 2 main_~i~0) 1)))} is VALID [2020-07-08 12:47:17,974 INFO L280 TraceCheckUtils]: 21: Hoare triple {1474#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* 2 main_~i~0) 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1484#(and (<= (div (+ (* main_~n~0 (- 1)) 1) (- 2)) 0) (<= (+ (div (+ (* main_~n~0 (- 1)) 1) (- 2)) 1) main_~i~0))} is VALID [2020-07-08 12:47:17,975 INFO L280 TraceCheckUtils]: 22: Hoare triple {1484#(and (<= (div (+ (* main_~n~0 (- 1)) 1) (- 2)) 0) (<= (+ (div (+ (* main_~n~0 (- 1)) 1) (- 2)) 1) main_~i~0))} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1397#false} is VALID [2020-07-08 12:47:17,976 INFO L280 TraceCheckUtils]: 23: Hoare triple {1397#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1397#false} is VALID [2020-07-08 12:47:17,976 INFO L280 TraceCheckUtils]: 24: Hoare triple {1397#false} assume !(0 != #t~nondet4);havoc #t~nondet4; {1397#false} is VALID [2020-07-08 12:47:17,976 INFO L263 TraceCheckUtils]: 25: Hoare triple {1397#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {1397#false} is VALID [2020-07-08 12:47:17,976 INFO L280 TraceCheckUtils]: 26: Hoare triple {1397#false} ~cond := #in~cond; {1397#false} is VALID [2020-07-08 12:47:17,977 INFO L280 TraceCheckUtils]: 27: Hoare triple {1397#false} assume !(0 == ~cond); {1397#false} is VALID [2020-07-08 12:47:17,977 INFO L280 TraceCheckUtils]: 28: Hoare triple {1397#false} assume true; {1397#false} is VALID [2020-07-08 12:47:17,977 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1397#false} {1397#false} #90#return; {1397#false} is VALID [2020-07-08 12:47:17,978 INFO L263 TraceCheckUtils]: 30: Hoare triple {1397#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {1397#false} is VALID [2020-07-08 12:47:17,978 INFO L280 TraceCheckUtils]: 31: Hoare triple {1397#false} ~cond := #in~cond; {1397#false} is VALID [2020-07-08 12:47:17,978 INFO L280 TraceCheckUtils]: 32: Hoare triple {1397#false} assume 0 == ~cond; {1397#false} is VALID [2020-07-08 12:47:17,979 INFO L280 TraceCheckUtils]: 33: Hoare triple {1397#false} assume !false; {1397#false} is VALID [2020-07-08 12:47:17,982 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-08 12:47:17,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:47:17,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-07-08 12:47:17,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151345976] [2020-07-08 12:47:17,984 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-07-08 12:47:17,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:17,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-08 12:47:18,029 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:18,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-08 12:47:18,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:18,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-08 12:47:18,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-07-08 12:47:18,031 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 13 states. [2020-07-08 12:47:18,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:18,804 INFO L93 Difference]: Finished difference Result 120 states and 153 transitions. [2020-07-08 12:47:18,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 12:47:18,805 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-07-08 12:47:18,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:18,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 12:47:18,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2020-07-08 12:47:18,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 12:47:18,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2020-07-08 12:47:18,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 92 transitions. [2020-07-08 12:47:18,946 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:18,949 INFO L225 Difference]: With dead ends: 120 [2020-07-08 12:47:18,949 INFO L226 Difference]: Without dead ends: 86 [2020-07-08 12:47:18,950 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2020-07-08 12:47:18,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-07-08 12:47:19,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2020-07-08 12:47:19,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:19,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 56 states. [2020-07-08 12:47:19,013 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 56 states. [2020-07-08 12:47:19,013 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 56 states. [2020-07-08 12:47:19,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:19,018 INFO L93 Difference]: Finished difference Result 86 states and 113 transitions. [2020-07-08 12:47:19,018 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 113 transitions. [2020-07-08 12:47:19,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:19,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:19,019 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 86 states. [2020-07-08 12:47:19,019 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 86 states. [2020-07-08 12:47:19,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:19,024 INFO L93 Difference]: Finished difference Result 86 states and 113 transitions. [2020-07-08 12:47:19,024 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 113 transitions. [2020-07-08 12:47:19,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:19,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:19,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:19,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:19,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-08 12:47:19,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2020-07-08 12:47:19,028 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 34 [2020-07-08 12:47:19,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:19,029 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2020-07-08 12:47:19,029 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-08 12:47:19,029 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2020-07-08 12:47:19,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-08 12:47:19,030 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:19,030 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:47:19,237 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:47:19,238 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:19,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:19,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1702845076, now seen corresponding path program 2 times [2020-07-08 12:47:19,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:19,239 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818099120] [2020-07-08 12:47:19,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:19,313 INFO L280 TraceCheckUtils]: 0: Hoare triple {1964#true} assume true; {1964#true} is VALID [2020-07-08 12:47:19,314 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1964#true} {1964#true} #84#return; {1964#true} is VALID [2020-07-08 12:47:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:19,318 INFO L280 TraceCheckUtils]: 0: Hoare triple {1964#true} ~cond := #in~cond; {1964#true} is VALID [2020-07-08 12:47:19,319 INFO L280 TraceCheckUtils]: 1: Hoare triple {1964#true} assume !(0 == ~cond); {1964#true} is VALID [2020-07-08 12:47:19,319 INFO L280 TraceCheckUtils]: 2: Hoare triple {1964#true} assume true; {1964#true} is VALID [2020-07-08 12:47:19,319 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1964#true} {1964#true} #88#return; {1964#true} is VALID [2020-07-08 12:47:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:19,325 INFO L280 TraceCheckUtils]: 0: Hoare triple {1964#true} ~cond := #in~cond; {1964#true} is VALID [2020-07-08 12:47:19,326 INFO L280 TraceCheckUtils]: 1: Hoare triple {1964#true} assume !(0 == ~cond); {1964#true} is VALID [2020-07-08 12:47:19,326 INFO L280 TraceCheckUtils]: 2: Hoare triple {1964#true} assume true; {1964#true} is VALID [2020-07-08 12:47:19,327 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1964#true} {1972#(<= (+ main_~k~0 1) main_~n~0)} #88#return; {1972#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2020-07-08 12:47:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:19,332 INFO L280 TraceCheckUtils]: 0: Hoare triple {1964#true} ~cond := #in~cond; {1964#true} is VALID [2020-07-08 12:47:19,333 INFO L280 TraceCheckUtils]: 1: Hoare triple {1964#true} assume !(0 == ~cond); {1964#true} is VALID [2020-07-08 12:47:19,333 INFO L280 TraceCheckUtils]: 2: Hoare triple {1964#true} assume true; {1964#true} is VALID [2020-07-08 12:47:19,334 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1964#true} {1977#(<= main_~k~0 main_~n~0)} #90#return; {1977#(<= main_~k~0 main_~n~0)} is VALID [2020-07-08 12:47:19,334 INFO L263 TraceCheckUtils]: 0: Hoare triple {1964#true} call ULTIMATE.init(); {1964#true} is VALID [2020-07-08 12:47:19,335 INFO L280 TraceCheckUtils]: 1: Hoare triple {1964#true} assume true; {1964#true} is VALID [2020-07-08 12:47:19,335 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1964#true} {1964#true} #84#return; {1964#true} is VALID [2020-07-08 12:47:19,335 INFO L263 TraceCheckUtils]: 3: Hoare triple {1964#true} call #t~ret6 := main(); {1964#true} is VALID [2020-07-08 12:47:19,335 INFO L280 TraceCheckUtils]: 4: Hoare triple {1964#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1964#true} is VALID [2020-07-08 12:47:19,336 INFO L280 TraceCheckUtils]: 5: Hoare triple {1964#true} assume !!(~n~0 < 1000000); {1964#true} is VALID [2020-07-08 12:47:19,336 INFO L280 TraceCheckUtils]: 6: Hoare triple {1964#true} assume ~k~0 == ~n~0; {1964#true} is VALID [2020-07-08 12:47:19,336 INFO L280 TraceCheckUtils]: 7: Hoare triple {1964#true} ~i~0 := 0; {1964#true} is VALID [2020-07-08 12:47:19,336 INFO L280 TraceCheckUtils]: 8: Hoare triple {1964#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1964#true} is VALID [2020-07-08 12:47:19,336 INFO L280 TraceCheckUtils]: 9: Hoare triple {1964#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1964#true} is VALID [2020-07-08 12:47:19,337 INFO L280 TraceCheckUtils]: 10: Hoare triple {1964#true} assume 0 != #t~nondet4;havoc #t~nondet4;~k~0 := ~j~0; {1964#true} is VALID [2020-07-08 12:47:19,337 INFO L280 TraceCheckUtils]: 11: Hoare triple {1964#true} assume !!(~k~0 < ~n~0); {1964#true} is VALID [2020-07-08 12:47:19,337 INFO L263 TraceCheckUtils]: 12: Hoare triple {1964#true} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {1964#true} is VALID [2020-07-08 12:47:19,337 INFO L280 TraceCheckUtils]: 13: Hoare triple {1964#true} ~cond := #in~cond; {1964#true} is VALID [2020-07-08 12:47:19,338 INFO L280 TraceCheckUtils]: 14: Hoare triple {1964#true} assume !(0 == ~cond); {1964#true} is VALID [2020-07-08 12:47:19,338 INFO L280 TraceCheckUtils]: 15: Hoare triple {1964#true} assume true; {1964#true} is VALID [2020-07-08 12:47:19,338 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1964#true} {1964#true} #88#return; {1964#true} is VALID [2020-07-08 12:47:19,338 INFO L280 TraceCheckUtils]: 17: Hoare triple {1964#true} #t~post5 := ~k~0;~k~0 := 1 + #t~post5;havoc #t~post5; {1964#true} is VALID [2020-07-08 12:47:19,339 INFO L280 TraceCheckUtils]: 18: Hoare triple {1964#true} assume !!(~k~0 < ~n~0); {1972#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2020-07-08 12:47:19,339 INFO L263 TraceCheckUtils]: 19: Hoare triple {1972#(<= (+ main_~k~0 1) main_~n~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {1964#true} is VALID [2020-07-08 12:47:19,340 INFO L280 TraceCheckUtils]: 20: Hoare triple {1964#true} ~cond := #in~cond; {1964#true} is VALID [2020-07-08 12:47:19,340 INFO L280 TraceCheckUtils]: 21: Hoare triple {1964#true} assume !(0 == ~cond); {1964#true} is VALID [2020-07-08 12:47:19,340 INFO L280 TraceCheckUtils]: 22: Hoare triple {1964#true} assume true; {1964#true} is VALID [2020-07-08 12:47:19,341 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1964#true} {1972#(<= (+ main_~k~0 1) main_~n~0)} #88#return; {1972#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2020-07-08 12:47:19,342 INFO L280 TraceCheckUtils]: 24: Hoare triple {1972#(<= (+ main_~k~0 1) main_~n~0)} #t~post5 := ~k~0;~k~0 := 1 + #t~post5;havoc #t~post5; {1977#(<= main_~k~0 main_~n~0)} is VALID [2020-07-08 12:47:19,342 INFO L280 TraceCheckUtils]: 25: Hoare triple {1977#(<= main_~k~0 main_~n~0)} assume !(~k~0 < ~n~0); {1977#(<= main_~k~0 main_~n~0)} is VALID [2020-07-08 12:47:19,343 INFO L280 TraceCheckUtils]: 26: Hoare triple {1977#(<= main_~k~0 main_~n~0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1977#(<= main_~k~0 main_~n~0)} is VALID [2020-07-08 12:47:19,344 INFO L280 TraceCheckUtils]: 27: Hoare triple {1977#(<= main_~k~0 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1977#(<= main_~k~0 main_~n~0)} is VALID [2020-07-08 12:47:19,344 INFO L280 TraceCheckUtils]: 28: Hoare triple {1977#(<= main_~k~0 main_~n~0)} assume !(0 != #t~nondet4);havoc #t~nondet4; {1977#(<= main_~k~0 main_~n~0)} is VALID [2020-07-08 12:47:19,344 INFO L263 TraceCheckUtils]: 29: Hoare triple {1977#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {1964#true} is VALID [2020-07-08 12:47:19,345 INFO L280 TraceCheckUtils]: 30: Hoare triple {1964#true} ~cond := #in~cond; {1964#true} is VALID [2020-07-08 12:47:19,345 INFO L280 TraceCheckUtils]: 31: Hoare triple {1964#true} assume !(0 == ~cond); {1964#true} is VALID [2020-07-08 12:47:19,345 INFO L280 TraceCheckUtils]: 32: Hoare triple {1964#true} assume true; {1964#true} is VALID [2020-07-08 12:47:19,346 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1964#true} {1977#(<= main_~k~0 main_~n~0)} #90#return; {1977#(<= main_~k~0 main_~n~0)} is VALID [2020-07-08 12:47:19,347 INFO L263 TraceCheckUtils]: 34: Hoare triple {1977#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {1982#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:47:19,347 INFO L280 TraceCheckUtils]: 35: Hoare triple {1982#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1983#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:47:19,348 INFO L280 TraceCheckUtils]: 36: Hoare triple {1983#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1965#false} is VALID [2020-07-08 12:47:19,348 INFO L280 TraceCheckUtils]: 37: Hoare triple {1965#false} assume !false; {1965#false} is VALID [2020-07-08 12:47:19,350 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-08 12:47:19,350 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818099120] [2020-07-08 12:47:19,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:47:19,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:47:19,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646826322] [2020-07-08 12:47:19,351 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-07-08 12:47:19,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:19,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:47:19,384 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-08 12:47:19,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:47:19,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:19,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:47:19,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:47:19,385 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 6 states. [2020-07-08 12:47:19,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:19,624 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2020-07-08 12:47:19,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:47:19,624 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-07-08 12:47:19,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:19,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:47:19,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2020-07-08 12:47:19,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:47:19,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2020-07-08 12:47:19,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 33 transitions. [2020-07-08 12:47:19,668 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:19,669 INFO L225 Difference]: With dead ends: 56 [2020-07-08 12:47:19,669 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 12:47:19,670 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:47:19,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 12:47:19,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 12:47:19,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:19,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 12:47:19,671 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:47:19,671 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:47:19,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:19,671 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:47:19,672 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:47:19,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:19,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:19,672 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:47:19,672 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:47:19,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:19,672 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:47:19,673 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:47:19,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:19,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:19,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:19,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:19,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 12:47:19,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 12:47:19,674 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2020-07-08 12:47:19,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:19,674 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 12:47:19,674 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:47:19,674 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:47:19,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:19,675 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-08 12:47:19,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 12:47:20,189 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 12:47:20,189 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:47:20,189 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:47:20,189 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 12:47:20,189 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 12:47:20,190 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:47:20,190 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-08 12:47:20,190 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-08 12:47:20,190 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-07-08 12:47:20,191 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-08 12:47:20,191 INFO L268 CegarLoopResult]: For program point L31(lines 23 33) no Hoare annotation was computed. [2020-07-08 12:47:20,191 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 37) no Hoare annotation was computed. [2020-07-08 12:47:20,191 INFO L264 CegarLoopResult]: At program point L23-2(lines 23 33) the Hoare annotation is: (let ((.cse2 (* 2 main_~i~0))) (let ((.cse0 (<= main_~n~0 main_~k~0)) (.cse1 (<= .cse2 main_~j~0))) (or (and (<= main_~k~0 main_~n~0) .cse0 .cse1) (and (<= main_~i~0 0) (<= main_~k~0 (+ .cse2 1)) (<= main_~k~0 main_~j~0) .cse0 .cse1)))) [2020-07-08 12:47:20,191 INFO L268 CegarLoopResult]: For program point L24(lines 24 32) no Hoare annotation was computed. [2020-07-08 12:47:20,192 INFO L264 CegarLoopResult]: At program point L25-2(lines 25 27) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (<= (+ main_~j~0 1) main_~n~0) (<= .cse0 main_~k~0) (<= main_~k~0 main_~n~0) (<= .cse0 main_~j~0))) [2020-07-08 12:47:20,192 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-08 12:47:20,192 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 37) no Hoare annotation was computed. [2020-07-08 12:47:20,192 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (and (<= (+ main_~j~0 1) main_~n~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0) (<= (* 2 main_~i~0) main_~j~0)) [2020-07-08 12:47:20,192 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 37) the Hoare annotation is: true [2020-07-08 12:47:20,193 INFO L264 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (and (<= (+ main_~j~0 1) main_~n~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0) (<= (* 2 main_~i~0) main_~j~0)) [2020-07-08 12:47:20,193 INFO L264 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (<= (+ main_~j~0 1) main_~n~0) (<= (+ main_~k~0 1) main_~n~0) (<= .cse0 main_~k~0) (<= .cse0 main_~j~0))) [2020-07-08 12:47:20,193 INFO L268 CegarLoopResult]: For program point L26-1(lines 25 27) no Hoare annotation was computed. [2020-07-08 12:47:20,193 INFO L268 CegarLoopResult]: For program point L22-2(lines 22 34) no Hoare annotation was computed. [2020-07-08 12:47:20,193 INFO L264 CegarLoopResult]: At program point L22-3(lines 22 34) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 main_~n~0)) (.cse1 (<= main_~n~0 main_~k~0)) (.cse3 (<= main_~n~0 main_~j~0))) (or (and (<= main_~i~0 0) .cse0 .cse1) (let ((.cse2 (div (+ (* main_~n~0 (- 1)) 1) (- 2)))) (and (<= .cse2 0) (<= (+ .cse2 1) main_~i~0) (<= main_~k~0 main_~i~0) .cse1 .cse3)) (and .cse0 .cse1 .cse3))) [2020-07-08 12:47:20,194 INFO L268 CegarLoopResult]: For program point L18(lines 18 21) no Hoare annotation was computed. [2020-07-08 12:47:20,194 INFO L268 CegarLoopResult]: For program point L18-1(lines 18 21) no Hoare annotation was computed. [2020-07-08 12:47:20,194 INFO L271 CegarLoopResult]: At program point L35(lines 13 37) the Hoare annotation is: true [2020-07-08 12:47:20,194 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-08 12:47:20,194 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-07-08 12:47:20,194 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-08 12:47:20,194 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-08 12:47:20,195 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-07-08 12:47:20,197 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-08 12:47:20,202 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:47:20,202 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 12:47:20,203 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-08 12:47:20,203 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-08 12:47:20,203 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:47:20,203 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:47:20,203 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 12:47:20,203 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 12:47:20,203 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-08 12:47:20,204 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-08 12:47:20,204 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-08 12:47:20,205 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-08 12:47:20,205 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:47:20,206 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-08 12:47:20,206 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:47:20,206 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-08 12:47:20,206 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-08 12:47:20,206 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-08 12:47:20,206 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-08 12:47:20,206 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-08 12:47:20,206 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:47:20,207 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2020-07-08 12:47:20,207 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:47:20,208 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:47:20,208 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:47:20,208 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:47:20,210 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-08 12:47:20,210 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-08 12:47:20,210 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-08 12:47:20,211 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2020-07-08 12:47:20,211 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2020-07-08 12:47:20,211 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-08 12:47:20,211 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-08 12:47:20,211 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-08 12:47:20,212 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2020-07-08 12:47:20,212 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-08 12:47:20,212 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-08 12:47:20,213 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-08 12:47:20,213 INFO L163 areAnnotationChecker]: CFG has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 12:47:20,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:47:20 BoogieIcfgContainer [2020-07-08 12:47:20,243 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:47:20,248 INFO L168 Benchmark]: Toolchain (without parser) took 7440.47 ms. Allocated memory was 136.8 MB in the beginning and 293.1 MB in the end (delta: 156.2 MB). Free memory was 100.7 MB in the beginning and 94.1 MB in the end (delta: 6.5 MB). Peak memory consumption was 162.8 MB. Max. memory is 7.1 GB. [2020-07-08 12:47:20,249 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 136.8 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-07-08 12:47:20,249 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.04 ms. Allocated memory is still 136.8 MB. Free memory was 100.5 MB in the beginning and 90.5 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-08 12:47:20,250 INFO L168 Benchmark]: Boogie Preprocessor took 38.06 ms. Allocated memory is still 136.8 MB. Free memory was 90.5 MB in the beginning and 89.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2020-07-08 12:47:20,252 INFO L168 Benchmark]: RCFGBuilder took 563.96 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 89.0 MB in the beginning and 157.7 MB in the end (delta: -68.8 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-07-08 12:47:20,256 INFO L168 Benchmark]: TraceAbstraction took 6574.04 ms. Allocated memory was 200.8 MB in the beginning and 293.1 MB in the end (delta: 92.3 MB). Free memory was 157.0 MB in the beginning and 94.1 MB in the end (delta: 62.9 MB). Peak memory consumption was 155.2 MB. Max. memory is 7.1 GB. [2020-07-08 12:47:20,262 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.27 ms. Allocated memory is still 136.8 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 258.04 ms. Allocated memory is still 136.8 MB. Free memory was 100.5 MB in the beginning and 90.5 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.06 ms. Allocated memory is still 136.8 MB. Free memory was 90.5 MB in the beginning and 89.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 563.96 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 89.0 MB in the beginning and 157.7 MB in the end (delta: -68.8 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6574.04 ms. Allocated memory was 200.8 MB in the beginning and 293.1 MB in the end (delta: 92.3 MB). Free memory was 157.0 MB in the beginning and 94.1 MB in the end (delta: 62.9 MB). Peak memory consumption was 155.2 MB. Max. memory is 7.1 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: 25]: Loop Invariant Derived loop invariant: ((j + 1 <= n && 2 * i <= k) && k <= n) && 2 * i <= j - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((i <= 0 && k <= n) && n <= k) || (((((n * -1 + 1) / -2 <= 0 && (n * -1 + 1) / -2 + 1 <= i) && k <= i) && n <= k) && n <= j)) || ((k <= n && n <= k) && n <= j) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((k <= n && n <= k) && 2 * i <= j) || ((((i <= 0 && k <= 2 * i + 1) && k <= j) && n <= k) && 2 * i <= j) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.9s, OverallIterations: 7, TraceHistogramMax: 4, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 186 SDtfs, 97 SDslu, 495 SDs, 0 SdLazy, 383 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 56 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 33 PreInvPairs, 56 NumberOfFragments, 166 HoareAnnotationTreeSize, 33 FomulaSimplifications, 1795 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 452 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 234 ConstructedInterpolants, 0 QuantifiedInterpolants, 14394 SizeOfPredicates, 7 NumberOfNonLiveVariables, 146 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 73/81 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...