/usr/bin/java -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/recursive/Ackermann01-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 16:12:02,293 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 16:12:02,298 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 16:12:02,351 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 16:12:02,351 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 16:12:02,364 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 16:12:02,365 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 16:12:02,369 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 16:12:02,371 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 16:12:02,372 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 16:12:02,373 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 16:12:02,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 16:12:02,374 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 16:12:02,375 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 16:12:02,376 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 16:12:02,378 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 16:12:02,379 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 16:12:02,380 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 16:12:02,382 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 16:12:02,384 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 16:12:02,385 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 16:12:02,387 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 16:12:02,388 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 16:12:02,389 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 16:12:02,392 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 16:12:02,392 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 16:12:02,392 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 16:12:02,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 16:12:02,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 16:12:02,395 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 16:12:02,395 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 16:12:02,396 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 16:12:02,397 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 16:12:02,398 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 16:12:02,399 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 16:12:02,399 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 16:12:02,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 16:12:02,401 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 16:12:02,401 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 16:12:02,402 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 16:12:02,403 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 16:12:02,404 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 16:12:02,417 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 16:12:02,417 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 16:12:02,419 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 16:12:02,419 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 16:12:02,420 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 16:12:02,420 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 16:12:02,420 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 16:12:02,420 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 16:12:02,421 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 16:12:02,421 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 16:12:02,421 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 16:12:02,421 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 16:12:02,421 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 16:12:02,422 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 16:12:02,422 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 16:12:02,422 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 16:12:02,422 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 16:12:02,422 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 16:12:02,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:12:02,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 16:12:02,423 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 16:12:02,423 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 16:12:02,424 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 16:12:02,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 16:12:02,886 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 16:12:02,890 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 16:12:02,894 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 16:12:02,895 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 16:12:02,896 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Ackermann01-2.c [2020-09-04 16:12:02,997 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/0aba6ee31/14cc18dcfc5a4c45b68e26c9ad062c19/FLAGbb9f480a0 [2020-09-04 16:12:03,566 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 16:12:03,567 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Ackermann01-2.c [2020-09-04 16:12:03,575 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/0aba6ee31/14cc18dcfc5a4c45b68e26c9ad062c19/FLAGbb9f480a0 [2020-09-04 16:12:03,909 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/0aba6ee31/14cc18dcfc5a4c45b68e26c9ad062c19 [2020-09-04 16:12:03,925 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 16:12:03,927 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 16:12:03,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 16:12:03,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 16:12:03,933 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 16:12:03,934 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:12:03" (1/1) ... [2020-09-04 16:12:03,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@88af870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:12:03, skipping insertion in model container [2020-09-04 16:12:03,939 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:12:03" (1/1) ... [2020-09-04 16:12:03,948 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 16:12:03,978 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 16:12:04,191 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:12:04,197 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 16:12:04,216 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:12:04,231 INFO L208 MainTranslator]: Completed translation [2020-09-04 16:12:04,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:12:04 WrapperNode [2020-09-04 16:12:04,232 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 16:12:04,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 16:12:04,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 16:12:04,233 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 16:12:04,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:12:04" (1/1) ... [2020-09-04 16:12:04,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:12:04" (1/1) ... [2020-09-04 16:12:04,334 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:12:04" (1/1) ... [2020-09-04 16:12:04,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:12:04" (1/1) ... [2020-09-04 16:12:04,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:12:04" (1/1) ... [2020-09-04 16:12:04,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:12:04" (1/1) ... [2020-09-04 16:12:04,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:12:04" (1/1) ... [2020-09-04 16:12:04,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 16:12:04,351 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 16:12:04,351 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 16:12:04,351 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 16:12:04,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:12:04" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-04 16:12:04,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 16:12:04,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 16:12:04,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2020-09-04 16:12:04,430 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 16:12:04,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 16:12:04,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 16:12:04,430 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2020-09-04 16:12:04,431 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 16:12:04,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 16:12:04,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 16:12:04,699 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 16:12:04,699 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 16:12:04,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:12:04 BoogieIcfgContainer [2020-09-04 16:12:04,707 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 16:12:04,709 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 16:12:04,709 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 16:12:04,713 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 16:12:04,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 04:12:03" (1/3) ... [2020-09-04 16:12:04,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d8950c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:12:04, skipping insertion in model container [2020-09-04 16:12:04,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:12:04" (2/3) ... [2020-09-04 16:12:04,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d8950c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:12:04, skipping insertion in model container [2020-09-04 16:12:04,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:12:04" (3/3) ... [2020-09-04 16:12:04,719 INFO L109 eAbstractionObserver]: Analyzing ICFG Ackermann01-2.c [2020-09-04 16:12:04,735 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 16:12:04,748 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 16:12:04,780 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 16:12:04,814 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 16:12:04,814 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 16:12:04,815 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 16:12:04,815 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 16:12:04,815 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 16:12:04,815 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 16:12:04,815 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 16:12:04,816 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 16:12:04,840 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-09-04 16:12:04,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 16:12:04,860 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:04,862 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] [2020-09-04 16:12:04,863 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:04,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:04,873 INFO L82 PathProgramCache]: Analyzing trace with hash -852610024, now seen corresponding path program 1 times [2020-09-04 16:12:04,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:04,884 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2080730806] [2020-09-04 16:12:04,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:04,958 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:05,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:05,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 16:12:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:05,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 16:12:05,222 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2080730806] [2020-09-04 16:12:05,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:05,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:12:05,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565128287] [2020-09-04 16:12:05,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:12:05,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:05,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:12:05,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:12:05,254 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 7 states. [2020-09-04 16:12:05,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:05,493 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2020-09-04 16:12:05,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 16:12:05,496 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-09-04 16:12:05,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:05,511 INFO L225 Difference]: With dead ends: 61 [2020-09-04 16:12:05,511 INFO L226 Difference]: Without dead ends: 39 [2020-09-04 16:12:05,516 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:12:05,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-09-04 16:12:05,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-09-04 16:12:05,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-09-04 16:12:05,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2020-09-04 16:12:05,582 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 24 [2020-09-04 16:12:05,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:05,583 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2020-09-04 16:12:05,583 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:12:05,584 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2020-09-04 16:12:05,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-04 16:12:05,587 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:05,587 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] [2020-09-04 16:12:05,588 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 16:12:05,588 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:05,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:05,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1574290279, now seen corresponding path program 1 times [2020-09-04 16:12:05,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:05,590 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1577423728] [2020-09-04 16:12:05,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:05,592 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:05,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:05,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 16:12:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:05,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:05,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 16:12:05,802 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1577423728] [2020-09-04 16:12:05,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:05,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:12:05,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105747770] [2020-09-04 16:12:05,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:12:05,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:05,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:12:05,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:12:05,806 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 8 states. [2020-09-04 16:12:06,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:06,061 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-09-04 16:12:06,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 16:12:06,062 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2020-09-04 16:12:06,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:06,064 INFO L225 Difference]: With dead ends: 50 [2020-09-04 16:12:06,064 INFO L226 Difference]: Without dead ends: 44 [2020-09-04 16:12:06,067 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-09-04 16:12:06,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-09-04 16:12:06,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-09-04 16:12:06,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-04 16:12:06,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2020-09-04 16:12:06,081 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 34 [2020-09-04 16:12:06,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:06,082 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2020-09-04 16:12:06,082 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:12:06,082 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2020-09-04 16:12:06,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-09-04 16:12:06,085 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:06,085 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2020-09-04 16:12:06,085 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 16:12:06,085 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:06,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:06,086 INFO L82 PathProgramCache]: Analyzing trace with hash 2094172607, now seen corresponding path program 1 times [2020-09-04 16:12:06,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:06,087 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1066863868] [2020-09-04 16:12:06,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:06,088 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:06,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:06,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 16:12:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:06,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:06,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 16:12:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:06,198 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-04 16:12:06,198 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1066863868] [2020-09-04 16:12:06,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:06,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:12:06,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851743632] [2020-09-04 16:12:06,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:12:06,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:06,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:12:06,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:12:06,201 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 5 states. [2020-09-04 16:12:06,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:06,280 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2020-09-04 16:12:06,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 16:12:06,281 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2020-09-04 16:12:06,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:06,283 INFO L225 Difference]: With dead ends: 73 [2020-09-04 16:12:06,283 INFO L226 Difference]: Without dead ends: 44 [2020-09-04 16:12:06,285 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:12:06,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-09-04 16:12:06,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-09-04 16:12:06,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-09-04 16:12:06,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2020-09-04 16:12:06,299 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 43 [2020-09-04 16:12:06,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:06,300 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2020-09-04 16:12:06,300 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:12:06,300 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-09-04 16:12:06,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-09-04 16:12:06,303 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:06,303 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 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-09-04 16:12:06,304 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 16:12:06,304 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:06,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:06,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1685750542, now seen corresponding path program 1 times [2020-09-04 16:12:06,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:06,305 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [870857764] [2020-09-04 16:12:06,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:06,307 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:06,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:06,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:06,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 16:12:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:06,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:06,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:06,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 16:12:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:06,586 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-09-04 16:12:06,586 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [870857764] [2020-09-04 16:12:06,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:06,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 16:12:06,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618977781] [2020-09-04 16:12:06,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 16:12:06,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:06,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 16:12:06,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-09-04 16:12:06,589 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 13 states. [2020-09-04 16:12:07,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:07,269 INFO L93 Difference]: Finished difference Result 89 states and 122 transitions. [2020-09-04 16:12:07,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 16:12:07,269 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2020-09-04 16:12:07,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:07,272 INFO L225 Difference]: With dead ends: 89 [2020-09-04 16:12:07,273 INFO L226 Difference]: Without dead ends: 83 [2020-09-04 16:12:07,274 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2020-09-04 16:12:07,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-09-04 16:12:07,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 57. [2020-09-04 16:12:07,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-09-04 16:12:07,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2020-09-04 16:12:07,296 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 53 [2020-09-04 16:12:07,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:07,297 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2020-09-04 16:12:07,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 16:12:07,297 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2020-09-04 16:12:07,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-09-04 16:12:07,300 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:07,300 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 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, 1] [2020-09-04 16:12:07,300 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 16:12:07,301 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:07,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:07,301 INFO L82 PathProgramCache]: Analyzing trace with hash 358541405, now seen corresponding path program 2 times [2020-09-04 16:12:07,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:07,302 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1919108040] [2020-09-04 16:12:07,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:07,304 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:07,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:07,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 16:12:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:07,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:07,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:07,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 16:12:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:07,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:07,465 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-09-04 16:12:07,466 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1919108040] [2020-09-04 16:12:07,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:07,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:12:07,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201923264] [2020-09-04 16:12:07,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:12:07,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:07,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:12:07,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:12:07,468 INFO L87 Difference]: Start difference. First operand 57 states and 74 transitions. Second operand 7 states. [2020-09-04 16:12:07,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:07,586 INFO L93 Difference]: Finished difference Result 125 states and 192 transitions. [2020-09-04 16:12:07,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 16:12:07,587 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2020-09-04 16:12:07,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:07,589 INFO L225 Difference]: With dead ends: 125 [2020-09-04 16:12:07,589 INFO L226 Difference]: Without dead ends: 81 [2020-09-04 16:12:07,592 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:12:07,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-09-04 16:12:07,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-09-04 16:12:07,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-09-04 16:12:07,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 110 transitions. [2020-09-04 16:12:07,612 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 110 transitions. Word has length 63 [2020-09-04 16:12:07,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:07,613 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 110 transitions. [2020-09-04 16:12:07,613 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:12:07,613 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 110 transitions. [2020-09-04 16:12:07,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-09-04 16:12:07,616 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:07,616 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 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, 1] [2020-09-04 16:12:07,616 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 16:12:07,617 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:07,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:07,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1096450289, now seen corresponding path program 3 times [2020-09-04 16:12:07,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:07,618 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [637327732] [2020-09-04 16:12:07,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:07,620 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:07,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:07,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 16:12:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:07,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:07,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:07,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:07,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 16:12:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:07,897 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:07,897 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [637327732] [2020-09-04 16:12:07,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:07,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 16:12:07,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057170087] [2020-09-04 16:12:07,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 16:12:07,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:07,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 16:12:07,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:12:07,900 INFO L87 Difference]: Start difference. First operand 81 states and 110 transitions. Second operand 14 states. [2020-09-04 16:12:08,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:08,516 INFO L93 Difference]: Finished difference Result 157 states and 248 transitions. [2020-09-04 16:12:08,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 16:12:08,516 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2020-09-04 16:12:08,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:08,520 INFO L225 Difference]: With dead ends: 157 [2020-09-04 16:12:08,520 INFO L226 Difference]: Without dead ends: 151 [2020-09-04 16:12:08,522 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2020-09-04 16:12:08,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-09-04 16:12:08,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 79. [2020-09-04 16:12:08,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-09-04 16:12:08,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 104 transitions. [2020-09-04 16:12:08,552 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 104 transitions. Word has length 63 [2020-09-04 16:12:08,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:08,553 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 104 transitions. [2020-09-04 16:12:08,553 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 16:12:08,553 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 104 transitions. [2020-09-04 16:12:08,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-09-04 16:12:08,556 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:08,557 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 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] [2020-09-04 16:12:08,557 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 16:12:08,557 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:08,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:08,558 INFO L82 PathProgramCache]: Analyzing trace with hash 449882030, now seen corresponding path program 4 times [2020-09-04 16:12:08,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:08,558 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1643476243] [2020-09-04 16:12:08,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:08,560 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 16:12:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-09-04 16:12:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,657 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2020-09-04 16:12:08,658 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1643476243] [2020-09-04 16:12:08,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:08,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 16:12:08,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848720581] [2020-09-04 16:12:08,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 16:12:08,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:08,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 16:12:08,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 16:12:08,660 INFO L87 Difference]: Start difference. First operand 79 states and 104 transitions. Second operand 4 states. [2020-09-04 16:12:08,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:08,711 INFO L93 Difference]: Finished difference Result 144 states and 218 transitions. [2020-09-04 16:12:08,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 16:12:08,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2020-09-04 16:12:08,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:08,714 INFO L225 Difference]: With dead ends: 144 [2020-09-04 16:12:08,714 INFO L226 Difference]: Without dead ends: 78 [2020-09-04 16:12:08,715 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:12:08,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-09-04 16:12:08,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-09-04 16:12:08,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-09-04 16:12:08,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 104 transitions. [2020-09-04 16:12:08,733 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 104 transitions. Word has length 73 [2020-09-04 16:12:08,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:08,734 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 104 transitions. [2020-09-04 16:12:08,734 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 16:12:08,734 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 104 transitions. [2020-09-04 16:12:08,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-09-04 16:12:08,735 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:08,736 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:12:08,736 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 16:12:08,736 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:08,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:08,737 INFO L82 PathProgramCache]: Analyzing trace with hash 990403329, now seen corresponding path program 5 times [2020-09-04 16:12:08,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:08,737 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1220035432] [2020-09-04 16:12:08,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:08,739 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 16:12:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 16:12:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:09,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-09-04 16:12:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:09,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:09,041 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 18 proven. 13 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-09-04 16:12:09,042 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1220035432] [2020-09-04 16:12:09,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:09,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-09-04 16:12:09,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646703090] [2020-09-04 16:12:09,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 16:12:09,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:09,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 16:12:09,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-09-04 16:12:09,044 INFO L87 Difference]: Start difference. First operand 78 states and 104 transitions. Second operand 16 states. [2020-09-04 16:12:09,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:09,799 INFO L93 Difference]: Finished difference Result 146 states and 235 transitions. [2020-09-04 16:12:09,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-09-04 16:12:09,800 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 92 [2020-09-04 16:12:09,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:09,801 INFO L225 Difference]: With dead ends: 146 [2020-09-04 16:12:09,801 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 16:12:09,804 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=318, Invalid=1242, Unknown=0, NotChecked=0, Total=1560 [2020-09-04 16:12:09,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 16:12:09,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 16:12:09,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 16:12:09,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 16:12:09,805 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2020-09-04 16:12:09,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:09,805 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 16:12:09,805 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 16:12:09,805 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 16:12:09,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 16:12:09,806 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 16:12:09,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 16:12:12,956 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 24 [2020-09-04 16:12:13,355 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 25 [2020-09-04 16:12:13,536 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 25 [2020-09-04 16:12:13,748 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 28 [2020-09-04 16:12:13,880 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 18 [2020-09-04 16:12:13,999 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 18 [2020-09-04 16:12:14,175 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 28 [2020-09-04 16:12:14,451 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 26 [2020-09-04 16:12:14,664 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 26 [2020-09-04 16:12:14,669 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:12:14,670 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:12:14,674 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:12:14,674 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 16:12:14,674 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 16:12:14,674 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:12:14,676 INFO L264 CegarLoopResult]: At program point ackermannEXIT(lines 15 23) the Hoare annotation is: (let ((.cse0 (= ackermann_~m |ackermann_#in~m|)) (.cse1 (= ackermann_~n |ackermann_#in~n|)) (.cse2 (= |ackermann_#in~m| 0))) (and (or (and (<= (+ |ackermann_#in~n| 1) |ackermann_#res|) .cse0 .cse1) (not .cse2)) (let ((.cse3 (<= 1 |ackermann_#in~m|))) (or (and (<= 2 |ackermann_#res|) (= |ackermann_#in~n| 0) (<= ackermann_~m 1) .cse3 .cse0 .cse1) (and .cse3 .cse0 (<= 3 |ackermann_#res|) .cse1) .cse2)))) [2020-09-04 16:12:14,676 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (and (not (= ackermann_~m 0)) (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|)) [2020-09-04 16:12:14,676 INFO L271 CegarLoopResult]: At program point ackermannENTRY(lines 15 23) the Hoare annotation is: true [2020-09-04 16:12:14,677 INFO L264 CegarLoopResult]: At program point L22-1(line 22) the Hoare annotation is: (let ((.cse0 (<= 3 |ackermann_#t~ret1|))) (and (let ((.cse3 (= ackermann_~n |ackermann_#in~n|)) (.cse1 (<= 1 |ackermann_#in~m|)) (.cse2 (= ackermann_~m |ackermann_#in~m|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= 2 |ackermann_#t~ret1|) (<= ackermann_~m 1) .cse3 .cse1 .cse2))) (or (= |ackermann_#in~n| 1) .cse0 (and (<= 2 |ackermann_#res|) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))))) [2020-09-04 16:12:14,677 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (= |ackermann_#in~n| 0) (not (= ackermann_~m 0)) (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|)) [2020-09-04 16:12:14,677 INFO L264 CegarLoopResult]: At program point L22-2(line 22) the Hoare annotation is: (let ((.cse0 (<= 3 |ackermann_#t~ret1|))) (and (let ((.cse3 (= ackermann_~n |ackermann_#in~n|)) (.cse1 (<= 1 |ackermann_#in~m|)) (.cse2 (= ackermann_~m |ackermann_#in~m|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= 2 |ackermann_#t~ret1|) (<= ackermann_~m 1) .cse3 .cse1 .cse2))) (or (= |ackermann_#in~n| 1) .cse0 (and (<= 2 |ackermann_#res|) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))))) [2020-09-04 16:12:14,678 INFO L264 CegarLoopResult]: At program point L19(lines 19 21) the Hoare annotation is: (and (not (= ackermann_~m 0)) (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|)) [2020-09-04 16:12:14,678 INFO L264 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: (and (or (<= 3 |ackermann_#t~ret0|) (<= ackermann_~m 1)) (= |ackermann_#in~n| 0) (<= 2 |ackermann_#t~ret0|) (<= 1 |ackermann_#in~m|) (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|)) [2020-09-04 16:12:14,678 INFO L264 CegarLoopResult]: At program point L22-3(line 22) the Hoare annotation is: (let ((.cse0 (<= 3 |ackermann_#t~ret1|))) (and (or (= |ackermann_#in~n| 1) .cse0 (and (<= 2 |ackermann_#res|) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))) (<= 3 |ackermann_#t~ret2|) (let ((.cse1 (<= 1 |ackermann_#in~m|))) (or (and (<= 2 |ackermann_#t~ret1|) (<= ackermann_~m 1) .cse1) (and .cse0 .cse1))) (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|))) [2020-09-04 16:12:14,678 INFO L264 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (and (or (<= 3 |ackermann_#t~ret0|) (<= ackermann_~m 1)) (= |ackermann_#in~n| 0) (<= 2 |ackermann_#t~ret0|) (<= 1 |ackermann_#in~m|) (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|)) [2020-09-04 16:12:14,678 INFO L264 CegarLoopResult]: At program point L22-4(line 22) the Hoare annotation is: (let ((.cse0 (<= 3 |ackermann_#t~ret1|))) (and (or (= |ackermann_#in~n| 1) .cse0 (and (<= 2 |ackermann_#res|) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))) (<= 3 |ackermann_#t~ret2|) (let ((.cse1 (<= 1 |ackermann_#in~m|))) (or (and (<= 2 |ackermann_#t~ret1|) (<= ackermann_~m 1) .cse1) (and .cse0 .cse1))) (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|))) [2020-09-04 16:12:14,679 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|) (= |ackermann_#in~m| 0)) [2020-09-04 16:12:14,679 INFO L264 CegarLoopResult]: At program point L20-3(line 20) the Hoare annotation is: (and (<= 2 |ackermann_#res|) (= |ackermann_#in~n| 0) (or (<= ackermann_~m 1) (and (<= 3 |ackermann_#t~ret0|) (<= 3 |ackermann_#res|))) (<= 2 |ackermann_#t~ret0|) (<= 1 |ackermann_#in~m|) (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|)) [2020-09-04 16:12:14,679 INFO L264 CegarLoopResult]: At program point L22-5(line 22) the Hoare annotation is: (and (<= 3 |ackermann_#t~ret2|) (let ((.cse0 (<= 1 |ackermann_#in~m|))) (or (and (<= 2 |ackermann_#t~ret1|) (<= ackermann_~m 1) .cse0) (and (<= 3 |ackermann_#t~ret1|) .cse0))) (<= 3 |ackermann_#res|) (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|)) [2020-09-04 16:12:14,679 INFO L264 CegarLoopResult]: At program point L16(lines 16 18) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|)) [2020-09-04 16:12:14,679 INFO L264 CegarLoopResult]: At program point L22-6(line 22) the Hoare annotation is: (and (let ((.cse0 (<= 1 |ackermann_#in~m|))) (or (and (<= 2 |ackermann_#t~ret1|) (<= ackermann_~m 1) .cse0) (and (<= 3 |ackermann_#t~ret1|) .cse0))) (<= 3 |ackermann_#res|) (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|)) [2020-09-04 16:12:14,679 INFO L264 CegarLoopResult]: At program point L15(lines 15 23) the Hoare annotation is: (= ackermann_~m |ackermann_#in~m|) [2020-09-04 16:12:14,680 INFO L264 CegarLoopResult]: At program point ackermannFINAL(lines 15 23) the Hoare annotation is: (let ((.cse0 (= ackermann_~m |ackermann_#in~m|)) (.cse1 (= ackermann_~n |ackermann_#in~n|)) (.cse2 (= |ackermann_#in~m| 0))) (and (or (and (<= (+ |ackermann_#in~n| 1) |ackermann_#res|) .cse0 .cse1) (not .cse2)) (let ((.cse3 (<= 1 |ackermann_#in~m|))) (or (and (<= 2 |ackermann_#res|) (= |ackermann_#in~n| 0) (<= ackermann_~m 1) .cse3 .cse0 .cse1) (and .cse3 .cse0 (<= 3 |ackermann_#res|) .cse1) .cse2)))) [2020-09-04 16:12:14,680 INFO L271 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-09-04 16:12:14,680 INFO L271 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: true [2020-09-04 16:12:14,680 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-09-04 16:12:14,680 INFO L271 CegarLoopResult]: At program point L33-2(line 33) the Hoare annotation is: true [2020-09-04 16:12:14,680 INFO L271 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-09-04 16:12:14,681 INFO L271 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: true [2020-09-04 16:12:14,681 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 26 46) the Hoare annotation is: true [2020-09-04 16:12:14,681 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 26 46) the Hoare annotation is: true [2020-09-04 16:12:14,681 INFO L264 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: false [2020-09-04 16:12:14,682 INFO L264 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (<= 0 main_~n~0) [2020-09-04 16:12:14,682 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (<= 0 main_~n~0) [2020-09-04 16:12:14,682 INFO L264 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (and (<= 0 main_~n~0) (<= 1 |main_#t~ret5|)) [2020-09-04 16:12:14,682 INFO L271 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: true [2020-09-04 16:12:14,682 INFO L264 CegarLoopResult]: At program point L40-2(line 40) the Hoare annotation is: (and (<= 0 main_~n~0) (<= 1 |main_#t~ret5|)) [2020-09-04 16:12:14,682 INFO L264 CegarLoopResult]: At program point L40-3(line 40) the Hoare annotation is: (and (<= 0 main_~n~0) (<= 1 |main_#t~ret5|) (<= 1 main_~result~0)) [2020-09-04 16:12:14,683 INFO L271 CegarLoopResult]: At program point L34(lines 34 39) the Hoare annotation is: true [2020-09-04 16:12:14,683 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) the Hoare annotation is: false [2020-09-04 16:12:14,683 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 26 46) the Hoare annotation is: true [2020-09-04 16:12:14,683 INFO L271 CegarLoopResult]: At program point L28(lines 28 32) the Hoare annotation is: true [2020-09-04 16:12:14,683 INFO L264 CegarLoopResult]: At program point L41(lines 41 45) the Hoare annotation is: (and (<= 0 main_~n~0) (<= 1 main_~result~0)) [2020-09-04 16:12:14,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 04:12:14 BoogieIcfgContainer [2020-09-04 16:12:14,708 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 16:12:14,710 INFO L168 Benchmark]: Toolchain (without parser) took 10783.25 ms. Allocated memory was 140.0 MB in the beginning and 314.6 MB in the end (delta: 174.6 MB). Free memory was 103.6 MB in the beginning and 175.4 MB in the end (delta: -71.8 MB). Peak memory consumption was 161.2 MB. Max. memory is 7.1 GB. [2020-09-04 16:12:14,710 INFO L168 Benchmark]: CDTParser took 1.07 ms. Allocated memory is still 140.0 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 16:12:14,711 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.05 ms. Allocated memory is still 140.0 MB. Free memory was 103.4 MB in the beginning and 93.9 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-09-04 16:12:14,712 INFO L168 Benchmark]: Boogie Preprocessor took 117.97 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 93.9 MB in the beginning and 182.8 MB in the end (delta: -88.9 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2020-09-04 16:12:14,713 INFO L168 Benchmark]: RCFGBuilder took 356.90 ms. Allocated memory is still 203.9 MB. Free memory was 182.8 MB in the beginning and 168.5 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2020-09-04 16:12:14,714 INFO L168 Benchmark]: TraceAbstraction took 9998.59 ms. Allocated memory was 203.9 MB in the beginning and 314.6 MB in the end (delta: 110.6 MB). Free memory was 167.9 MB in the beginning and 175.4 MB in the end (delta: -7.5 MB). Peak memory consumption was 161.6 MB. Max. memory is 7.1 GB. [2020-09-04 16:12:14,717 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.07 ms. Allocated memory is still 140.0 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 304.05 ms. Allocated memory is still 140.0 MB. Free memory was 103.4 MB in the beginning and 93.9 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.97 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 93.9 MB in the beginning and 182.8 MB in the end (delta: -88.9 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 356.90 ms. Allocated memory is still 203.9 MB. Free memory was 182.8 MB in the beginning and 168.5 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9998.59 ms. Allocated memory was 203.9 MB in the beginning and 314.6 MB in the end (delta: 110.6 MB). Free memory was 167.9 MB in the beginning and 175.4 MB in the end (delta: -7.5 MB). Peak memory consumption was 161.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: 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 - ProcedureContractResult [Line: 15]: Procedure Contract for ackermann Derived contract for procedure ackermann: (((\old(n) + 1 <= \result && m == \old(m)) && n == \old(n)) || !(\old(m) == 0)) && (((((((2 <= \result && \old(n) == 0) && m <= 1) && 1 <= \old(m)) && m == \old(m)) && n == \old(n)) || (((1 <= \old(m) && m == \old(m)) && 3 <= \result) && n == \old(n))) || \old(m) == 0) - ProcedureContractResult [Line: 26]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.9s, OverallIterations: 8, TraceHistogramMax: 8, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 289 SDtfs, 352 SDslu, 1204 SDs, 0 SdLazy, 1288 SolverSat, 227 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 100 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 44 LocationsWithAnnotation, 566 PreInvPairs, 1015 NumberOfFragments, 539 HoareAnnotationTreeSize, 566 FomulaSimplifications, 76054 FormulaSimplificationTreeSizeReduction, 2.8s HoareSimplificationTime, 44 FomulaSimplificationsInter, 2584 FormulaSimplificationTreeSizeReductionInter, 1.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...