/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/nested6.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:48:45,618 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:48:45,621 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:48:45,639 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:48:45,640 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:48:45,642 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:48:45,644 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:48:45,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:48:45,659 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:48:45,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:48:45,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:48:45,664 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:48:45,664 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:48:45,667 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:48:45,668 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:48:45,669 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:48:45,670 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:48:45,670 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:48:45,672 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:48:45,674 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:48:45,675 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:48:45,676 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:48:45,677 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:48:45,678 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:48:45,680 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:48:45,680 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:48:45,680 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:48:45,681 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:48:45,681 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:48:45,682 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:48:45,683 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:48:45,683 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:48:45,684 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:48:45,685 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:48:45,686 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:48:45,686 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:48:45,687 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:48:45,687 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:48:45,687 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:48:45,688 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:48:45,689 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:48:45,689 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:48:45,698 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:48:45,699 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:48:45,700 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:48:45,700 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:48:45,700 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:48:45,701 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:48:45,701 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:48:45,701 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:48:45,701 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:48:45,701 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:48:45,701 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:48:45,702 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:48:45,702 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:48:45,702 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:48:45,702 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:48:45,702 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:48:45,703 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:48:45,703 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:48:45,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:48:45,703 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:48:45,703 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:48:45,704 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:48:45,704 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:48:45,965 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:48:45,977 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:48:45,981 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:48:45,982 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:48:45,983 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:48:45,983 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-18 00:48:46,057 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef5342ca8/80c0bdd7f76f4e259b55c70c4dd86633/FLAG2205953a6 [2020-07-18 00:48:46,533 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:48:46,534 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6.i [2020-07-18 00:48:46,540 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef5342ca8/80c0bdd7f76f4e259b55c70c4dd86633/FLAG2205953a6 [2020-07-18 00:48:46,877 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef5342ca8/80c0bdd7f76f4e259b55c70c4dd86633 [2020-07-18 00:48:46,889 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:48:46,892 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:48:46,893 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:48:46,893 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:48:46,897 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:48:46,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:48:46" (1/1) ... [2020-07-18 00:48:46,902 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b6adb55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:46, skipping insertion in model container [2020-07-18 00:48:46,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:48:46" (1/1) ... [2020-07-18 00:48:46,909 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:48:46,934 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:48:47,153 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:48:47,158 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:48:47,178 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:48:47,194 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:48:47,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:47 WrapperNode [2020-07-18 00:48:47,194 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:48:47,195 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:48:47,195 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:48:47,195 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:48:47,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:47" (1/1) ... [2020-07-18 00:48:47,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:47" (1/1) ... [2020-07-18 00:48:47,216 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:47" (1/1) ... [2020-07-18 00:48:47,217 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:47" (1/1) ... [2020-07-18 00:48:47,223 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:47" (1/1) ... [2020-07-18 00:48:47,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:47" (1/1) ... [2020-07-18 00:48:47,232 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:47" (1/1) ... [2020-07-18 00:48:47,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:48:47,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:48:47,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:48:47,235 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:48:47,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:47" (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-18 00:48:47,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:48:47,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:48:47,413 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-18 00:48:47,413 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 00:48:47,413 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:48:47,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:48:47,413 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 00:48:47,414 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-18 00:48:47,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 00:48:47,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:48:47,414 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:48:47,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:48:47,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:48:47,878 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:48:47,878 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-18 00:48:47,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:48:47 BoogieIcfgContainer [2020-07-18 00:48:47,885 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:48:47,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:48:47,886 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:48:47,890 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:48:47,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:48:46" (1/3) ... [2020-07-18 00:48:47,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9fb5f06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:48:47, skipping insertion in model container [2020-07-18 00:48:47,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:47" (2/3) ... [2020-07-18 00:48:47,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9fb5f06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:48:47, skipping insertion in model container [2020-07-18 00:48:47,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:48:47" (3/3) ... [2020-07-18 00:48:47,899 INFO L109 eAbstractionObserver]: Analyzing ICFG nested6.i [2020-07-18 00:48:47,907 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:48:47,913 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:48:47,927 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:48:47,949 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:48:47,950 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:48:47,950 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:48:47,950 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:48:47,950 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:48:47,950 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:48:47,951 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:48:47,951 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:48:47,967 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2020-07-18 00:48:47,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-18 00:48:47,979 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:47,980 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 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-18 00:48:47,980 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:47,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:47,987 INFO L82 PathProgramCache]: Analyzing trace with hash 2127483765, now seen corresponding path program 1 times [2020-07-18 00:48:47,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:48,000 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1711812201] [2020-07-18 00:48:48,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:48,292 INFO L280 TraceCheckUtils]: 0: Hoare triple {53#true} assume true; {53#true} is VALID [2020-07-18 00:48:48,293 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {53#true} {53#true} #106#return; {53#true} is VALID [2020-07-18 00:48:48,295 INFO L263 TraceCheckUtils]: 0: Hoare triple {53#true} call ULTIMATE.init(); {53#true} is VALID [2020-07-18 00:48:48,296 INFO L280 TraceCheckUtils]: 1: Hoare triple {53#true} assume true; {53#true} is VALID [2020-07-18 00:48:48,296 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {53#true} {53#true} #106#return; {53#true} is VALID [2020-07-18 00:48:48,296 INFO L263 TraceCheckUtils]: 3: Hoare triple {53#true} call #t~ret6 := main(); {53#true} is VALID [2020-07-18 00:48:48,297 INFO L280 TraceCheckUtils]: 4: Hoare triple {53#true} havoc ~i~0; {53#true} is VALID [2020-07-18 00:48:48,297 INFO L280 TraceCheckUtils]: 5: Hoare triple {53#true} havoc ~j~0; {53#true} is VALID [2020-07-18 00:48:48,298 INFO L280 TraceCheckUtils]: 6: Hoare triple {53#true} havoc ~k~0; {53#true} is VALID [2020-07-18 00:48:48,298 INFO L280 TraceCheckUtils]: 7: Hoare triple {53#true} havoc ~n~0; {53#true} is VALID [2020-07-18 00:48:48,299 INFO L280 TraceCheckUtils]: 8: Hoare triple {53#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {53#true} is VALID [2020-07-18 00:48:48,299 INFO L280 TraceCheckUtils]: 9: Hoare triple {53#true} ~k~0 := #t~nondet0; {53#true} is VALID [2020-07-18 00:48:48,300 INFO L280 TraceCheckUtils]: 10: Hoare triple {53#true} havoc #t~nondet0; {53#true} is VALID [2020-07-18 00:48:48,300 INFO L280 TraceCheckUtils]: 11: Hoare triple {53#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {53#true} is VALID [2020-07-18 00:48:48,301 INFO L280 TraceCheckUtils]: 12: Hoare triple {53#true} ~n~0 := #t~nondet1; {53#true} is VALID [2020-07-18 00:48:48,301 INFO L280 TraceCheckUtils]: 13: Hoare triple {53#true} havoc #t~nondet1; {53#true} is VALID [2020-07-18 00:48:48,302 INFO L280 TraceCheckUtils]: 14: Hoare triple {53#true} assume !!(~n~0 < 1000000); {53#true} is VALID [2020-07-18 00:48:48,303 INFO L280 TraceCheckUtils]: 15: Hoare triple {53#true} assume ~k~0 == ~n~0; {57#(<= main_~n~0 main_~k~0)} is VALID [2020-07-18 00:48:48,304 INFO L280 TraceCheckUtils]: 16: Hoare triple {57#(<= main_~n~0 main_~k~0)} ~i~0 := 0; {57#(<= main_~n~0 main_~k~0)} is VALID [2020-07-18 00:48:48,306 INFO L280 TraceCheckUtils]: 17: Hoare triple {57#(<= main_~n~0 main_~k~0)} assume !!(~i~0 < ~n~0); {57#(<= main_~n~0 main_~k~0)} is VALID [2020-07-18 00:48:48,308 INFO L280 TraceCheckUtils]: 18: Hoare triple {57#(<= main_~n~0 main_~k~0)} ~j~0 := 2 * ~i~0; {57#(<= main_~n~0 main_~k~0)} is VALID [2020-07-18 00:48:48,309 INFO L280 TraceCheckUtils]: 19: Hoare triple {57#(<= main_~n~0 main_~k~0)} assume !!(~j~0 < ~n~0); {57#(<= main_~n~0 main_~k~0)} is VALID [2020-07-18 00:48:48,310 INFO L280 TraceCheckUtils]: 20: Hoare triple {57#(<= main_~n~0 main_~k~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {57#(<= main_~n~0 main_~k~0)} is VALID [2020-07-18 00:48:48,311 INFO L280 TraceCheckUtils]: 21: Hoare triple {57#(<= main_~n~0 main_~k~0)} assume !(0 != #t~nondet4); {57#(<= main_~n~0 main_~k~0)} is VALID [2020-07-18 00:48:48,312 INFO L280 TraceCheckUtils]: 22: Hoare triple {57#(<= main_~n~0 main_~k~0)} havoc #t~nondet4; {57#(<= main_~n~0 main_~k~0)} is VALID [2020-07-18 00:48:48,314 INFO L263 TraceCheckUtils]: 23: Hoare triple {57#(<= main_~n~0 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {58#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:48,316 INFO L280 TraceCheckUtils]: 24: Hoare triple {58#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {59#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:48,317 INFO L280 TraceCheckUtils]: 25: Hoare triple {59#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {54#false} is VALID [2020-07-18 00:48:48,318 INFO L280 TraceCheckUtils]: 26: Hoare triple {54#false} assume !false; {54#false} is VALID [2020-07-18 00:48:48,322 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-18 00:48:48,324 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:48,326 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1711812201] [2020-07-18 00:48:48,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:48,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:48:48,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467047596] [2020-07-18 00:48:48,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-18 00:48:48,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:48,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:48:48,392 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:48,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:48:48,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:48,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:48:48,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:48:48,405 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 5 states. [2020-07-18 00:48:48,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:48,845 INFO L93 Difference]: Finished difference Result 89 states and 112 transitions. [2020-07-18 00:48:48,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:48:48,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-18 00:48:48,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:48,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:48:48,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2020-07-18 00:48:48,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:48:48,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2020-07-18 00:48:48,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 112 transitions. [2020-07-18 00:48:49,021 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:49,036 INFO L225 Difference]: With dead ends: 89 [2020-07-18 00:48:49,036 INFO L226 Difference]: Without dead ends: 48 [2020-07-18 00:48:49,041 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-18 00:48:49,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-18 00:48:49,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-07-18 00:48:49,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:49,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2020-07-18 00:48:49,133 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2020-07-18 00:48:49,133 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2020-07-18 00:48:49,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:49,141 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2020-07-18 00:48:49,141 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-18 00:48:49,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:49,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:49,142 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2020-07-18 00:48:49,142 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2020-07-18 00:48:49,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:49,148 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2020-07-18 00:48:49,148 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-18 00:48:49,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:49,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:49,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:49,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:49,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-18 00:48:49,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2020-07-18 00:48:49,155 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 27 [2020-07-18 00:48:49,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:49,156 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2020-07-18 00:48:49,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:48:49,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 52 transitions. [2020-07-18 00:48:49,223 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:49,223 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-18 00:48:49,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-18 00:48:49,225 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:49,225 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 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-18 00:48:49,225 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:48:49,226 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:49,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:49,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1763359327, now seen corresponding path program 1 times [2020-07-18 00:48:49,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:49,227 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [750140871] [2020-07-18 00:48:49,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:49,326 INFO L280 TraceCheckUtils]: 0: Hoare triple {434#true} assume true; {434#true} is VALID [2020-07-18 00:48:49,327 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {434#true} {434#true} #106#return; {434#true} is VALID [2020-07-18 00:48:49,327 INFO L263 TraceCheckUtils]: 0: Hoare triple {434#true} call ULTIMATE.init(); {434#true} is VALID [2020-07-18 00:48:49,328 INFO L280 TraceCheckUtils]: 1: Hoare triple {434#true} assume true; {434#true} is VALID [2020-07-18 00:48:49,328 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {434#true} {434#true} #106#return; {434#true} is VALID [2020-07-18 00:48:49,328 INFO L263 TraceCheckUtils]: 3: Hoare triple {434#true} call #t~ret6 := main(); {434#true} is VALID [2020-07-18 00:48:49,329 INFO L280 TraceCheckUtils]: 4: Hoare triple {434#true} havoc ~i~0; {434#true} is VALID [2020-07-18 00:48:49,329 INFO L280 TraceCheckUtils]: 5: Hoare triple {434#true} havoc ~j~0; {434#true} is VALID [2020-07-18 00:48:49,330 INFO L280 TraceCheckUtils]: 6: Hoare triple {434#true} havoc ~k~0; {434#true} is VALID [2020-07-18 00:48:49,330 INFO L280 TraceCheckUtils]: 7: Hoare triple {434#true} havoc ~n~0; {434#true} is VALID [2020-07-18 00:48:49,330 INFO L280 TraceCheckUtils]: 8: Hoare triple {434#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {434#true} is VALID [2020-07-18 00:48:49,331 INFO L280 TraceCheckUtils]: 9: Hoare triple {434#true} ~k~0 := #t~nondet0; {434#true} is VALID [2020-07-18 00:48:49,331 INFO L280 TraceCheckUtils]: 10: Hoare triple {434#true} havoc #t~nondet0; {434#true} is VALID [2020-07-18 00:48:49,331 INFO L280 TraceCheckUtils]: 11: Hoare triple {434#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {434#true} is VALID [2020-07-18 00:48:49,332 INFO L280 TraceCheckUtils]: 12: Hoare triple {434#true} ~n~0 := #t~nondet1; {434#true} is VALID [2020-07-18 00:48:49,332 INFO L280 TraceCheckUtils]: 13: Hoare triple {434#true} havoc #t~nondet1; {434#true} is VALID [2020-07-18 00:48:49,332 INFO L280 TraceCheckUtils]: 14: Hoare triple {434#true} assume !!(~n~0 < 1000000); {434#true} is VALID [2020-07-18 00:48:49,333 INFO L280 TraceCheckUtils]: 15: Hoare triple {434#true} assume ~k~0 == ~n~0; {434#true} is VALID [2020-07-18 00:48:49,333 INFO L280 TraceCheckUtils]: 16: Hoare triple {434#true} ~i~0 := 0; {434#true} is VALID [2020-07-18 00:48:49,333 INFO L280 TraceCheckUtils]: 17: Hoare triple {434#true} assume !!(~i~0 < ~n~0); {434#true} is VALID [2020-07-18 00:48:49,334 INFO L280 TraceCheckUtils]: 18: Hoare triple {434#true} ~j~0 := 2 * ~i~0; {438#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-18 00:48:49,335 INFO L280 TraceCheckUtils]: 19: Hoare triple {438#(<= (* 2 main_~i~0) main_~j~0)} assume !!(~j~0 < ~n~0); {438#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-18 00:48:49,336 INFO L280 TraceCheckUtils]: 20: Hoare triple {438#(<= (* 2 main_~i~0) main_~j~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {438#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-18 00:48:49,337 INFO L280 TraceCheckUtils]: 21: Hoare triple {438#(<= (* 2 main_~i~0) main_~j~0)} assume 0 != #t~nondet4; {438#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-18 00:48:49,338 INFO L280 TraceCheckUtils]: 22: Hoare triple {438#(<= (* 2 main_~i~0) main_~j~0)} havoc #t~nondet4; {438#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-18 00:48:49,339 INFO L280 TraceCheckUtils]: 23: Hoare triple {438#(<= (* 2 main_~i~0) main_~j~0)} ~k~0 := ~j~0; {439#(<= (* 2 main_~i~0) main_~k~0)} is VALID [2020-07-18 00:48:49,340 INFO L280 TraceCheckUtils]: 24: Hoare triple {439#(<= (* 2 main_~i~0) main_~k~0)} assume !!(~k~0 < ~n~0); {439#(<= (* 2 main_~i~0) main_~k~0)} is VALID [2020-07-18 00:48:49,341 INFO L263 TraceCheckUtils]: 25: Hoare triple {439#(<= (* 2 main_~i~0) main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {440#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:49,342 INFO L280 TraceCheckUtils]: 26: Hoare triple {440#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {441#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:49,343 INFO L280 TraceCheckUtils]: 27: Hoare triple {441#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {435#false} is VALID [2020-07-18 00:48:49,344 INFO L280 TraceCheckUtils]: 28: Hoare triple {435#false} assume !false; {435#false} is VALID [2020-07-18 00:48:49,346 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-18 00:48:49,346 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:49,347 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [750140871] [2020-07-18 00:48:49,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:49,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 00:48:49,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185695576] [2020-07-18 00:48:49,348 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2020-07-18 00:48:49,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:49,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 00:48:49,385 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:49,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 00:48:49,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:49,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 00:48:49,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:48:49,386 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 6 states. [2020-07-18 00:48:49,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:49,971 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2020-07-18 00:48:49,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 00:48:49,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2020-07-18 00:48:49,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:49,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:48:49,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2020-07-18 00:48:49,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:48:49,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2020-07-18 00:48:49,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 102 transitions. [2020-07-18 00:48:50,135 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:50,142 INFO L225 Difference]: With dead ends: 90 [2020-07-18 00:48:50,143 INFO L226 Difference]: Without dead ends: 88 [2020-07-18 00:48:50,150 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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-18 00:48:50,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-18 00:48:50,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 59. [2020-07-18 00:48:50,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:50,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 59 states. [2020-07-18 00:48:50,259 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 59 states. [2020-07-18 00:48:50,259 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 59 states. [2020-07-18 00:48:50,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:50,265 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2020-07-18 00:48:50,266 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2020-07-18 00:48:50,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:50,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:50,268 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 88 states. [2020-07-18 00:48:50,268 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 88 states. [2020-07-18 00:48:50,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:50,274 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2020-07-18 00:48:50,275 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2020-07-18 00:48:50,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:50,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:50,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:50,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:50,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-18 00:48:50,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2020-07-18 00:48:50,282 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 29 [2020-07-18 00:48:50,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:50,282 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2020-07-18 00:48:50,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 00:48:50,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states and 66 transitions. [2020-07-18 00:48:50,370 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:50,370 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2020-07-18 00:48:50,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-18 00:48:50,371 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:50,371 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 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-18 00:48:50,372 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:48:50,372 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:50,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:50,372 INFO L82 PathProgramCache]: Analyzing trace with hash 2139784298, now seen corresponding path program 1 times [2020-07-18 00:48:50,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:50,373 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1154246370] [2020-07-18 00:48:50,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:50,452 INFO L280 TraceCheckUtils]: 0: Hoare triple {922#true} assume true; {922#true} is VALID [2020-07-18 00:48:50,452 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {922#true} {922#true} #106#return; {922#true} is VALID [2020-07-18 00:48:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:50,462 INFO L280 TraceCheckUtils]: 0: Hoare triple {922#true} ~cond := #in~cond; {922#true} is VALID [2020-07-18 00:48:50,462 INFO L280 TraceCheckUtils]: 1: Hoare triple {922#true} assume !(0 == ~cond); {922#true} is VALID [2020-07-18 00:48:50,462 INFO L280 TraceCheckUtils]: 2: Hoare triple {922#true} assume true; {922#true} is VALID [2020-07-18 00:48:50,464 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {922#true} {926#(<= main_~k~0 main_~n~0)} #112#return; {926#(<= main_~k~0 main_~n~0)} is VALID [2020-07-18 00:48:50,465 INFO L263 TraceCheckUtils]: 0: Hoare triple {922#true} call ULTIMATE.init(); {922#true} is VALID [2020-07-18 00:48:50,465 INFO L280 TraceCheckUtils]: 1: Hoare triple {922#true} assume true; {922#true} is VALID [2020-07-18 00:48:50,465 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {922#true} {922#true} #106#return; {922#true} is VALID [2020-07-18 00:48:50,466 INFO L263 TraceCheckUtils]: 3: Hoare triple {922#true} call #t~ret6 := main(); {922#true} is VALID [2020-07-18 00:48:50,466 INFO L280 TraceCheckUtils]: 4: Hoare triple {922#true} havoc ~i~0; {922#true} is VALID [2020-07-18 00:48:50,466 INFO L280 TraceCheckUtils]: 5: Hoare triple {922#true} havoc ~j~0; {922#true} is VALID [2020-07-18 00:48:50,466 INFO L280 TraceCheckUtils]: 6: Hoare triple {922#true} havoc ~k~0; {922#true} is VALID [2020-07-18 00:48:50,467 INFO L280 TraceCheckUtils]: 7: Hoare triple {922#true} havoc ~n~0; {922#true} is VALID [2020-07-18 00:48:50,467 INFO L280 TraceCheckUtils]: 8: Hoare triple {922#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {922#true} is VALID [2020-07-18 00:48:50,467 INFO L280 TraceCheckUtils]: 9: Hoare triple {922#true} ~k~0 := #t~nondet0; {922#true} is VALID [2020-07-18 00:48:50,467 INFO L280 TraceCheckUtils]: 10: Hoare triple {922#true} havoc #t~nondet0; {922#true} is VALID [2020-07-18 00:48:50,468 INFO L280 TraceCheckUtils]: 11: Hoare triple {922#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {922#true} is VALID [2020-07-18 00:48:50,468 INFO L280 TraceCheckUtils]: 12: Hoare triple {922#true} ~n~0 := #t~nondet1; {922#true} is VALID [2020-07-18 00:48:50,468 INFO L280 TraceCheckUtils]: 13: Hoare triple {922#true} havoc #t~nondet1; {922#true} is VALID [2020-07-18 00:48:50,469 INFO L280 TraceCheckUtils]: 14: Hoare triple {922#true} assume !!(~n~0 < 1000000); {922#true} is VALID [2020-07-18 00:48:50,470 INFO L280 TraceCheckUtils]: 15: Hoare triple {922#true} assume ~k~0 == ~n~0; {926#(<= main_~k~0 main_~n~0)} is VALID [2020-07-18 00:48:50,471 INFO L280 TraceCheckUtils]: 16: Hoare triple {926#(<= main_~k~0 main_~n~0)} ~i~0 := 0; {926#(<= main_~k~0 main_~n~0)} is VALID [2020-07-18 00:48:50,472 INFO L280 TraceCheckUtils]: 17: Hoare triple {926#(<= main_~k~0 main_~n~0)} assume !!(~i~0 < ~n~0); {926#(<= main_~k~0 main_~n~0)} is VALID [2020-07-18 00:48:50,473 INFO L280 TraceCheckUtils]: 18: Hoare triple {926#(<= main_~k~0 main_~n~0)} ~j~0 := 2 * ~i~0; {926#(<= main_~k~0 main_~n~0)} is VALID [2020-07-18 00:48:50,473 INFO L280 TraceCheckUtils]: 19: Hoare triple {926#(<= main_~k~0 main_~n~0)} assume !!(~j~0 < ~n~0); {926#(<= main_~k~0 main_~n~0)} is VALID [2020-07-18 00:48:50,474 INFO L280 TraceCheckUtils]: 20: Hoare triple {926#(<= main_~k~0 main_~n~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {926#(<= main_~k~0 main_~n~0)} is VALID [2020-07-18 00:48:50,475 INFO L280 TraceCheckUtils]: 21: Hoare triple {926#(<= main_~k~0 main_~n~0)} assume !(0 != #t~nondet4); {926#(<= main_~k~0 main_~n~0)} is VALID [2020-07-18 00:48:50,475 INFO L280 TraceCheckUtils]: 22: Hoare triple {926#(<= main_~k~0 main_~n~0)} havoc #t~nondet4; {926#(<= main_~k~0 main_~n~0)} is VALID [2020-07-18 00:48:50,476 INFO L263 TraceCheckUtils]: 23: Hoare triple {926#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {922#true} is VALID [2020-07-18 00:48:50,476 INFO L280 TraceCheckUtils]: 24: Hoare triple {922#true} ~cond := #in~cond; {922#true} is VALID [2020-07-18 00:48:50,476 INFO L280 TraceCheckUtils]: 25: Hoare triple {922#true} assume !(0 == ~cond); {922#true} is VALID [2020-07-18 00:48:50,476 INFO L280 TraceCheckUtils]: 26: Hoare triple {922#true} assume true; {922#true} is VALID [2020-07-18 00:48:50,477 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {922#true} {926#(<= main_~k~0 main_~n~0)} #112#return; {926#(<= main_~k~0 main_~n~0)} is VALID [2020-07-18 00:48:50,478 INFO L263 TraceCheckUtils]: 28: Hoare triple {926#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {931#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:50,479 INFO L280 TraceCheckUtils]: 29: Hoare triple {931#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {932#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:50,480 INFO L280 TraceCheckUtils]: 30: Hoare triple {932#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {923#false} is VALID [2020-07-18 00:48:50,480 INFO L280 TraceCheckUtils]: 31: Hoare triple {923#false} assume !false; {923#false} is VALID [2020-07-18 00:48:50,481 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-18 00:48:50,482 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:50,482 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1154246370] [2020-07-18 00:48:50,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:50,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:48:50,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657002843] [2020-07-18 00:48:50,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2020-07-18 00:48:50,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:50,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:48:50,522 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-18 00:48:50,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:48:50,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:50,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:48:50,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:48:50,523 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 5 states. [2020-07-18 00:48:50,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:50,896 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2020-07-18 00:48:50,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:48:50,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2020-07-18 00:48:50,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:50,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:48:50,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2020-07-18 00:48:50,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:48:50,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2020-07-18 00:48:50,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2020-07-18 00:48:50,986 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:50,990 INFO L225 Difference]: With dead ends: 86 [2020-07-18 00:48:50,990 INFO L226 Difference]: Without dead ends: 84 [2020-07-18 00:48:50,991 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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-18 00:48:50,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-07-18 00:48:51,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2020-07-18 00:48:51,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:51,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 80 states. [2020-07-18 00:48:51,099 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 80 states. [2020-07-18 00:48:51,099 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 80 states. [2020-07-18 00:48:51,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:51,108 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2020-07-18 00:48:51,108 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2020-07-18 00:48:51,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:51,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:51,114 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 84 states. [2020-07-18 00:48:51,114 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 84 states. [2020-07-18 00:48:51,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:51,122 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2020-07-18 00:48:51,122 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2020-07-18 00:48:51,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:51,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:51,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:51,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:51,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-07-18 00:48:51,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2020-07-18 00:48:51,133 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 32 [2020-07-18 00:48:51,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:51,133 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2020-07-18 00:48:51,133 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:48:51,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 80 states and 92 transitions. [2020-07-18 00:48:51,249 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-18 00:48:51,250 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2020-07-18 00:48:51,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-18 00:48:51,252 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:51,252 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:51,252 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:48:51,252 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:51,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:51,253 INFO L82 PathProgramCache]: Analyzing trace with hash -268568898, now seen corresponding path program 1 times [2020-07-18 00:48:51,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:51,253 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [636063430] [2020-07-18 00:48:51,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:51,403 INFO L280 TraceCheckUtils]: 0: Hoare triple {1437#true} assume true; {1437#true} is VALID [2020-07-18 00:48:51,404 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1437#true} {1437#true} #106#return; {1437#true} is VALID [2020-07-18 00:48:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:51,426 INFO L280 TraceCheckUtils]: 0: Hoare triple {1437#true} ~cond := #in~cond; {1437#true} is VALID [2020-07-18 00:48:51,427 INFO L280 TraceCheckUtils]: 1: Hoare triple {1437#true} assume !(0 == ~cond); {1437#true} is VALID [2020-07-18 00:48:51,427 INFO L280 TraceCheckUtils]: 2: Hoare triple {1437#true} assume true; {1437#true} is VALID [2020-07-18 00:48:51,428 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1437#true} {1442#(<= (* 2 main_~i~0) main_~k~0)} #110#return; {1442#(<= (* 2 main_~i~0) main_~k~0)} is VALID [2020-07-18 00:48:51,428 INFO L263 TraceCheckUtils]: 0: Hoare triple {1437#true} call ULTIMATE.init(); {1437#true} is VALID [2020-07-18 00:48:51,428 INFO L280 TraceCheckUtils]: 1: Hoare triple {1437#true} assume true; {1437#true} is VALID [2020-07-18 00:48:51,429 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1437#true} {1437#true} #106#return; {1437#true} is VALID [2020-07-18 00:48:51,429 INFO L263 TraceCheckUtils]: 3: Hoare triple {1437#true} call #t~ret6 := main(); {1437#true} is VALID [2020-07-18 00:48:51,432 INFO L280 TraceCheckUtils]: 4: Hoare triple {1437#true} havoc ~i~0; {1437#true} is VALID [2020-07-18 00:48:51,432 INFO L280 TraceCheckUtils]: 5: Hoare triple {1437#true} havoc ~j~0; {1437#true} is VALID [2020-07-18 00:48:51,432 INFO L280 TraceCheckUtils]: 6: Hoare triple {1437#true} havoc ~k~0; {1437#true} is VALID [2020-07-18 00:48:51,432 INFO L280 TraceCheckUtils]: 7: Hoare triple {1437#true} havoc ~n~0; {1437#true} is VALID [2020-07-18 00:48:51,433 INFO L280 TraceCheckUtils]: 8: Hoare triple {1437#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1437#true} is VALID [2020-07-18 00:48:51,433 INFO L280 TraceCheckUtils]: 9: Hoare triple {1437#true} ~k~0 := #t~nondet0; {1437#true} is VALID [2020-07-18 00:48:51,433 INFO L280 TraceCheckUtils]: 10: Hoare triple {1437#true} havoc #t~nondet0; {1437#true} is VALID [2020-07-18 00:48:51,433 INFO L280 TraceCheckUtils]: 11: Hoare triple {1437#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1437#true} is VALID [2020-07-18 00:48:51,434 INFO L280 TraceCheckUtils]: 12: Hoare triple {1437#true} ~n~0 := #t~nondet1; {1437#true} is VALID [2020-07-18 00:48:51,434 INFO L280 TraceCheckUtils]: 13: Hoare triple {1437#true} havoc #t~nondet1; {1437#true} is VALID [2020-07-18 00:48:51,437 INFO L280 TraceCheckUtils]: 14: Hoare triple {1437#true} assume !!(~n~0 < 1000000); {1437#true} is VALID [2020-07-18 00:48:51,438 INFO L280 TraceCheckUtils]: 15: Hoare triple {1437#true} assume ~k~0 == ~n~0; {1437#true} is VALID [2020-07-18 00:48:51,438 INFO L280 TraceCheckUtils]: 16: Hoare triple {1437#true} ~i~0 := 0; {1437#true} is VALID [2020-07-18 00:48:51,438 INFO L280 TraceCheckUtils]: 17: Hoare triple {1437#true} assume !!(~i~0 < ~n~0); {1437#true} is VALID [2020-07-18 00:48:51,454 INFO L280 TraceCheckUtils]: 18: Hoare triple {1437#true} ~j~0 := 2 * ~i~0; {1441#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-18 00:48:51,457 INFO L280 TraceCheckUtils]: 19: Hoare triple {1441#(<= (* 2 main_~i~0) main_~j~0)} assume !!(~j~0 < ~n~0); {1441#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-18 00:48:51,459 INFO L280 TraceCheckUtils]: 20: Hoare triple {1441#(<= (* 2 main_~i~0) main_~j~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1441#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-18 00:48:51,459 INFO L280 TraceCheckUtils]: 21: Hoare triple {1441#(<= (* 2 main_~i~0) main_~j~0)} assume 0 != #t~nondet4; {1441#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-18 00:48:51,460 INFO L280 TraceCheckUtils]: 22: Hoare triple {1441#(<= (* 2 main_~i~0) main_~j~0)} havoc #t~nondet4; {1441#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-18 00:48:51,461 INFO L280 TraceCheckUtils]: 23: Hoare triple {1441#(<= (* 2 main_~i~0) main_~j~0)} ~k~0 := ~j~0; {1442#(<= (* 2 main_~i~0) main_~k~0)} is VALID [2020-07-18 00:48:51,466 INFO L280 TraceCheckUtils]: 24: Hoare triple {1442#(<= (* 2 main_~i~0) main_~k~0)} assume !!(~k~0 < ~n~0); {1442#(<= (* 2 main_~i~0) main_~k~0)} is VALID [2020-07-18 00:48:51,466 INFO L263 TraceCheckUtils]: 25: Hoare triple {1442#(<= (* 2 main_~i~0) main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {1437#true} is VALID [2020-07-18 00:48:51,466 INFO L280 TraceCheckUtils]: 26: Hoare triple {1437#true} ~cond := #in~cond; {1437#true} is VALID [2020-07-18 00:48:51,467 INFO L280 TraceCheckUtils]: 27: Hoare triple {1437#true} assume !(0 == ~cond); {1437#true} is VALID [2020-07-18 00:48:51,467 INFO L280 TraceCheckUtils]: 28: Hoare triple {1437#true} assume true; {1437#true} is VALID [2020-07-18 00:48:51,471 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1437#true} {1442#(<= (* 2 main_~i~0) main_~k~0)} #110#return; {1442#(<= (* 2 main_~i~0) main_~k~0)} is VALID [2020-07-18 00:48:51,472 INFO L280 TraceCheckUtils]: 30: Hoare triple {1442#(<= (* 2 main_~i~0) main_~k~0)} #t~post5 := ~k~0; {1447#(<= (* 2 main_~i~0) |main_#t~post5|)} is VALID [2020-07-18 00:48:51,473 INFO L280 TraceCheckUtils]: 31: Hoare triple {1447#(<= (* 2 main_~i~0) |main_#t~post5|)} ~k~0 := 1 + #t~post5; {1448#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} is VALID [2020-07-18 00:48:51,474 INFO L280 TraceCheckUtils]: 32: Hoare triple {1448#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} havoc #t~post5; {1448#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} is VALID [2020-07-18 00:48:51,474 INFO L280 TraceCheckUtils]: 33: Hoare triple {1448#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} assume !!(~k~0 < ~n~0); {1448#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} is VALID [2020-07-18 00:48:51,476 INFO L263 TraceCheckUtils]: 34: Hoare triple {1448#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {1449#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:51,476 INFO L280 TraceCheckUtils]: 35: Hoare triple {1449#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1450#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:51,477 INFO L280 TraceCheckUtils]: 36: Hoare triple {1450#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1438#false} is VALID [2020-07-18 00:48:51,477 INFO L280 TraceCheckUtils]: 37: Hoare triple {1438#false} assume !false; {1438#false} is VALID [2020-07-18 00:48:51,490 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-18 00:48:51,490 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:51,491 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [636063430] [2020-07-18 00:48:51,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:51,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-18 00:48:51,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128830845] [2020-07-18 00:48:51,497 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2020-07-18 00:48:51,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:51,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 00:48:51,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:51,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 00:48:51,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:51,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 00:48:51,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:48:51,549 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand 8 states. [2020-07-18 00:48:52,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:52,574 INFO L93 Difference]: Finished difference Result 137 states and 162 transitions. [2020-07-18 00:48:52,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-18 00:48:52,574 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2020-07-18 00:48:52,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:52,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:48:52,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 121 transitions. [2020-07-18 00:48:52,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:48:52,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 121 transitions. [2020-07-18 00:48:52,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 121 transitions. [2020-07-18 00:48:52,704 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:52,710 INFO L225 Difference]: With dead ends: 137 [2020-07-18 00:48:52,710 INFO L226 Difference]: Without dead ends: 135 [2020-07-18 00:48:52,711 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-07-18 00:48:52,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-07-18 00:48:52,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 83. [2020-07-18 00:48:52,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:52,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand 83 states. [2020-07-18 00:48:52,849 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 83 states. [2020-07-18 00:48:52,849 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 83 states. [2020-07-18 00:48:52,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:52,856 INFO L93 Difference]: Finished difference Result 135 states and 160 transitions. [2020-07-18 00:48:52,856 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 160 transitions. [2020-07-18 00:48:52,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:52,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:52,857 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 135 states. [2020-07-18 00:48:52,858 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 135 states. [2020-07-18 00:48:52,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:52,864 INFO L93 Difference]: Finished difference Result 135 states and 160 transitions. [2020-07-18 00:48:52,864 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 160 transitions. [2020-07-18 00:48:52,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:52,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:52,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:52,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:52,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-07-18 00:48:52,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2020-07-18 00:48:52,869 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 38 [2020-07-18 00:48:52,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:52,870 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2020-07-18 00:48:52,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 00:48:52,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 83 states and 95 transitions. [2020-07-18 00:48:52,996 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:52,996 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2020-07-18 00:48:52,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-18 00:48:52,998 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:52,998 INFO L422 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1] [2020-07-18 00:48:52,998 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:48:52,999 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:52,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:52,999 INFO L82 PathProgramCache]: Analyzing trace with hash -360550748, now seen corresponding path program 1 times [2020-07-18 00:48:52,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:53,000 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1520903624] [2020-07-18 00:48:53,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:53,087 INFO L280 TraceCheckUtils]: 0: Hoare triple {2173#true} assume true; {2173#true} is VALID [2020-07-18 00:48:53,088 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2173#true} {2173#true} #106#return; {2173#true} is VALID [2020-07-18 00:48:53,088 INFO L263 TraceCheckUtils]: 0: Hoare triple {2173#true} call ULTIMATE.init(); {2173#true} is VALID [2020-07-18 00:48:53,088 INFO L280 TraceCheckUtils]: 1: Hoare triple {2173#true} assume true; {2173#true} is VALID [2020-07-18 00:48:53,089 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2173#true} {2173#true} #106#return; {2173#true} is VALID [2020-07-18 00:48:53,089 INFO L263 TraceCheckUtils]: 3: Hoare triple {2173#true} call #t~ret6 := main(); {2173#true} is VALID [2020-07-18 00:48:53,089 INFO L280 TraceCheckUtils]: 4: Hoare triple {2173#true} havoc ~i~0; {2173#true} is VALID [2020-07-18 00:48:53,089 INFO L280 TraceCheckUtils]: 5: Hoare triple {2173#true} havoc ~j~0; {2173#true} is VALID [2020-07-18 00:48:53,090 INFO L280 TraceCheckUtils]: 6: Hoare triple {2173#true} havoc ~k~0; {2173#true} is VALID [2020-07-18 00:48:53,090 INFO L280 TraceCheckUtils]: 7: Hoare triple {2173#true} havoc ~n~0; {2173#true} is VALID [2020-07-18 00:48:53,090 INFO L280 TraceCheckUtils]: 8: Hoare triple {2173#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2173#true} is VALID [2020-07-18 00:48:53,090 INFO L280 TraceCheckUtils]: 9: Hoare triple {2173#true} ~k~0 := #t~nondet0; {2173#true} is VALID [2020-07-18 00:48:53,090 INFO L280 TraceCheckUtils]: 10: Hoare triple {2173#true} havoc #t~nondet0; {2173#true} is VALID [2020-07-18 00:48:53,091 INFO L280 TraceCheckUtils]: 11: Hoare triple {2173#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2173#true} is VALID [2020-07-18 00:48:53,091 INFO L280 TraceCheckUtils]: 12: Hoare triple {2173#true} ~n~0 := #t~nondet1; {2173#true} is VALID [2020-07-18 00:48:53,091 INFO L280 TraceCheckUtils]: 13: Hoare triple {2173#true} havoc #t~nondet1; {2173#true} is VALID [2020-07-18 00:48:53,091 INFO L280 TraceCheckUtils]: 14: Hoare triple {2173#true} assume !!(~n~0 < 1000000); {2173#true} is VALID [2020-07-18 00:48:53,091 INFO L280 TraceCheckUtils]: 15: Hoare triple {2173#true} assume ~k~0 == ~n~0; {2173#true} is VALID [2020-07-18 00:48:53,092 INFO L280 TraceCheckUtils]: 16: Hoare triple {2173#true} ~i~0 := 0; {2177#(<= main_~i~0 0)} is VALID [2020-07-18 00:48:53,093 INFO L280 TraceCheckUtils]: 17: Hoare triple {2177#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0); {2178#(<= (+ (* 2 main_~i~0) 1) main_~n~0)} is VALID [2020-07-18 00:48:53,093 INFO L280 TraceCheckUtils]: 18: Hoare triple {2178#(<= (+ (* 2 main_~i~0) 1) main_~n~0)} ~j~0 := 2 * ~i~0; {2179#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-18 00:48:53,094 INFO L280 TraceCheckUtils]: 19: Hoare triple {2179#(<= (+ main_~j~0 1) main_~n~0)} assume !!(~j~0 < ~n~0); {2179#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-18 00:48:53,094 INFO L280 TraceCheckUtils]: 20: Hoare triple {2179#(<= (+ main_~j~0 1) main_~n~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2179#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-18 00:48:53,095 INFO L280 TraceCheckUtils]: 21: Hoare triple {2179#(<= (+ main_~j~0 1) main_~n~0)} assume 0 != #t~nondet4; {2179#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-18 00:48:53,096 INFO L280 TraceCheckUtils]: 22: Hoare triple {2179#(<= (+ main_~j~0 1) main_~n~0)} havoc #t~nondet4; {2179#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-18 00:48:53,097 INFO L280 TraceCheckUtils]: 23: Hoare triple {2179#(<= (+ main_~j~0 1) main_~n~0)} ~k~0 := ~j~0; {2180#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2020-07-18 00:48:53,097 INFO L280 TraceCheckUtils]: 24: Hoare triple {2180#(<= (+ main_~k~0 1) main_~n~0)} assume !(~k~0 < ~n~0); {2174#false} is VALID [2020-07-18 00:48:53,098 INFO L280 TraceCheckUtils]: 25: Hoare triple {2174#false} #t~post3 := ~j~0; {2174#false} is VALID [2020-07-18 00:48:53,098 INFO L280 TraceCheckUtils]: 26: Hoare triple {2174#false} ~j~0 := 1 + #t~post3; {2174#false} is VALID [2020-07-18 00:48:53,098 INFO L280 TraceCheckUtils]: 27: Hoare triple {2174#false} havoc #t~post3; {2174#false} is VALID [2020-07-18 00:48:53,098 INFO L280 TraceCheckUtils]: 28: Hoare triple {2174#false} assume !!(~j~0 < ~n~0); {2174#false} is VALID [2020-07-18 00:48:53,099 INFO L280 TraceCheckUtils]: 29: Hoare triple {2174#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2174#false} is VALID [2020-07-18 00:48:53,099 INFO L280 TraceCheckUtils]: 30: Hoare triple {2174#false} assume 0 != #t~nondet4; {2174#false} is VALID [2020-07-18 00:48:53,099 INFO L280 TraceCheckUtils]: 31: Hoare triple {2174#false} havoc #t~nondet4; {2174#false} is VALID [2020-07-18 00:48:53,099 INFO L280 TraceCheckUtils]: 32: Hoare triple {2174#false} ~k~0 := ~j~0; {2174#false} is VALID [2020-07-18 00:48:53,100 INFO L280 TraceCheckUtils]: 33: Hoare triple {2174#false} assume !!(~k~0 < ~n~0); {2174#false} is VALID [2020-07-18 00:48:53,100 INFO L263 TraceCheckUtils]: 34: Hoare triple {2174#false} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {2174#false} is VALID [2020-07-18 00:48:53,100 INFO L280 TraceCheckUtils]: 35: Hoare triple {2174#false} ~cond := #in~cond; {2174#false} is VALID [2020-07-18 00:48:53,100 INFO L280 TraceCheckUtils]: 36: Hoare triple {2174#false} assume 0 == ~cond; {2174#false} is VALID [2020-07-18 00:48:53,101 INFO L280 TraceCheckUtils]: 37: Hoare triple {2174#false} assume !false; {2174#false} is VALID [2020-07-18 00:48:53,102 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-18 00:48:53,105 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:53,106 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1520903624] [2020-07-18 00:48:53,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:53,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 00:48:53,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166139442] [2020-07-18 00:48:53,107 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-07-18 00:48:53,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:53,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 00:48:53,145 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:53,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 00:48:53,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:53,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 00:48:53,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:48:53,147 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand 6 states. [2020-07-18 00:48:53,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:53,822 INFO L93 Difference]: Finished difference Result 194 states and 236 transitions. [2020-07-18 00:48:53,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 00:48:53,822 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-07-18 00:48:53,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:53,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:48:53,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2020-07-18 00:48:53,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:48:53,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2020-07-18 00:48:53,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 113 transitions. [2020-07-18 00:48:53,960 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:53,965 INFO L225 Difference]: With dead ends: 194 [2020-07-18 00:48:53,965 INFO L226 Difference]: Without dead ends: 128 [2020-07-18 00:48:53,966 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-18 00:48:53,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-07-18 00:48:54,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 88. [2020-07-18 00:48:54,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:54,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 88 states. [2020-07-18 00:48:54,155 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 88 states. [2020-07-18 00:48:54,155 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 88 states. [2020-07-18 00:48:54,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:54,161 INFO L93 Difference]: Finished difference Result 128 states and 153 transitions. [2020-07-18 00:48:54,161 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 153 transitions. [2020-07-18 00:48:54,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:54,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:54,162 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 128 states. [2020-07-18 00:48:54,162 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 128 states. [2020-07-18 00:48:54,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:54,168 INFO L93 Difference]: Finished difference Result 128 states and 153 transitions. [2020-07-18 00:48:54,168 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 153 transitions. [2020-07-18 00:48:54,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:54,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:54,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:54,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:54,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-07-18 00:48:54,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2020-07-18 00:48:54,172 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 38 [2020-07-18 00:48:54,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:54,173 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2020-07-18 00:48:54,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 00:48:54,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 88 states and 100 transitions. [2020-07-18 00:48:54,352 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:54,352 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2020-07-18 00:48:54,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-18 00:48:54,353 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:54,354 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:54,354 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 00:48:54,354 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:54,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:54,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1447898534, now seen corresponding path program 1 times [2020-07-18 00:48:54,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:54,356 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1979704225] [2020-07-18 00:48:54,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:54,483 INFO L280 TraceCheckUtils]: 0: Hoare triple {3011#true} assume true; {3011#true} is VALID [2020-07-18 00:48:54,483 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3011#true} {3011#true} #106#return; {3011#true} is VALID [2020-07-18 00:48:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:54,490 INFO L280 TraceCheckUtils]: 0: Hoare triple {3011#true} ~cond := #in~cond; {3011#true} is VALID [2020-07-18 00:48:54,490 INFO L280 TraceCheckUtils]: 1: Hoare triple {3011#true} assume !(0 == ~cond); {3011#true} is VALID [2020-07-18 00:48:54,491 INFO L280 TraceCheckUtils]: 2: Hoare triple {3011#true} assume true; {3011#true} is VALID [2020-07-18 00:48:54,492 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3011#true} {3015#(<= (* 2 main_~i~0) main_~j~0)} #112#return; {3015#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-18 00:48:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:54,498 INFO L280 TraceCheckUtils]: 0: Hoare triple {3011#true} ~cond := #in~cond; {3011#true} is VALID [2020-07-18 00:48:54,498 INFO L280 TraceCheckUtils]: 1: Hoare triple {3011#true} assume !(0 == ~cond); {3011#true} is VALID [2020-07-18 00:48:54,499 INFO L280 TraceCheckUtils]: 2: Hoare triple {3011#true} assume true; {3011#true} is VALID [2020-07-18 00:48:54,500 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3011#true} {3015#(<= (* 2 main_~i~0) main_~j~0)} #114#return; {3015#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-18 00:48:54,500 INFO L263 TraceCheckUtils]: 0: Hoare triple {3011#true} call ULTIMATE.init(); {3011#true} is VALID [2020-07-18 00:48:54,500 INFO L280 TraceCheckUtils]: 1: Hoare triple {3011#true} assume true; {3011#true} is VALID [2020-07-18 00:48:54,501 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3011#true} {3011#true} #106#return; {3011#true} is VALID [2020-07-18 00:48:54,501 INFO L263 TraceCheckUtils]: 3: Hoare triple {3011#true} call #t~ret6 := main(); {3011#true} is VALID [2020-07-18 00:48:54,501 INFO L280 TraceCheckUtils]: 4: Hoare triple {3011#true} havoc ~i~0; {3011#true} is VALID [2020-07-18 00:48:54,501 INFO L280 TraceCheckUtils]: 5: Hoare triple {3011#true} havoc ~j~0; {3011#true} is VALID [2020-07-18 00:48:54,502 INFO L280 TraceCheckUtils]: 6: Hoare triple {3011#true} havoc ~k~0; {3011#true} is VALID [2020-07-18 00:48:54,502 INFO L280 TraceCheckUtils]: 7: Hoare triple {3011#true} havoc ~n~0; {3011#true} is VALID [2020-07-18 00:48:54,502 INFO L280 TraceCheckUtils]: 8: Hoare triple {3011#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3011#true} is VALID [2020-07-18 00:48:54,502 INFO L280 TraceCheckUtils]: 9: Hoare triple {3011#true} ~k~0 := #t~nondet0; {3011#true} is VALID [2020-07-18 00:48:54,503 INFO L280 TraceCheckUtils]: 10: Hoare triple {3011#true} havoc #t~nondet0; {3011#true} is VALID [2020-07-18 00:48:54,503 INFO L280 TraceCheckUtils]: 11: Hoare triple {3011#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3011#true} is VALID [2020-07-18 00:48:54,503 INFO L280 TraceCheckUtils]: 12: Hoare triple {3011#true} ~n~0 := #t~nondet1; {3011#true} is VALID [2020-07-18 00:48:54,503 INFO L280 TraceCheckUtils]: 13: Hoare triple {3011#true} havoc #t~nondet1; {3011#true} is VALID [2020-07-18 00:48:54,504 INFO L280 TraceCheckUtils]: 14: Hoare triple {3011#true} assume !!(~n~0 < 1000000); {3011#true} is VALID [2020-07-18 00:48:54,504 INFO L280 TraceCheckUtils]: 15: Hoare triple {3011#true} assume ~k~0 == ~n~0; {3011#true} is VALID [2020-07-18 00:48:54,504 INFO L280 TraceCheckUtils]: 16: Hoare triple {3011#true} ~i~0 := 0; {3011#true} is VALID [2020-07-18 00:48:54,504 INFO L280 TraceCheckUtils]: 17: Hoare triple {3011#true} assume !!(~i~0 < ~n~0); {3011#true} is VALID [2020-07-18 00:48:54,505 INFO L280 TraceCheckUtils]: 18: Hoare triple {3011#true} ~j~0 := 2 * ~i~0; {3015#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-18 00:48:54,506 INFO L280 TraceCheckUtils]: 19: Hoare triple {3015#(<= (* 2 main_~i~0) main_~j~0)} assume !!(~j~0 < ~n~0); {3015#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-18 00:48:54,506 INFO L280 TraceCheckUtils]: 20: Hoare triple {3015#(<= (* 2 main_~i~0) main_~j~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3015#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-18 00:48:54,507 INFO L280 TraceCheckUtils]: 21: Hoare triple {3015#(<= (* 2 main_~i~0) main_~j~0)} assume !(0 != #t~nondet4); {3015#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-18 00:48:54,507 INFO L280 TraceCheckUtils]: 22: Hoare triple {3015#(<= (* 2 main_~i~0) main_~j~0)} havoc #t~nondet4; {3015#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-18 00:48:54,508 INFO L263 TraceCheckUtils]: 23: Hoare triple {3015#(<= (* 2 main_~i~0) main_~j~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {3011#true} is VALID [2020-07-18 00:48:54,508 INFO L280 TraceCheckUtils]: 24: Hoare triple {3011#true} ~cond := #in~cond; {3011#true} is VALID [2020-07-18 00:48:54,508 INFO L280 TraceCheckUtils]: 25: Hoare triple {3011#true} assume !(0 == ~cond); {3011#true} is VALID [2020-07-18 00:48:54,508 INFO L280 TraceCheckUtils]: 26: Hoare triple {3011#true} assume true; {3011#true} is VALID [2020-07-18 00:48:54,509 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {3011#true} {3015#(<= (* 2 main_~i~0) main_~j~0)} #112#return; {3015#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-18 00:48:54,510 INFO L263 TraceCheckUtils]: 28: Hoare triple {3015#(<= (* 2 main_~i~0) main_~j~0)} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {3011#true} is VALID [2020-07-18 00:48:54,510 INFO L280 TraceCheckUtils]: 29: Hoare triple {3011#true} ~cond := #in~cond; {3011#true} is VALID [2020-07-18 00:48:54,510 INFO L280 TraceCheckUtils]: 30: Hoare triple {3011#true} assume !(0 == ~cond); {3011#true} is VALID [2020-07-18 00:48:54,510 INFO L280 TraceCheckUtils]: 31: Hoare triple {3011#true} assume true; {3011#true} is VALID [2020-07-18 00:48:54,511 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {3011#true} {3015#(<= (* 2 main_~i~0) main_~j~0)} #114#return; {3015#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-18 00:48:54,512 INFO L280 TraceCheckUtils]: 33: Hoare triple {3015#(<= (* 2 main_~i~0) main_~j~0)} #t~post3 := ~j~0; {3024#(<= (* 2 main_~i~0) |main_#t~post3|)} is VALID [2020-07-18 00:48:54,513 INFO L280 TraceCheckUtils]: 34: Hoare triple {3024#(<= (* 2 main_~i~0) |main_#t~post3|)} ~j~0 := 1 + #t~post3; {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-18 00:48:54,513 INFO L280 TraceCheckUtils]: 35: Hoare triple {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} havoc #t~post3; {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-18 00:48:54,514 INFO L280 TraceCheckUtils]: 36: Hoare triple {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} assume !!(~j~0 < ~n~0); {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-18 00:48:54,515 INFO L280 TraceCheckUtils]: 37: Hoare triple {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-18 00:48:54,515 INFO L280 TraceCheckUtils]: 38: Hoare triple {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} assume 0 != #t~nondet4; {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-18 00:48:54,516 INFO L280 TraceCheckUtils]: 39: Hoare triple {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} havoc #t~nondet4; {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-18 00:48:54,517 INFO L280 TraceCheckUtils]: 40: Hoare triple {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} ~k~0 := ~j~0; {3026#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} is VALID [2020-07-18 00:48:54,517 INFO L280 TraceCheckUtils]: 41: Hoare triple {3026#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} assume !!(~k~0 < ~n~0); {3026#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} is VALID [2020-07-18 00:48:54,519 INFO L263 TraceCheckUtils]: 42: Hoare triple {3026#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {3027#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:54,519 INFO L280 TraceCheckUtils]: 43: Hoare triple {3027#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {3028#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:54,520 INFO L280 TraceCheckUtils]: 44: Hoare triple {3028#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3012#false} is VALID [2020-07-18 00:48:54,520 INFO L280 TraceCheckUtils]: 45: Hoare triple {3012#false} assume !false; {3012#false} is VALID [2020-07-18 00:48:54,523 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-18 00:48:54,523 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:54,524 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1979704225] [2020-07-18 00:48:54,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:54,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-18 00:48:54,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272967430] [2020-07-18 00:48:54,525 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2020-07-18 00:48:54,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:54,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 00:48:54,574 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:54,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 00:48:54,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:54,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 00:48:54,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:48:54,576 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand 8 states. [2020-07-18 00:48:55,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:55,429 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2020-07-18 00:48:55,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-18 00:48:55,429 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2020-07-18 00:48:55,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:55,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:48:55,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2020-07-18 00:48:55,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:48:55,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2020-07-18 00:48:55,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 82 transitions. [2020-07-18 00:48:55,536 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:55,539 INFO L225 Difference]: With dead ends: 111 [2020-07-18 00:48:55,540 INFO L226 Difference]: Without dead ends: 109 [2020-07-18 00:48:55,541 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-18 00:48:55,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-07-18 00:48:55,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 93. [2020-07-18 00:48:55,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:55,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 93 states. [2020-07-18 00:48:55,748 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 93 states. [2020-07-18 00:48:55,748 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 93 states. [2020-07-18 00:48:55,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:55,752 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2020-07-18 00:48:55,752 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2020-07-18 00:48:55,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:55,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:55,753 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 109 states. [2020-07-18 00:48:55,753 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 109 states. [2020-07-18 00:48:55,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:55,758 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2020-07-18 00:48:55,758 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2020-07-18 00:48:55,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:55,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:55,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:55,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:55,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-07-18 00:48:55,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2020-07-18 00:48:55,763 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 46 [2020-07-18 00:48:55,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:55,763 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2020-07-18 00:48:55,763 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 00:48:55,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 93 states and 105 transitions. [2020-07-18 00:48:55,948 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:55,948 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2020-07-18 00:48:55,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-18 00:48:55,950 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:55,950 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:55,950 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 00:48:55,951 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:55,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:55,951 INFO L82 PathProgramCache]: Analyzing trace with hash 87970788, now seen corresponding path program 1 times [2020-07-18 00:48:55,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:55,951 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [937255798] [2020-07-18 00:48:55,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:56,124 INFO L280 TraceCheckUtils]: 0: Hoare triple {3665#true} assume true; {3665#true} is VALID [2020-07-18 00:48:56,125 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3665#true} {3665#true} #106#return; {3665#true} is VALID [2020-07-18 00:48:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:56,131 INFO L280 TraceCheckUtils]: 0: Hoare triple {3665#true} ~cond := #in~cond; {3665#true} is VALID [2020-07-18 00:48:56,131 INFO L280 TraceCheckUtils]: 1: Hoare triple {3665#true} assume !(0 == ~cond); {3665#true} is VALID [2020-07-18 00:48:56,132 INFO L280 TraceCheckUtils]: 2: Hoare triple {3665#true} assume true; {3665#true} is VALID [2020-07-18 00:48:56,133 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3665#true} {3672#(<= (+ main_~k~0 1) main_~n~0)} #110#return; {3672#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2020-07-18 00:48:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:56,140 INFO L280 TraceCheckUtils]: 0: Hoare triple {3665#true} ~cond := #in~cond; {3665#true} is VALID [2020-07-18 00:48:56,141 INFO L280 TraceCheckUtils]: 1: Hoare triple {3665#true} assume !(0 == ~cond); {3665#true} is VALID [2020-07-18 00:48:56,141 INFO L280 TraceCheckUtils]: 2: Hoare triple {3665#true} assume true; {3665#true} is VALID [2020-07-18 00:48:56,142 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3665#true} {3678#(<= main_~k~0 main_~n~0)} #112#return; {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-18 00:48:56,143 INFO L263 TraceCheckUtils]: 0: Hoare triple {3665#true} call ULTIMATE.init(); {3665#true} is VALID [2020-07-18 00:48:56,143 INFO L280 TraceCheckUtils]: 1: Hoare triple {3665#true} assume true; {3665#true} is VALID [2020-07-18 00:48:56,143 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3665#true} {3665#true} #106#return; {3665#true} is VALID [2020-07-18 00:48:56,143 INFO L263 TraceCheckUtils]: 3: Hoare triple {3665#true} call #t~ret6 := main(); {3665#true} is VALID [2020-07-18 00:48:56,144 INFO L280 TraceCheckUtils]: 4: Hoare triple {3665#true} havoc ~i~0; {3665#true} is VALID [2020-07-18 00:48:56,144 INFO L280 TraceCheckUtils]: 5: Hoare triple {3665#true} havoc ~j~0; {3665#true} is VALID [2020-07-18 00:48:56,144 INFO L280 TraceCheckUtils]: 6: Hoare triple {3665#true} havoc ~k~0; {3665#true} is VALID [2020-07-18 00:48:56,144 INFO L280 TraceCheckUtils]: 7: Hoare triple {3665#true} havoc ~n~0; {3665#true} is VALID [2020-07-18 00:48:56,145 INFO L280 TraceCheckUtils]: 8: Hoare triple {3665#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3665#true} is VALID [2020-07-18 00:48:56,145 INFO L280 TraceCheckUtils]: 9: Hoare triple {3665#true} ~k~0 := #t~nondet0; {3665#true} is VALID [2020-07-18 00:48:56,145 INFO L280 TraceCheckUtils]: 10: Hoare triple {3665#true} havoc #t~nondet0; {3665#true} is VALID [2020-07-18 00:48:56,145 INFO L280 TraceCheckUtils]: 11: Hoare triple {3665#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3665#true} is VALID [2020-07-18 00:48:56,146 INFO L280 TraceCheckUtils]: 12: Hoare triple {3665#true} ~n~0 := #t~nondet1; {3665#true} is VALID [2020-07-18 00:48:56,146 INFO L280 TraceCheckUtils]: 13: Hoare triple {3665#true} havoc #t~nondet1; {3665#true} is VALID [2020-07-18 00:48:56,146 INFO L280 TraceCheckUtils]: 14: Hoare triple {3665#true} assume !!(~n~0 < 1000000); {3665#true} is VALID [2020-07-18 00:48:56,147 INFO L280 TraceCheckUtils]: 15: Hoare triple {3665#true} assume ~k~0 == ~n~0; {3665#true} is VALID [2020-07-18 00:48:56,147 INFO L280 TraceCheckUtils]: 16: Hoare triple {3665#true} ~i~0 := 0; {3669#(<= main_~i~0 0)} is VALID [2020-07-18 00:48:56,149 INFO L280 TraceCheckUtils]: 17: Hoare triple {3669#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0); {3670#(<= (+ (* 2 main_~i~0) 1) main_~n~0)} is VALID [2020-07-18 00:48:56,150 INFO L280 TraceCheckUtils]: 18: Hoare triple {3670#(<= (+ (* 2 main_~i~0) 1) main_~n~0)} ~j~0 := 2 * ~i~0; {3671#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-18 00:48:56,151 INFO L280 TraceCheckUtils]: 19: Hoare triple {3671#(<= (+ main_~j~0 1) main_~n~0)} assume !!(~j~0 < ~n~0); {3671#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-18 00:48:56,152 INFO L280 TraceCheckUtils]: 20: Hoare triple {3671#(<= (+ main_~j~0 1) main_~n~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3671#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-18 00:48:56,153 INFO L280 TraceCheckUtils]: 21: Hoare triple {3671#(<= (+ main_~j~0 1) main_~n~0)} assume 0 != #t~nondet4; {3671#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-18 00:48:56,154 INFO L280 TraceCheckUtils]: 22: Hoare triple {3671#(<= (+ main_~j~0 1) main_~n~0)} havoc #t~nondet4; {3671#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-18 00:48:56,155 INFO L280 TraceCheckUtils]: 23: Hoare triple {3671#(<= (+ main_~j~0 1) main_~n~0)} ~k~0 := ~j~0; {3672#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2020-07-18 00:48:56,156 INFO L280 TraceCheckUtils]: 24: Hoare triple {3672#(<= (+ main_~k~0 1) main_~n~0)} assume !!(~k~0 < ~n~0); {3672#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2020-07-18 00:48:56,156 INFO L263 TraceCheckUtils]: 25: Hoare triple {3672#(<= (+ main_~k~0 1) main_~n~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {3665#true} is VALID [2020-07-18 00:48:56,156 INFO L280 TraceCheckUtils]: 26: Hoare triple {3665#true} ~cond := #in~cond; {3665#true} is VALID [2020-07-18 00:48:56,157 INFO L280 TraceCheckUtils]: 27: Hoare triple {3665#true} assume !(0 == ~cond); {3665#true} is VALID [2020-07-18 00:48:56,157 INFO L280 TraceCheckUtils]: 28: Hoare triple {3665#true} assume true; {3665#true} is VALID [2020-07-18 00:48:56,158 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {3665#true} {3672#(<= (+ main_~k~0 1) main_~n~0)} #110#return; {3672#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2020-07-18 00:48:56,159 INFO L280 TraceCheckUtils]: 30: Hoare triple {3672#(<= (+ main_~k~0 1) main_~n~0)} #t~post5 := ~k~0; {3677#(<= (+ |main_#t~post5| 1) main_~n~0)} is VALID [2020-07-18 00:48:56,160 INFO L280 TraceCheckUtils]: 31: Hoare triple {3677#(<= (+ |main_#t~post5| 1) main_~n~0)} ~k~0 := 1 + #t~post5; {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-18 00:48:56,161 INFO L280 TraceCheckUtils]: 32: Hoare triple {3678#(<= main_~k~0 main_~n~0)} havoc #t~post5; {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-18 00:48:56,162 INFO L280 TraceCheckUtils]: 33: Hoare triple {3678#(<= main_~k~0 main_~n~0)} assume !(~k~0 < ~n~0); {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-18 00:48:56,162 INFO L280 TraceCheckUtils]: 34: Hoare triple {3678#(<= main_~k~0 main_~n~0)} #t~post3 := ~j~0; {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-18 00:48:56,163 INFO L280 TraceCheckUtils]: 35: Hoare triple {3678#(<= main_~k~0 main_~n~0)} ~j~0 := 1 + #t~post3; {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-18 00:48:56,164 INFO L280 TraceCheckUtils]: 36: Hoare triple {3678#(<= main_~k~0 main_~n~0)} havoc #t~post3; {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-18 00:48:56,165 INFO L280 TraceCheckUtils]: 37: Hoare triple {3678#(<= main_~k~0 main_~n~0)} assume !!(~j~0 < ~n~0); {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-18 00:48:56,166 INFO L280 TraceCheckUtils]: 38: Hoare triple {3678#(<= main_~k~0 main_~n~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-18 00:48:56,167 INFO L280 TraceCheckUtils]: 39: Hoare triple {3678#(<= main_~k~0 main_~n~0)} assume !(0 != #t~nondet4); {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-18 00:48:56,168 INFO L280 TraceCheckUtils]: 40: Hoare triple {3678#(<= main_~k~0 main_~n~0)} havoc #t~nondet4; {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-18 00:48:56,168 INFO L263 TraceCheckUtils]: 41: Hoare triple {3678#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {3665#true} is VALID [2020-07-18 00:48:56,168 INFO L280 TraceCheckUtils]: 42: Hoare triple {3665#true} ~cond := #in~cond; {3665#true} is VALID [2020-07-18 00:48:56,169 INFO L280 TraceCheckUtils]: 43: Hoare triple {3665#true} assume !(0 == ~cond); {3665#true} is VALID [2020-07-18 00:48:56,169 INFO L280 TraceCheckUtils]: 44: Hoare triple {3665#true} assume true; {3665#true} is VALID [2020-07-18 00:48:56,170 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {3665#true} {3678#(<= main_~k~0 main_~n~0)} #112#return; {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-18 00:48:56,171 INFO L263 TraceCheckUtils]: 46: Hoare triple {3678#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {3683#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:56,173 INFO L280 TraceCheckUtils]: 47: Hoare triple {3683#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {3684#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:56,174 INFO L280 TraceCheckUtils]: 48: Hoare triple {3684#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3666#false} is VALID [2020-07-18 00:48:56,174 INFO L280 TraceCheckUtils]: 49: Hoare triple {3666#false} assume !false; {3666#false} is VALID [2020-07-18 00:48:56,178 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-18 00:48:56,179 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:56,179 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [937255798] [2020-07-18 00:48:56,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:56,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-18 00:48:56,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605774663] [2020-07-18 00:48:56,181 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2020-07-18 00:48:56,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:56,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-18 00:48:56,240 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-18 00:48:56,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-18 00:48:56,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:56,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-18 00:48:56,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-18 00:48:56,242 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand 10 states. [2020-07-18 00:48:57,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:57,419 INFO L93 Difference]: Finished difference Result 140 states and 165 transitions. [2020-07-18 00:48:57,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-18 00:48:57,420 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2020-07-18 00:48:57,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:57,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 00:48:57,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 83 transitions. [2020-07-18 00:48:57,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 00:48:57,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 83 transitions. [2020-07-18 00:48:57,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 83 transitions. [2020-07-18 00:48:57,514 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:57,519 INFO L225 Difference]: With dead ends: 140 [2020-07-18 00:48:57,519 INFO L226 Difference]: Without dead ends: 138 [2020-07-18 00:48:57,520 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2020-07-18 00:48:57,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-07-18 00:48:57,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 76. [2020-07-18 00:48:57,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:57,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 76 states. [2020-07-18 00:48:57,687 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 76 states. [2020-07-18 00:48:57,688 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 76 states. [2020-07-18 00:48:57,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:57,699 INFO L93 Difference]: Finished difference Result 138 states and 163 transitions. [2020-07-18 00:48:57,699 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 163 transitions. [2020-07-18 00:48:57,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:57,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:57,700 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 138 states. [2020-07-18 00:48:57,700 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 138 states. [2020-07-18 00:48:57,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:57,709 INFO L93 Difference]: Finished difference Result 138 states and 163 transitions. [2020-07-18 00:48:57,710 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 163 transitions. [2020-07-18 00:48:57,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:57,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:57,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:57,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:57,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-18 00:48:57,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2020-07-18 00:48:57,714 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 50 [2020-07-18 00:48:57,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:57,714 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2020-07-18 00:48:57,714 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-18 00:48:57,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 82 transitions. [2020-07-18 00:48:57,868 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:57,869 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2020-07-18 00:48:57,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-18 00:48:57,870 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:57,870 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:57,870 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 00:48:57,870 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:57,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:57,871 INFO L82 PathProgramCache]: Analyzing trace with hash 2033926999, now seen corresponding path program 1 times [2020-07-18 00:48:57,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:57,871 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [966241303] [2020-07-18 00:48:57,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:58,018 INFO L280 TraceCheckUtils]: 0: Hoare triple {4417#true} assume true; {4417#true} is VALID [2020-07-18 00:48:58,019 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4417#true} {4417#true} #106#return; {4417#true} is VALID [2020-07-18 00:48:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:58,025 INFO L280 TraceCheckUtils]: 0: Hoare triple {4417#true} ~cond := #in~cond; {4417#true} is VALID [2020-07-18 00:48:58,025 INFO L280 TraceCheckUtils]: 1: Hoare triple {4417#true} assume !(0 == ~cond); {4417#true} is VALID [2020-07-18 00:48:58,025 INFO L280 TraceCheckUtils]: 2: Hoare triple {4417#true} assume true; {4417#true} is VALID [2020-07-18 00:48:58,026 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4417#true} {4421#(<= (* 2 main_~i~0) main_~j~0)} #112#return; {4421#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-18 00:48:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:58,033 INFO L280 TraceCheckUtils]: 0: Hoare triple {4417#true} ~cond := #in~cond; {4417#true} is VALID [2020-07-18 00:48:58,033 INFO L280 TraceCheckUtils]: 1: Hoare triple {4417#true} assume !(0 == ~cond); {4417#true} is VALID [2020-07-18 00:48:58,034 INFO L280 TraceCheckUtils]: 2: Hoare triple {4417#true} assume true; {4417#true} is VALID [2020-07-18 00:48:58,035 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4417#true} {4421#(<= (* 2 main_~i~0) main_~j~0)} #114#return; {4421#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-18 00:48:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:58,042 INFO L280 TraceCheckUtils]: 0: Hoare triple {4417#true} ~cond := #in~cond; {4417#true} is VALID [2020-07-18 00:48:58,042 INFO L280 TraceCheckUtils]: 1: Hoare triple {4417#true} assume !(0 == ~cond); {4417#true} is VALID [2020-07-18 00:48:58,042 INFO L280 TraceCheckUtils]: 2: Hoare triple {4417#true} assume true; {4417#true} is VALID [2020-07-18 00:48:58,043 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4417#true} {4432#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} #110#return; {4432#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} is VALID [2020-07-18 00:48:58,043 INFO L263 TraceCheckUtils]: 0: Hoare triple {4417#true} call ULTIMATE.init(); {4417#true} is VALID [2020-07-18 00:48:58,043 INFO L280 TraceCheckUtils]: 1: Hoare triple {4417#true} assume true; {4417#true} is VALID [2020-07-18 00:48:58,043 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4417#true} {4417#true} #106#return; {4417#true} is VALID [2020-07-18 00:48:58,044 INFO L263 TraceCheckUtils]: 3: Hoare triple {4417#true} call #t~ret6 := main(); {4417#true} is VALID [2020-07-18 00:48:58,044 INFO L280 TraceCheckUtils]: 4: Hoare triple {4417#true} havoc ~i~0; {4417#true} is VALID [2020-07-18 00:48:58,044 INFO L280 TraceCheckUtils]: 5: Hoare triple {4417#true} havoc ~j~0; {4417#true} is VALID [2020-07-18 00:48:58,044 INFO L280 TraceCheckUtils]: 6: Hoare triple {4417#true} havoc ~k~0; {4417#true} is VALID [2020-07-18 00:48:58,044 INFO L280 TraceCheckUtils]: 7: Hoare triple {4417#true} havoc ~n~0; {4417#true} is VALID [2020-07-18 00:48:58,045 INFO L280 TraceCheckUtils]: 8: Hoare triple {4417#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4417#true} is VALID [2020-07-18 00:48:58,045 INFO L280 TraceCheckUtils]: 9: Hoare triple {4417#true} ~k~0 := #t~nondet0; {4417#true} is VALID [2020-07-18 00:48:58,045 INFO L280 TraceCheckUtils]: 10: Hoare triple {4417#true} havoc #t~nondet0; {4417#true} is VALID [2020-07-18 00:48:58,045 INFO L280 TraceCheckUtils]: 11: Hoare triple {4417#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4417#true} is VALID [2020-07-18 00:48:58,045 INFO L280 TraceCheckUtils]: 12: Hoare triple {4417#true} ~n~0 := #t~nondet1; {4417#true} is VALID [2020-07-18 00:48:58,045 INFO L280 TraceCheckUtils]: 13: Hoare triple {4417#true} havoc #t~nondet1; {4417#true} is VALID [2020-07-18 00:48:58,046 INFO L280 TraceCheckUtils]: 14: Hoare triple {4417#true} assume !!(~n~0 < 1000000); {4417#true} is VALID [2020-07-18 00:48:58,046 INFO L280 TraceCheckUtils]: 15: Hoare triple {4417#true} assume ~k~0 == ~n~0; {4417#true} is VALID [2020-07-18 00:48:58,046 INFO L280 TraceCheckUtils]: 16: Hoare triple {4417#true} ~i~0 := 0; {4417#true} is VALID [2020-07-18 00:48:58,046 INFO L280 TraceCheckUtils]: 17: Hoare triple {4417#true} assume !!(~i~0 < ~n~0); {4417#true} is VALID [2020-07-18 00:48:58,047 INFO L280 TraceCheckUtils]: 18: Hoare triple {4417#true} ~j~0 := 2 * ~i~0; {4421#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-18 00:48:58,048 INFO L280 TraceCheckUtils]: 19: Hoare triple {4421#(<= (* 2 main_~i~0) main_~j~0)} assume !!(~j~0 < ~n~0); {4421#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-18 00:48:58,048 INFO L280 TraceCheckUtils]: 20: Hoare triple {4421#(<= (* 2 main_~i~0) main_~j~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {4421#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-18 00:48:58,049 INFO L280 TraceCheckUtils]: 21: Hoare triple {4421#(<= (* 2 main_~i~0) main_~j~0)} assume !(0 != #t~nondet4); {4421#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-18 00:48:58,049 INFO L280 TraceCheckUtils]: 22: Hoare triple {4421#(<= (* 2 main_~i~0) main_~j~0)} havoc #t~nondet4; {4421#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-18 00:48:58,049 INFO L263 TraceCheckUtils]: 23: Hoare triple {4421#(<= (* 2 main_~i~0) main_~j~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {4417#true} is VALID [2020-07-18 00:48:58,049 INFO L280 TraceCheckUtils]: 24: Hoare triple {4417#true} ~cond := #in~cond; {4417#true} is VALID [2020-07-18 00:48:58,050 INFO L280 TraceCheckUtils]: 25: Hoare triple {4417#true} assume !(0 == ~cond); {4417#true} is VALID [2020-07-18 00:48:58,050 INFO L280 TraceCheckUtils]: 26: Hoare triple {4417#true} assume true; {4417#true} is VALID [2020-07-18 00:48:58,050 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {4417#true} {4421#(<= (* 2 main_~i~0) main_~j~0)} #112#return; {4421#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-18 00:48:58,050 INFO L263 TraceCheckUtils]: 28: Hoare triple {4421#(<= (* 2 main_~i~0) main_~j~0)} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {4417#true} is VALID [2020-07-18 00:48:58,051 INFO L280 TraceCheckUtils]: 29: Hoare triple {4417#true} ~cond := #in~cond; {4417#true} is VALID [2020-07-18 00:48:58,051 INFO L280 TraceCheckUtils]: 30: Hoare triple {4417#true} assume !(0 == ~cond); {4417#true} is VALID [2020-07-18 00:48:58,051 INFO L280 TraceCheckUtils]: 31: Hoare triple {4417#true} assume true; {4417#true} is VALID [2020-07-18 00:48:58,051 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {4417#true} {4421#(<= (* 2 main_~i~0) main_~j~0)} #114#return; {4421#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-18 00:48:58,052 INFO L280 TraceCheckUtils]: 33: Hoare triple {4421#(<= (* 2 main_~i~0) main_~j~0)} #t~post3 := ~j~0; {4430#(<= (* 2 main_~i~0) |main_#t~post3|)} is VALID [2020-07-18 00:48:58,053 INFO L280 TraceCheckUtils]: 34: Hoare triple {4430#(<= (* 2 main_~i~0) |main_#t~post3|)} ~j~0 := 1 + #t~post3; {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-18 00:48:58,053 INFO L280 TraceCheckUtils]: 35: Hoare triple {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} havoc #t~post3; {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-18 00:48:58,053 INFO L280 TraceCheckUtils]: 36: Hoare triple {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} assume !!(~j~0 < ~n~0); {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-18 00:48:58,054 INFO L280 TraceCheckUtils]: 37: Hoare triple {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-18 00:48:58,054 INFO L280 TraceCheckUtils]: 38: Hoare triple {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} assume 0 != #t~nondet4; {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-18 00:48:58,055 INFO L280 TraceCheckUtils]: 39: Hoare triple {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} havoc #t~nondet4; {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-18 00:48:58,055 INFO L280 TraceCheckUtils]: 40: Hoare triple {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} ~k~0 := ~j~0; {4432#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} is VALID [2020-07-18 00:48:58,055 INFO L280 TraceCheckUtils]: 41: Hoare triple {4432#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} assume !!(~k~0 < ~n~0); {4432#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} is VALID [2020-07-18 00:48:58,056 INFO L263 TraceCheckUtils]: 42: Hoare triple {4432#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {4417#true} is VALID [2020-07-18 00:48:58,056 INFO L280 TraceCheckUtils]: 43: Hoare triple {4417#true} ~cond := #in~cond; {4417#true} is VALID [2020-07-18 00:48:58,056 INFO L280 TraceCheckUtils]: 44: Hoare triple {4417#true} assume !(0 == ~cond); {4417#true} is VALID [2020-07-18 00:48:58,056 INFO L280 TraceCheckUtils]: 45: Hoare triple {4417#true} assume true; {4417#true} is VALID [2020-07-18 00:48:58,057 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {4417#true} {4432#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} #110#return; {4432#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} is VALID [2020-07-18 00:48:58,057 INFO L280 TraceCheckUtils]: 47: Hoare triple {4432#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} #t~post5 := ~k~0; {4437#(<= (+ (* 2 main_~i~0) 1) |main_#t~post5|)} is VALID [2020-07-18 00:48:58,058 INFO L280 TraceCheckUtils]: 48: Hoare triple {4437#(<= (+ (* 2 main_~i~0) 1) |main_#t~post5|)} ~k~0 := 1 + #t~post5; {4438#(<= (+ (* 2 main_~i~0) 2) main_~k~0)} is VALID [2020-07-18 00:48:58,058 INFO L280 TraceCheckUtils]: 49: Hoare triple {4438#(<= (+ (* 2 main_~i~0) 2) main_~k~0)} havoc #t~post5; {4438#(<= (+ (* 2 main_~i~0) 2) main_~k~0)} is VALID [2020-07-18 00:48:58,059 INFO L280 TraceCheckUtils]: 50: Hoare triple {4438#(<= (+ (* 2 main_~i~0) 2) main_~k~0)} assume !!(~k~0 < ~n~0); {4438#(<= (+ (* 2 main_~i~0) 2) main_~k~0)} is VALID [2020-07-18 00:48:58,065 INFO L263 TraceCheckUtils]: 51: Hoare triple {4438#(<= (+ (* 2 main_~i~0) 2) main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {4439#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:58,069 INFO L280 TraceCheckUtils]: 52: Hoare triple {4439#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {4440#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:58,070 INFO L280 TraceCheckUtils]: 53: Hoare triple {4440#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4418#false} is VALID [2020-07-18 00:48:58,071 INFO L280 TraceCheckUtils]: 54: Hoare triple {4418#false} assume !false; {4418#false} is VALID [2020-07-18 00:48:58,077 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-18 00:48:58,077 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:58,077 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [966241303] [2020-07-18 00:48:58,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:58,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-18 00:48:58,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357238800] [2020-07-18 00:48:58,078 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2020-07-18 00:48:58,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:58,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-18 00:48:58,127 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:58,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-18 00:48:58,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:58,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-18 00:48:58,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-18 00:48:58,128 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 10 states. [2020-07-18 00:48:59,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:59,352 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2020-07-18 00:48:59,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-18 00:48:59,352 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2020-07-18 00:48:59,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:59,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 00:48:59,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 97 transitions. [2020-07-18 00:48:59,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 00:48:59,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 97 transitions. [2020-07-18 00:48:59,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 97 transitions. [2020-07-18 00:48:59,472 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:59,473 INFO L225 Difference]: With dead ends: 98 [2020-07-18 00:48:59,473 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 00:48:59,474 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2020-07-18 00:48:59,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 00:48:59,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 00:48:59,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:59,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 00:48:59,475 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:48:59,475 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:48:59,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:59,476 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:48:59,476 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:48:59,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:59,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:59,476 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:48:59,476 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:48:59,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:59,477 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:48:59,477 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:48:59,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:59,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:59,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:59,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:59,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 00:48:59,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 00:48:59,478 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2020-07-18 00:48:59,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:59,478 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 00:48:59,478 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-18 00:48:59,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 00:48:59,479 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:59,479 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:48:59,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:59,479 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-18 00:48:59,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 00:49:01,058 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:49:01,058 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:49:01,059 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:49:01,059 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 00:49:01,059 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 00:49:01,059 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:49:01,059 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-18 00:49:01,059 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-18 00:49:01,059 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-18 00:49:01,059 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-18 00:49:01,059 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-18 00:49:01,060 INFO L264 CegarLoopResult]: At program point L31(lines 23 33) the Hoare annotation is: (and (<= (+ main_~j~0 1) main_~n~0) (<= main_~k~0 main_~n~0) (<= (* 2 main_~i~0) main_~j~0) (<= main_~n~0 main_~k~0)) [2020-07-18 00:49:01,060 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 37) the Hoare annotation is: true [2020-07-18 00:49:01,060 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2020-07-18 00:49:01,060 INFO L264 CegarLoopResult]: At program point L23-3(line 23) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (<= (+ main_~j~0 1) main_~n~0) (<= main_~k~0 main_~n~0) (<= .cse0 |main_#t~post3|) (<= .cse0 main_~j~0) (<= main_~n~0 main_~k~0))) [2020-07-18 00:49:01,062 INFO L264 CegarLoopResult]: At program point L23-4(line 23) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (<= (+ .cse0 1) main_~j~0) (<= main_~k~0 main_~n~0) (<= .cse0 |main_#t~post3|) (<= main_~n~0 main_~k~0))) [2020-07-18 00:49:01,062 INFO L264 CegarLoopResult]: At program point L23-5(lines 23 33) the Hoare annotation is: (and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0) (<= (* 2 main_~i~0) main_~j~0)) [2020-07-18 00:49:01,063 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-18 00:49:01,063 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-18 00:49:01,064 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-07-18 00:49:01,064 INFO L264 CegarLoopResult]: At program point L24(line 24) 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-18 00:49:01,064 INFO L264 CegarLoopResult]: At program point L24-1(lines 24 32) 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-18 00:49:01,064 INFO L264 CegarLoopResult]: At program point L24-2(line 24) 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-18 00:49:01,065 INFO L264 CegarLoopResult]: At program point L24-3(line 24) 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-18 00:49:01,065 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-18 00:49:01,065 INFO L271 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: true [2020-07-18 00:49:01,065 INFO L271 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: true [2020-07-18 00:49:01,065 INFO L264 CegarLoopResult]: At program point L25(line 25) 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-18 00:49:01,065 INFO L264 CegarLoopResult]: At program point L25-3(line 25) 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) (<= (+ |main_#t~post5| 1) main_~n~0) (<= .cse0 |main_#t~post5|) (<= .cse0 main_~j~0))) [2020-07-18 00:49:01,065 INFO L264 CegarLoopResult]: At program point L25-4(line 25) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (<= (+ .cse0 1) main_~k~0) (<= (+ main_~j~0 1) main_~n~0) (<= (+ |main_#t~post5| 1) main_~n~0) (<= main_~k~0 main_~n~0) (<= .cse0 |main_#t~post5|) (<= .cse0 main_~j~0))) [2020-07-18 00:49:01,066 INFO L264 CegarLoopResult]: At program point L25-5(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-18 00:49:01,066 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-07-18 00:49:01,066 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-07-18 00:49:01,066 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 37) the Hoare annotation is: true [2020-07-18 00:49:01,066 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-18 00:49:01,067 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 37) the Hoare annotation is: true [2020-07-18 00:49:01,067 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-18 00:49:01,067 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-18 00:49:01,067 INFO L264 CegarLoopResult]: At program point L26-1(lines 25 27) 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-18 00:49:01,067 INFO L264 CegarLoopResult]: At program point L22-2(lines 22 34) the Hoare annotation is: (and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0) (<= (* 2 main_~i~0) main_~j~0)) [2020-07-18 00:49:01,067 INFO L264 CegarLoopResult]: At program point L22-3(line 22) the Hoare annotation is: (and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0) (<= (* 2 main_~i~0) main_~j~0)) [2020-07-18 00:49:01,067 INFO L271 CegarLoopResult]: At program point L18(lines 18 21) the Hoare annotation is: true [2020-07-18 00:49:01,068 INFO L264 CegarLoopResult]: At program point L22-4(line 22) the Hoare annotation is: (and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2020-07-18 00:49:01,068 INFO L264 CegarLoopResult]: At program point L18-1(lines 18 21) the Hoare annotation is: (and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2020-07-18 00:49:01,068 INFO L264 CegarLoopResult]: At program point L22-5(lines 22 34) the Hoare annotation is: (and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2020-07-18 00:49:01,068 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-18 00:49:01,068 INFO L271 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-07-18 00:49:01,068 INFO L271 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: true [2020-07-18 00:49:01,068 INFO L271 CegarLoopResult]: At program point L35(lines 13 37) the Hoare annotation is: true [2020-07-18 00:49:01,068 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-18 00:49:01,069 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-18 00:49:01,069 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-18 00:49:01,069 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-18 00:49:01,069 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-18 00:49:01,069 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-18 00:49:01,074 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-18 00:49:01,079 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-18 00:49:01,079 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-18 00:49:01,080 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-18 00:49:01,080 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-18 00:49:01,097 INFO L163 areAnnotationChecker]: CFG has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 00:49:01,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 12:49:01 BoogieIcfgContainer [2020-07-18 00:49:01,112 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 00:49:01,116 INFO L168 Benchmark]: Toolchain (without parser) took 14224.71 ms. Allocated memory was 138.9 MB in the beginning and 348.7 MB in the end (delta: 209.7 MB). Free memory was 103.8 MB in the beginning and 147.6 MB in the end (delta: -43.8 MB). Peak memory consumption was 165.9 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:01,116 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-18 00:49:01,117 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.68 ms. Allocated memory is still 138.9 MB. Free memory was 103.4 MB in the beginning and 93.2 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:01,118 INFO L168 Benchmark]: Boogie Preprocessor took 38.77 ms. Allocated memory is still 138.9 MB. Free memory was 93.2 MB in the beginning and 91.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:01,119 INFO L168 Benchmark]: RCFGBuilder took 650.39 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 91.6 MB in the beginning and 159.9 MB in the end (delta: -68.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:01,119 INFO L168 Benchmark]: TraceAbstraction took 13226.75 ms. Allocated memory was 204.5 MB in the beginning and 348.7 MB in the end (delta: 144.2 MB). Free memory was 159.2 MB in the beginning and 147.6 MB in the end (delta: 11.6 MB). Peak memory consumption was 155.7 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:01,123 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 301.68 ms. Allocated memory is still 138.9 MB. Free memory was 103.4 MB in the beginning and 93.2 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.77 ms. Allocated memory is still 138.9 MB. Free memory was 93.2 MB in the beginning and 91.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 650.39 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 91.6 MB in the beginning and 159.9 MB in the end (delta: -68.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13226.75 ms. Allocated memory was 204.5 MB in the beginning and 348.7 MB in the end (delta: 144.2 MB). Free memory was 159.2 MB in the beginning and 147.6 MB in the end (delta: 11.6 MB). Peak memory consumption was 155.7 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: 22]: Loop Invariant Derived loop invariant: k <= n && n <= k - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (k <= n && n <= k) && 2 * i <= j - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((j + 1 <= n && 2 * i <= k) && k <= n) && 2 * i <= j - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 0 == \old(cond) || !(0 == cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 11.5s, OverallIterations: 8, TraceHistogramMax: 4, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 437 SDtfs, 342 SDslu, 1605 SDs, 0 SdLazy, 854 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred 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: 1.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 203 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 50 LocationsWithAnnotation, 152 PreInvPairs, 237 NumberOfFragments, 417 HoareAnnotationTreeSize, 152 FomulaSimplifications, 48886 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 50 FomulaSimplificationsInter, 2689 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...