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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci04.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:51:32,105 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:51:32,108 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:51:32,126 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:51:32,126 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:51:32,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:51:32,130 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:51:32,140 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:51:32,144 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:51:32,147 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:51:32,149 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:51:32,151 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:51:32,152 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:51:32,153 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:51:32,156 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:51:32,157 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:51:32,158 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:51:32,160 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:51:32,162 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:51:32,167 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:51:32,172 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:51:32,174 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:51:32,177 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:51:32,177 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:51:32,179 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:51:32,179 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:51:32,180 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:51:32,180 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:51:32,181 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:51:32,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:51:32,182 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:51:32,183 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:51:32,183 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:51:32,184 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:51:32,185 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:51:32,185 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:51:32,186 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:51:32,186 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:51:32,186 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:51:32,187 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:51:32,188 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:51:32,189 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:51:32,225 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:51:32,225 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:51:32,225 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:51:32,226 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:51:32,229 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:51:32,230 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:51:32,230 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:51:32,230 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:51:32,230 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:51:32,230 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:51:32,233 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:51:32,233 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:51:32,234 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:51:32,234 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:51:32,234 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:51:32,234 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:51:32,234 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:51:32,235 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:51:32,235 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:51:32,235 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:51:32,235 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:51:32,235 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:51:32,235 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:51:32,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:51:32,236 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:51:32,238 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:51:32,238 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:51:32,239 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:51:32,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:51:32,239 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:51:32,272 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:51:32,287 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:51:32,292 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:51:32,294 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:51:32,294 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:51:32,296 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci04.c [2019-09-10 02:51:32,355 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9781828a/4716381f7214455ab1119e2d04fa2ef1/FLAG5537738f0 [2019-09-10 02:51:32,756 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:51:32,757 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci04.c [2019-09-10 02:51:32,763 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9781828a/4716381f7214455ab1119e2d04fa2ef1/FLAG5537738f0 [2019-09-10 02:51:33,191 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9781828a/4716381f7214455ab1119e2d04fa2ef1 [2019-09-10 02:51:33,200 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:51:33,201 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:51:33,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:51:33,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:51:33,206 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:51:33,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:51:33" (1/1) ... [2019-09-10 02:51:33,211 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c5e3a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:33, skipping insertion in model container [2019-09-10 02:51:33,212 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:51:33" (1/1) ... [2019-09-10 02:51:33,220 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:51:33,240 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:51:33,487 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:51:33,492 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:51:33,516 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:51:33,533 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:51:33,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:33 WrapperNode [2019-09-10 02:51:33,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:51:33,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:51:33,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:51:33,535 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:51:33,636 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:33" (1/1) ... [2019-09-10 02:51:33,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:33" (1/1) ... [2019-09-10 02:51:33,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:33" (1/1) ... [2019-09-10 02:51:33,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:33" (1/1) ... [2019-09-10 02:51:33,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:33" (1/1) ... [2019-09-10 02:51:33,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:33" (1/1) ... [2019-09-10 02:51:33,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:33" (1/1) ... [2019-09-10 02:51:33,665 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:51:33,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:51:33,666 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:51:33,666 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:51:33,667 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:33" (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 [2019-09-10 02:51:33,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:51:33,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:51:33,738 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2019-09-10 02:51:33,738 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:51:33,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:51:33,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:51:33,739 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2019-09-10 02:51:33,740 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:51:33,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:51:33,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:51:33,978 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:51:33,978 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 02:51:33,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:51:33 BoogieIcfgContainer [2019-09-10 02:51:33,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:51:33,985 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:51:33,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:51:33,993 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:51:33,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:51:33" (1/3) ... [2019-09-10 02:51:33,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d5f6101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:51:33, skipping insertion in model container [2019-09-10 02:51:33,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:33" (2/3) ... [2019-09-10 02:51:33,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d5f6101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:51:33, skipping insertion in model container [2019-09-10 02:51:33,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:51:33" (3/3) ... [2019-09-10 02:51:33,998 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2019-09-10 02:51:34,020 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:51:34,029 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:51:34,059 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:51:34,102 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:51:34,102 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:51:34,104 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:51:34,104 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:51:34,105 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:51:34,105 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:51:34,105 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:51:34,105 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:51:34,118 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-09-10 02:51:34,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 02:51:34,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:34,129 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:34,131 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:34,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:34,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2019-09-10 02:51:34,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:34,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:34,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:34,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:34,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:34,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:51:34,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:51:34,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:51:34,329 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:51:34,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:51:34,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:51:34,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:51:34,347 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2019-09-10 02:51:34,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:34,493 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2019-09-10 02:51:34,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:51:34,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-10 02:51:34,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:34,503 INFO L225 Difference]: With dead ends: 29 [2019-09-10 02:51:34,504 INFO L226 Difference]: Without dead ends: 21 [2019-09-10 02:51:34,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:51:34,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-10 02:51:34,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-10 02:51:34,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-10 02:51:34,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-09-10 02:51:34,549 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2019-09-10 02:51:34,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:34,550 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-09-10 02:51:34,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:51:34,550 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-09-10 02:51:34,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-10 02:51:34,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:34,552 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:34,553 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:34,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:34,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2019-09-10 02:51:34,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:34,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:34,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:34,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:34,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:34,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:51:34,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:51:34,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:51:34,602 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:51:34,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:51:34,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:51:34,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:51:34,605 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2019-09-10 02:51:34,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:34,686 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2019-09-10 02:51:34,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:51:34,687 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-10 02:51:34,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:34,688 INFO L225 Difference]: With dead ends: 25 [2019-09-10 02:51:34,689 INFO L226 Difference]: Without dead ends: 23 [2019-09-10 02:51:34,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:51:34,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-10 02:51:34,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2019-09-10 02:51:34,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-10 02:51:34,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-09-10 02:51:34,697 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2019-09-10 02:51:34,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:34,698 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-09-10 02:51:34,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:51:34,698 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-09-10 02:51:34,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-10 02:51:34,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:34,700 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:34,700 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:34,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:34,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2019-09-10 02:51:34,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:34,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:34,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:34,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:34,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:34,779 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:51:34,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:34,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:34,781 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2019-09-10 02:51:34,783 INFO L207 CegarAbsIntRunner]: [0], [3], [4], [8], [10], [12], [13], [14], [18], [20], [24], [26], [29], [30], [31], [32], [33], [34], [35], [37], [38] [2019-09-10 02:51:34,823 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:51:34,824 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:51:34,947 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:51:34,949 INFO L272 AbstractInterpreter]: Visited 16 different actions 31 times. Never merged. Never widened. Performed 29 root evaluator evaluations with a maximum evaluation depth of 5. Performed 29 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2019-09-10 02:51:34,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:34,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:51:34,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:34,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:51:34,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:34,964 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:51:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:34,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 02:51:34,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:35,072 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:51:35,073 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:35,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:35,317 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:51:35,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:35,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2019-09-10 02:51:35,325 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:35,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:51:35,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:51:35,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:51:35,328 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 8 states. [2019-09-10 02:51:35,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:35,457 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-09-10 02:51:35,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:51:35,457 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-09-10 02:51:35,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:35,459 INFO L225 Difference]: With dead ends: 23 [2019-09-10 02:51:35,459 INFO L226 Difference]: Without dead ends: 23 [2019-09-10 02:51:35,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:51:35,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-10 02:51:35,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-10 02:51:35,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-10 02:51:35,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-09-10 02:51:35,466 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2019-09-10 02:51:35,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:35,466 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-09-10 02:51:35,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:51:35,467 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-09-10 02:51:35,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-10 02:51:35,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:35,468 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:35,469 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:35,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:35,469 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2019-09-10 02:51:35,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:35,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:35,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:35,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:35,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:35,537 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 02:51:35,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:35,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:35,537 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2019-09-10 02:51:35,538 INFO L207 CegarAbsIntRunner]: [0], [3], [4], [7], [8], [10], [12], [13], [14], [18], [20], [24], [26], [29], [30], [31], [32], [33], [34], [35], [37], [38] [2019-09-10 02:51:35,540 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:51:35,540 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:51:36,692 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:51:36,694 INFO L272 AbstractInterpreter]: Visited 22 different actions 5889 times. Merged at 10 different actions 1507 times. Never widened. Performed 7203 root evaluator evaluations with a maximum evaluation depth of 5. Performed 7203 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 635 fixpoints after 5 different actions. Largest state had 5 variables. [2019-09-10 02:51:36,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:36,694 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:51:36,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:36,695 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:51:36,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:36,709 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:51:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:36,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 02:51:36,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:36,734 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 02:51:36,734 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:36,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:36,925 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:51:36,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:36,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2019-09-10 02:51:36,930 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:36,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:51:36,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:51:36,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:51:36,931 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2019-09-10 02:51:37,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:37,014 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2019-09-10 02:51:37,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:51:37,014 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-09-10 02:51:37,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:37,016 INFO L225 Difference]: With dead ends: 30 [2019-09-10 02:51:37,017 INFO L226 Difference]: Without dead ends: 28 [2019-09-10 02:51:37,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:51:37,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-10 02:51:37,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-10 02:51:37,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-10 02:51:37,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2019-09-10 02:51:37,025 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 27 [2019-09-10 02:51:37,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:37,026 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-09-10 02:51:37,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:51:37,026 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2019-09-10 02:51:37,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-10 02:51:37,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:37,029 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:37,029 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:37,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:37,030 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2019-09-10 02:51:37,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:37,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:37,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:37,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:37,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:37,207 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 02:51:37,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:37,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:37,208 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:51:37,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:51:37,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:37,209 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:51:37,222 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:51:37,223 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:51:37,237 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-10 02:51:37,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:51:37,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 02:51:37,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:37,271 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-10 02:51:37,272 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:37,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:37,473 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 02:51:37,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:37,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 15 [2019-09-10 02:51:37,478 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:37,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:51:37,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:51:37,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:51:37,480 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 11 states. [2019-09-10 02:51:37,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:37,777 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2019-09-10 02:51:37,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:51:37,777 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2019-09-10 02:51:37,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:37,781 INFO L225 Difference]: With dead ends: 34 [2019-09-10 02:51:37,782 INFO L226 Difference]: Without dead ends: 34 [2019-09-10 02:51:37,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-09-10 02:51:37,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-10 02:51:37,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2019-09-10 02:51:37,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-10 02:51:37,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-09-10 02:51:37,795 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 40 [2019-09-10 02:51:37,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:37,796 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-09-10 02:51:37,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:51:37,796 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2019-09-10 02:51:37,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-10 02:51:37,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:37,802 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:37,802 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:37,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:37,803 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2019-09-10 02:51:37,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:37,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:37,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:51:37,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:37,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:37,922 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 02:51:37,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:37,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:37,923 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:51:37,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:51:37,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:37,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:51:37,937 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:51:37,937 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:51:37,958 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:51:37,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:51:37,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 02:51:37,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:37,985 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 02:51:37,986 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:38,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:38,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:38,266 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 02:51:38,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:38,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 12 [2019-09-10 02:51:38,271 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:38,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:51:38,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:51:38,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:51:38,272 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand 7 states. [2019-09-10 02:51:38,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:38,384 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2019-09-10 02:51:38,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:51:38,384 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-09-10 02:51:38,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:38,386 INFO L225 Difference]: With dead ends: 35 [2019-09-10 02:51:38,386 INFO L226 Difference]: Without dead ends: 33 [2019-09-10 02:51:38,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 77 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:51:38,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-10 02:51:38,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-10 02:51:38,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-10 02:51:38,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2019-09-10 02:51:38,394 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 41 [2019-09-10 02:51:38,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:38,395 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2019-09-10 02:51:38,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:51:38,395 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2019-09-10 02:51:38,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 02:51:38,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:38,412 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:38,413 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:38,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:38,413 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 4 times [2019-09-10 02:51:38,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:38,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:38,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:51:38,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:38,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:38,544 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 46 proven. 109 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-09-10 02:51:38,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:38,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:38,545 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:51:38,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:51:38,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:38,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:51:38,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:38,564 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:51:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:38,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 02:51:38,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:38,655 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-09-10 02:51:38,656 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:39,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:39,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:39,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:39,199 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 181 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2019-09-10 02:51:39,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:39,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 11] total 12 [2019-09-10 02:51:39,204 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:39,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:51:39,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:51:39,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:51:39,206 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand 8 states. [2019-09-10 02:51:39,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:39,336 INFO L93 Difference]: Finished difference Result 40 states and 62 transitions. [2019-09-10 02:51:39,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:51:39,336 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-09-10 02:51:39,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:39,339 INFO L225 Difference]: With dead ends: 40 [2019-09-10 02:51:39,339 INFO L226 Difference]: Without dead ends: 38 [2019-09-10 02:51:39,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 181 SyntacticMatches, 9 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:51:39,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-10 02:51:39,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-09-10 02:51:39,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-10 02:51:39,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 60 transitions. [2019-09-10 02:51:39,349 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 60 transitions. Word has length 96 [2019-09-10 02:51:39,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:39,351 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 60 transitions. [2019-09-10 02:51:39,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:51:39,351 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 60 transitions. [2019-09-10 02:51:39,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 02:51:39,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:39,356 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:39,356 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:39,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:39,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 5 times [2019-09-10 02:51:39,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:39,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:39,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:39,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:39,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:39,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 274 proven. 117 refuted. 0 times theorem prover too weak. 765 trivial. 0 not checked. [2019-09-10 02:51:39,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:39,619 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:39,619 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:51:39,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:51:39,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:39,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:51:39,637 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:51:39,638 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:51:39,676 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-10 02:51:39,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:51:39,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 02:51:39,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:39,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 393 proven. 34 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-10 02:51:39,742 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:40,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:40,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:40,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 393 proven. 41 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2019-09-10 02:51:40,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:40,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 11] total 20 [2019-09-10 02:51:40,488 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:40,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 02:51:40,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 02:51:40,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2019-09-10 02:51:40,492 INFO L87 Difference]: Start difference. First operand 38 states and 60 transitions. Second operand 15 states. [2019-09-10 02:51:40,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:40,935 INFO L93 Difference]: Finished difference Result 95 states and 220 transitions. [2019-09-10 02:51:40,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 02:51:40,935 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 150 [2019-09-10 02:51:40,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:40,938 INFO L225 Difference]: With dead ends: 95 [2019-09-10 02:51:40,938 INFO L226 Difference]: Without dead ends: 47 [2019-09-10 02:51:40,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 286 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=585, Unknown=0, NotChecked=0, Total=812 [2019-09-10 02:51:40,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-10 02:51:40,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-09-10 02:51:40,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-10 02:51:40,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2019-09-10 02:51:40,946 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 150 [2019-09-10 02:51:40,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:40,946 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2019-09-10 02:51:40,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 02:51:40,947 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2019-09-10 02:51:40,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 02:51:40,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:40,949 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:40,949 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:40,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:40,949 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 6 times [2019-09-10 02:51:40,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:40,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:40,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:51:40,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:40,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 02:51:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 02:51:41,009 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-10 02:51:41,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:51:41 BoogieIcfgContainer [2019-09-10 02:51:41,045 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:51:41,048 INFO L168 Benchmark]: Toolchain (without parser) took 7846.32 ms. Allocated memory was 136.3 MB in the beginning and 327.2 MB in the end (delta: 190.8 MB). Free memory was 92.7 MB in the beginning and 177.1 MB in the end (delta: -84.5 MB). Peak memory consumption was 106.4 MB. Max. memory is 7.1 GB. [2019-09-10 02:51:41,049 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 136.3 MB. Free memory was 110.8 MB in the beginning and 110.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-09-10 02:51:41,050 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.09 ms. Allocated memory is still 136.3 MB. Free memory was 92.5 MB in the beginning and 83.3 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-09-10 02:51:41,051 INFO L168 Benchmark]: Boogie Preprocessor took 130.51 ms. Allocated memory was 136.3 MB in the beginning and 198.2 MB in the end (delta: 61.9 MB). Free memory was 83.3 MB in the beginning and 174.9 MB in the end (delta: -91.6 MB). Peak memory consumption was 16.4 MB. Max. memory is 7.1 GB. [2019-09-10 02:51:41,051 INFO L168 Benchmark]: RCFGBuilder took 317.89 ms. Allocated memory is still 198.2 MB. Free memory was 174.9 MB in the beginning and 163.8 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2019-09-10 02:51:41,052 INFO L168 Benchmark]: TraceAbstraction took 7060.90 ms. Allocated memory was 198.2 MB in the beginning and 327.2 MB in the end (delta: 129.0 MB). Free memory was 163.2 MB in the beginning and 177.1 MB in the end (delta: -13.9 MB). Peak memory consumption was 115.0 MB. Max. memory is 7.1 GB. [2019-09-10 02:51:41,057 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 136.3 MB. Free memory was 110.8 MB in the beginning and 110.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 332.09 ms. Allocated memory is still 136.3 MB. Free memory was 92.5 MB in the beginning and 83.3 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 130.51 ms. Allocated memory was 136.3 MB in the beginning and 198.2 MB in the end (delta: 61.9 MB). Free memory was 83.3 MB in the beginning and 174.9 MB in the end (delta: -91.6 MB). Peak memory consumption was 16.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 317.89 ms. Allocated memory is still 198.2 MB. Free memory was 174.9 MB in the beginning and 163.8 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7060.90 ms. Allocated memory was 198.2 MB in the beginning and 327.2 MB in the end (delta: 129.0 MB). Free memory was 163.2 MB in the beginning and 177.1 MB in the end (delta: -13.9 MB). Peak memory consumption was 115.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 33]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) VAL [fibonacci(x)=5, x=5] [L29] int result = fibonacci(x); [L30] COND FALSE !(x != 5 || result == 3) VAL [result=5, x=5] [L33] __VERIFIER_error() VAL [result=5, x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. UNSAFE Result, 6.9s OverallTime, 9 OverallIterations, 21 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 146 SDtfs, 134 SDslu, 465 SDs, 0 SdLazy, 608 SolverSat, 223 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 855 GetRequests, 717 SyntacticMatches, 32 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.3s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 896 NumberOfCodeBlocks, 815 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1147 ConstructedInterpolants, 0 QuantifiedInterpolants, 179777 SizeOfPredicates, 29 NumberOfNonLiveVariables, 687 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 4327/5115 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...