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/loop-industry-pattern/nested-3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:59:45,469 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:59:45,471 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:59:45,482 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:59:45,483 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:59:45,484 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:59:45,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:59:45,487 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:59:45,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:59:45,489 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:59:45,490 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:59:45,491 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:59:45,491 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:59:45,492 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:59:45,493 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:59:45,494 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:59:45,495 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:59:45,496 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:59:45,498 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:59:45,500 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:59:45,502 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:59:45,503 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:59:45,504 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:59:45,505 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:59:45,510 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:59:45,510 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:59:45,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:59:45,511 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:59:45,512 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:59:45,515 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:59:45,515 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:59:45,516 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:59:45,517 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:59:45,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:59:45,521 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:59:45,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:59:45,524 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:59:45,524 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:59:45,524 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:59:45,525 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:59:45,525 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:59:45,528 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-03 20:59:45,556 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:59:45,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:59:45,558 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:59:45,558 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:59:45,559 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:59:45,559 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:59:45,559 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:59:45,560 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:59:45,560 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:59:45,560 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:59:45,562 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:59:45,563 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:59:45,563 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:59:45,563 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:59:45,564 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:59:45,564 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:59:45,564 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:59:45,564 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:59:45,564 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:59:45,565 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:59:45,565 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:59:45,565 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:59:45,566 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:59:45,566 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:59:45,566 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:59:45,566 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:59:45,567 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:59:45,567 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:59:45,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:59:45,567 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:59:45,625 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:59:45,643 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:59:45,647 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:59:45,649 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:59:45,649 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:59:45,650 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/nested-3.c [2019-09-03 20:59:45,709 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fb21e156/4df3467e75264d738bcf0541f25b1785/FLAGbb622dedf [2019-09-03 20:59:46,201 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:59:46,202 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/nested-3.c [2019-09-03 20:59:46,209 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fb21e156/4df3467e75264d738bcf0541f25b1785/FLAGbb622dedf [2019-09-03 20:59:46,582 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fb21e156/4df3467e75264d738bcf0541f25b1785 [2019-09-03 20:59:46,594 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:59:46,596 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:59:46,597 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:59:46,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:59:46,600 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:59:46,601 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:59:46" (1/1) ... [2019-09-03 20:59:46,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36c883f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:59:46, skipping insertion in model container [2019-09-03 20:59:46,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:59:46" (1/1) ... [2019-09-03 20:59:46,617 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:59:46,637 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:59:46,855 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:59:46,868 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:59:46,889 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:59:46,901 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:59:46,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:59:46 WrapperNode [2019-09-03 20:59:46,902 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:59:46,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:59:46,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:59:46,902 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:59:47,011 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:59:46" (1/1) ... [2019-09-03 20:59:47,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:59:46" (1/1) ... [2019-09-03 20:59:47,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:59:46" (1/1) ... [2019-09-03 20:59:47,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:59:46" (1/1) ... [2019-09-03 20:59:47,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:59:46" (1/1) ... [2019-09-03 20:59:47,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:59:46" (1/1) ... [2019-09-03 20:59:47,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:59:46" (1/1) ... [2019-09-03 20:59:47,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:59:47,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:59:47,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:59:47,028 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:59:47,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:59:46" (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-03 20:59:47,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:59:47,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:59:47,087 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:59:47,087 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:59:47,087 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:59:47,087 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 20:59:47,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:59:47,088 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:59:47,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:59:47,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:59:47,287 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:59:47,288 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-03 20:59:47,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:59:47 BoogieIcfgContainer [2019-09-03 20:59:47,289 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:59:47,290 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:59:47,290 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:59:47,293 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:59:47,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:59:46" (1/3) ... [2019-09-03 20:59:47,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fc0b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:59:47, skipping insertion in model container [2019-09-03 20:59:47,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:59:46" (2/3) ... [2019-09-03 20:59:47,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fc0b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:59:47, skipping insertion in model container [2019-09-03 20:59:47,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:59:47" (3/3) ... [2019-09-03 20:59:47,297 INFO L109 eAbstractionObserver]: Analyzing ICFG nested-3.c [2019-09-03 20:59:47,313 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:59:47,329 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:59:47,349 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:59:47,396 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:59:47,396 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:59:47,396 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:59:47,397 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:59:47,397 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:59:47,397 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:59:47,397 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:59:47,397 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:59:47,414 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-09-03 20:59:47,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 20:59:47,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:47,428 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:47,432 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:47,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:47,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1419324422, now seen corresponding path program 1 times [2019-09-03 20:59:47,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:47,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:47,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:47,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:47,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:47,590 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-03 20:59:47,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:59:47,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:59:47,593 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:59:47,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:59:47,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:59:47,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:59:47,612 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-09-03 20:59:47,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:47,689 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-09-03 20:59:47,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:59:47,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-03 20:59:47,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:47,700 INFO L225 Difference]: With dead ends: 23 [2019-09-03 20:59:47,700 INFO L226 Difference]: Without dead ends: 23 [2019-09-03 20:59:47,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:59:47,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-03 20:59:47,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2019-09-03 20:59:47,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-03 20:59:47,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-09-03 20:59:47,739 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2019-09-03 20:59:47,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:47,740 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-09-03 20:59:47,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:59:47,740 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-09-03 20:59:47,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 20:59:47,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:47,741 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:47,742 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:47,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:47,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1519544262, now seen corresponding path program 1 times [2019-09-03 20:59:47,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:47,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:47,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:47,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:47,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:47,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:47,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:47,817 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:47,818 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2019-09-03 20:59:47,822 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [20], [22], [25], [29], [35], [41], [50], [53], [55], [61], [62], [63], [65] [2019-09-03 20:59:47,851 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:59:47,851 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:59:47,921 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-03 20:59:47,924 INFO L272 AbstractInterpreter]: Visited 11 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Performed 25 root evaluator evaluations with a maximum evaluation depth of 4. Performed 25 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2019-09-03 20:59:47,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:47,928 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-03 20:59:47,973 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 61.11% of their original sizes. [2019-09-03 20:59:47,974 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-03 20:59:48,016 INFO L420 sIntCurrentIteration]: We unified 16 AI predicates to 16 [2019-09-03 20:59:48,016 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-03 20:59:48,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:59:48,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2019-09-03 20:59:48,018 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:59:48,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:59:48,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:59:48,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:59:48,020 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 6 states. [2019-09-03 20:59:48,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:48,254 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2019-09-03 20:59:48,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:59:48,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-09-03 20:59:48,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:48,258 INFO L225 Difference]: With dead ends: 30 [2019-09-03 20:59:48,258 INFO L226 Difference]: Without dead ends: 30 [2019-09-03 20:59:48,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:59:48,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-03 20:59:48,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-09-03 20:59:48,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-03 20:59:48,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2019-09-03 20:59:48,265 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 17 [2019-09-03 20:59:48,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:48,265 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-09-03 20:59:48,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:59:48,266 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2019-09-03 20:59:48,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 20:59:48,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:48,267 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:48,267 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:48,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:48,267 INFO L82 PathProgramCache]: Analyzing trace with hash -839485892, now seen corresponding path program 1 times [2019-09-03 20:59:48,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:48,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:48,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:48,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:48,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:48,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:48,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:48,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:48,306 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2019-09-03 20:59:48,306 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [20], [22], [27], [29], [35], [41], [50], [53], [55], [61], [62], [63], [65] [2019-09-03 20:59:48,309 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:59:48,309 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:59:48,335 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-03 20:59:48,336 INFO L272 AbstractInterpreter]: Visited 12 different actions 32 times. Merged at 3 different actions 15 times. Widened at 1 different actions 1 times. Performed 66 root evaluator evaluations with a maximum evaluation depth of 4. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2019-09-03 20:59:48,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:48,336 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-03 20:59:48,348 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 53.33% of their original sizes. [2019-09-03 20:59:48,349 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-03 20:59:48,380 INFO L420 sIntCurrentIteration]: We unified 16 AI predicates to 16 [2019-09-03 20:59:48,380 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-03 20:59:48,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:59:48,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2019-09-03 20:59:48,381 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:59:48,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:59:48,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:59:48,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:59:48,382 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 6 states. [2019-09-03 20:59:48,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:48,471 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2019-09-03 20:59:48,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:59:48,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-09-03 20:59:48,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:48,473 INFO L225 Difference]: With dead ends: 34 [2019-09-03 20:59:48,473 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 20:59:48,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:59:48,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 20:59:48,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2019-09-03 20:59:48,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-03 20:59:48,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2019-09-03 20:59:48,479 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2019-09-03 20:59:48,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:48,479 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-09-03 20:59:48,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:59:48,480 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2019-09-03 20:59:48,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 20:59:48,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:48,481 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:48,481 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:48,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:48,482 INFO L82 PathProgramCache]: Analyzing trace with hash -782227590, now seen corresponding path program 1 times [2019-09-03 20:59:48,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:48,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:48,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:48,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:48,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:48,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:48,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:48,530 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:48,531 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2019-09-03 20:59:48,531 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [20], [22], [27], [29], [37], [41], [50], [53], [55], [61], [62], [63], [65] [2019-09-03 20:59:48,535 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:59:48,535 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:59:48,554 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-03 20:59:48,554 INFO L272 AbstractInterpreter]: Visited 13 different actions 33 times. Merged at 3 different actions 15 times. Widened at 1 different actions 1 times. Performed 71 root evaluator evaluations with a maximum evaluation depth of 6. Performed 71 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2019-09-03 20:59:48,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:48,555 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-03 20:59:48,575 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 50% of their original sizes. [2019-09-03 20:59:48,575 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-03 20:59:48,617 INFO L420 sIntCurrentIteration]: We unified 16 AI predicates to 16 [2019-09-03 20:59:48,617 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-03 20:59:48,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:59:48,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2019-09-03 20:59:48,618 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:59:48,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:59:48,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:59:48,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:59:48,621 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand 7 states. [2019-09-03 20:59:48,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:48,825 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2019-09-03 20:59:48,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:59:48,825 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-09-03 20:59:48,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:48,827 INFO L225 Difference]: With dead ends: 37 [2019-09-03 20:59:48,827 INFO L226 Difference]: Without dead ends: 37 [2019-09-03 20:59:48,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:59:48,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-03 20:59:48,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2019-09-03 20:59:48,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 20:59:48,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2019-09-03 20:59:48,837 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 17 [2019-09-03 20:59:48,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:48,837 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2019-09-03 20:59:48,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:59:48,837 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2019-09-03 20:59:48,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 20:59:48,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:48,838 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:48,838 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:48,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:48,839 INFO L82 PathProgramCache]: Analyzing trace with hash -780380548, now seen corresponding path program 1 times [2019-09-03 20:59:48,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:48,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:48,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:48,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:48,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:48,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:48,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:48,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:48,877 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2019-09-03 20:59:48,878 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [20], [22], [27], [29], [37], [43], [50], [53], [55], [61], [62], [63], [65] [2019-09-03 20:59:48,880 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:59:48,880 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:59:48,918 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:59:48,919 INFO L272 AbstractInterpreter]: Visited 17 different actions 37 times. Merged at 3 different actions 15 times. Widened at 1 different actions 1 times. Performed 76 root evaluator evaluations with a maximum evaluation depth of 6. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2019-09-03 20:59:48,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:48,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:59:48,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:48,921 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) [2019-09-03 20:59:48,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:48,945 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:48,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-03 20:59:48,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:48,996 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:49,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:49,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:49,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-03 20:59:49,033 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:49,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:59:49,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:59:49,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:59:49,034 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 4 states. [2019-09-03 20:59:49,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:49,079 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2019-09-03 20:59:49,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:59:49,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-09-03 20:59:49,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:49,081 INFO L225 Difference]: With dead ends: 44 [2019-09-03 20:59:49,081 INFO L226 Difference]: Without dead ends: 44 [2019-09-03 20:59:49,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:59:49,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-03 20:59:49,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2019-09-03 20:59:49,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-03 20:59:49,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2019-09-03 20:59:49,086 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 17 [2019-09-03 20:59:49,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:49,087 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-09-03 20:59:49,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:59:49,087 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2019-09-03 20:59:49,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 20:59:49,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:49,088 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:49,088 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:49,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:49,089 INFO L82 PathProgramCache]: Analyzing trace with hash 231878024, now seen corresponding path program 1 times [2019-09-03 20:59:49,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:49,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:49,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:49,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:49,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:49,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-03 20:59:49,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:59:49,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:59:49,116 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:59:49,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:59:49,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:59:49,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:59:49,117 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand 3 states. [2019-09-03 20:59:49,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:49,138 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-09-03 20:59:49,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:59:49,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-03 20:59:49,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:49,140 INFO L225 Difference]: With dead ends: 39 [2019-09-03 20:59:49,140 INFO L226 Difference]: Without dead ends: 39 [2019-09-03 20:59:49,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:59:49,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-03 20:59:49,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-09-03 20:59:49,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-03 20:59:49,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2019-09-03 20:59:49,145 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 20 [2019-09-03 20:59:49,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:49,146 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-09-03 20:59:49,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:59:49,146 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2019-09-03 20:59:49,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 20:59:49,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:49,147 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:49,147 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:49,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:49,148 INFO L82 PathProgramCache]: Analyzing trace with hash 233725066, now seen corresponding path program 1 times [2019-09-03 20:59:49,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:49,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:49,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:49,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:49,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:49,200 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:49,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:49,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:49,201 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2019-09-03 20:59:49,201 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [20], [22], [25], [27], [29], [35], [43], [50], [53], [55], [61], [62], [63], [65] [2019-09-03 20:59:49,203 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:59:49,203 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:59:49,235 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:59:49,235 INFO L272 AbstractInterpreter]: Visited 18 different actions 52 times. Merged at 4 different actions 22 times. Widened at 1 different actions 1 times. Performed 119 root evaluator evaluations with a maximum evaluation depth of 6. Performed 119 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 8 fixpoints after 3 different actions. Largest state had 8 variables. [2019-09-03 20:59:49,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:49,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:59:49,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:49,236 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-03 20:59:49,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:49,257 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:59:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:49,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-03 20:59:49,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:49,279 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:49,280 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:49,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:49,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:49,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2019-09-03 20:59:49,326 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:49,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:59:49,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:59:49,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:59:49,328 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand 5 states. [2019-09-03 20:59:49,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:49,371 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2019-09-03 20:59:49,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:59:49,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-03 20:59:49,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:49,372 INFO L225 Difference]: With dead ends: 53 [2019-09-03 20:59:49,372 INFO L226 Difference]: Without dead ends: 53 [2019-09-03 20:59:49,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:59:49,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-03 20:59:49,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2019-09-03 20:59:49,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-03 20:59:49,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2019-09-03 20:59:49,377 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 20 [2019-09-03 20:59:49,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:49,378 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2019-09-03 20:59:49,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:59:49,378 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2019-09-03 20:59:49,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-03 20:59:49,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:49,379 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:49,379 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:49,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:49,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1334170046, now seen corresponding path program 2 times [2019-09-03 20:59:49,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:49,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:49,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:49,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:49,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:49,432 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:49,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:49,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:49,433 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:49,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:49,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:49,433 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) [2019-09-03 20:59:49,451 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:59:49,451 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:49,474 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-03 20:59:49,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:49,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 20:59:49,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:49,500 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-03 20:59:49,501 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:49,519 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-03 20:59:49,523 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:59:49,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6] total 8 [2019-09-03 20:59:49,523 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:59:49,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:59:49,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:59:49,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:59:49,524 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand 4 states. [2019-09-03 20:59:49,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:49,630 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2019-09-03 20:59:49,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:59:49,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-09-03 20:59:49,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:49,632 INFO L225 Difference]: With dead ends: 62 [2019-09-03 20:59:49,632 INFO L226 Difference]: Without dead ends: 62 [2019-09-03 20:59:49,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:59:49,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-03 20:59:49,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2019-09-03 20:59:49,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-03 20:59:49,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2019-09-03 20:59:49,637 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 23 [2019-09-03 20:59:49,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:49,638 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2019-09-03 20:59:49,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:59:49,638 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2019-09-03 20:59:49,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-03 20:59:49,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:49,639 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:49,639 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:49,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:49,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1389581306, now seen corresponding path program 1 times [2019-09-03 20:59:49,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:49,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:49,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:49,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:49,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:49,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:49,684 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:49,684 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2019-09-03 20:59:49,684 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [20], [22], [25], [27], [29], [37], [41], [50], [53], [55], [61], [62], [63], [65] [2019-09-03 20:59:49,686 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:59:49,686 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:59:49,702 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:59:49,703 INFO L272 AbstractInterpreter]: Visited 18 different actions 48 times. Merged at 4 different actions 20 times. Widened at 1 different actions 1 times. Performed 115 root evaluator evaluations with a maximum evaluation depth of 6. Performed 115 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 7 fixpoints after 2 different actions. Largest state had 8 variables. [2019-09-03 20:59:49,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:49,703 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:59:49,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:49,704 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-03 20:59:49,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:49,717 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:49,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-03 20:59:49,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:49,756 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 20:59:49,757 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:49,796 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 20:59:49,799 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:59:49,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6] total 8 [2019-09-03 20:59:49,800 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:59:49,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:59:49,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:59:49,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:59:49,802 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand 4 states. [2019-09-03 20:59:49,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:49,843 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2019-09-03 20:59:49,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:59:49,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-09-03 20:59:49,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:49,845 INFO L225 Difference]: With dead ends: 61 [2019-09-03 20:59:49,845 INFO L226 Difference]: Without dead ends: 61 [2019-09-03 20:59:49,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:59:49,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-03 20:59:49,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 50. [2019-09-03 20:59:49,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-03 20:59:49,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2019-09-03 20:59:49,856 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 23 [2019-09-03 20:59:49,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:49,857 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2019-09-03 20:59:49,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:59:49,857 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2019-09-03 20:59:49,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-03 20:59:49,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:49,859 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:49,860 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:49,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:49,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1649593786, now seen corresponding path program 1 times [2019-09-03 20:59:49,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:49,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:49,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:49,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:49,863 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:49,945 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:49,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:49,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:49,948 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2019-09-03 20:59:49,948 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [20], [22], [25], [27], [29], [37], [43], [50], [53], [55], [61], [62], [63], [65] [2019-09-03 20:59:49,951 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:59:49,951 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:59:50,005 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:59:50,005 INFO L272 AbstractInterpreter]: Visited 18 different actions 51 times. Merged at 4 different actions 21 times. Widened at 1 different actions 1 times. Performed 117 root evaluator evaluations with a maximum evaluation depth of 6. Performed 117 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 8 fixpoints after 3 different actions. Largest state had 8 variables. [2019-09-03 20:59:50,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:50,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:59:50,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:50,006 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) [2019-09-03 20:59:50,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:50,041 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:50,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 20:59:50,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:50,075 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:50,075 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:50,152 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:50,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:50,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2019-09-03 20:59:50,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:50,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:59:50,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:59:50,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:59:50,158 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand 6 states. [2019-09-03 20:59:50,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:50,206 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2019-09-03 20:59:50,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:59:50,209 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-09-03 20:59:50,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:50,210 INFO L225 Difference]: With dead ends: 68 [2019-09-03 20:59:50,211 INFO L226 Difference]: Without dead ends: 68 [2019-09-03 20:59:50,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:59:50,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-03 20:59:50,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2019-09-03 20:59:50,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-03 20:59:50,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2019-09-03 20:59:50,221 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 23 [2019-09-03 20:59:50,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:50,221 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2019-09-03 20:59:50,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:59:50,222 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2019-09-03 20:59:50,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 20:59:50,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:50,225 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:50,225 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:50,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:50,226 INFO L82 PathProgramCache]: Analyzing trace with hash 240758920, now seen corresponding path program 2 times [2019-09-03 20:59:50,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:50,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:50,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:50,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:50,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:50,305 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:50,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:50,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:50,306 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:50,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:50,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:50,307 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:50,325 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:59:50,325 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:59:50,340 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 20:59:50,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:50,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 20:59:50,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:50,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:50,462 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:59:50,463 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:50,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:50,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:50,591 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:59:50,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:59:50,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7, 8] total 20 [2019-09-03 20:59:50,595 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:59:50,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:59:50,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:59:50,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:59:50,596 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand 9 states. [2019-09-03 20:59:50,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:50,719 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2019-09-03 20:59:50,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:59:50,720 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-09-03 20:59:50,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:50,721 INFO L225 Difference]: With dead ends: 81 [2019-09-03 20:59:50,721 INFO L226 Difference]: Without dead ends: 81 [2019-09-03 20:59:50,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:59:50,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-03 20:59:50,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-09-03 20:59:50,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-03 20:59:50,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 97 transitions. [2019-09-03 20:59:50,728 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 97 transitions. Word has length 26 [2019-09-03 20:59:50,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:50,728 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 97 transitions. [2019-09-03 20:59:50,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:59:50,728 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 97 transitions. [2019-09-03 20:59:50,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 20:59:50,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:50,729 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:50,729 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:50,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:50,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1804264838, now seen corresponding path program 3 times [2019-09-03 20:59:50,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:50,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:50,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:50,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:50,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:50,771 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:50,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:50,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:50,772 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:50,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:50,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:50,772 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:59:50,799 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:59:50,799 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:50,812 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:59:50,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:50,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 20:59:50,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:50,820 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:50,820 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:50,896 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:50,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:50,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2019-09-03 20:59:50,900 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:50,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:59:50,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:59:50,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:59:50,902 INFO L87 Difference]: Start difference. First operand 80 states and 97 transitions. Second operand 7 states. [2019-09-03 20:59:50,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:50,951 INFO L93 Difference]: Finished difference Result 106 states and 127 transitions. [2019-09-03 20:59:50,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:59:50,952 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-09-03 20:59:50,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:50,954 INFO L225 Difference]: With dead ends: 106 [2019-09-03 20:59:50,954 INFO L226 Difference]: Without dead ends: 106 [2019-09-03 20:59:50,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:59:50,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-03 20:59:50,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 92. [2019-09-03 20:59:50,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-03 20:59:50,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 111 transitions. [2019-09-03 20:59:50,960 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 111 transitions. Word has length 26 [2019-09-03 20:59:50,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:50,961 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 111 transitions. [2019-09-03 20:59:50,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:59:50,961 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 111 transitions. [2019-09-03 20:59:50,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-03 20:59:50,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:50,962 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:50,962 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:50,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:50,963 INFO L82 PathProgramCache]: Analyzing trace with hash -252932420, now seen corresponding path program 4 times [2019-09-03 20:59:50,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:50,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:50,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:50,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:50,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:51,008 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:51,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:51,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:51,009 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:51,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:51,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:51,009 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:59:51,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:51,028 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:51,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 20:59:51,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:51,048 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:51,049 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:51,148 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:51,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:51,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2019-09-03 20:59:51,153 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:51,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:59:51,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:59:51,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:59:51,154 INFO L87 Difference]: Start difference. First operand 92 states and 111 transitions. Second operand 8 states. [2019-09-03 20:59:51,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:51,216 INFO L93 Difference]: Finished difference Result 118 states and 141 transitions. [2019-09-03 20:59:51,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:59:51,217 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-09-03 20:59:51,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:51,218 INFO L225 Difference]: With dead ends: 118 [2019-09-03 20:59:51,218 INFO L226 Difference]: Without dead ends: 118 [2019-09-03 20:59:51,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:59:51,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-03 20:59:51,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 104. [2019-09-03 20:59:51,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-03 20:59:51,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 125 transitions. [2019-09-03 20:59:51,224 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 125 transitions. Word has length 29 [2019-09-03 20:59:51,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:51,226 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 125 transitions. [2019-09-03 20:59:51,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:59:51,227 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 125 transitions. [2019-09-03 20:59:51,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 20:59:51,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:51,228 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:51,228 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:51,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:51,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1328098874, now seen corresponding path program 5 times [2019-09-03 20:59:51,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:51,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:51,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:51,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:51,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:51,329 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:51,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:51,330 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:51,330 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:51,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:51,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:51,331 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:51,345 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:59:51,345 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:59:51,362 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 20:59:51,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:51,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 20:59:51,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:51,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:51,464 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-03 20:59:51,464 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:51,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:51,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:51,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:51,643 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-03 20:59:51,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:59:51,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 23 [2019-09-03 20:59:51,647 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:59:51,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:59:51,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:59:51,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:59:51,648 INFO L87 Difference]: Start difference. First operand 104 states and 125 transitions. Second operand 9 states. [2019-09-03 20:59:51,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:51,763 INFO L93 Difference]: Finished difference Result 112 states and 133 transitions. [2019-09-03 20:59:51,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:59:51,763 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2019-09-03 20:59:51,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:51,765 INFO L225 Difference]: With dead ends: 112 [2019-09-03 20:59:51,765 INFO L226 Difference]: Without dead ends: 112 [2019-09-03 20:59:51,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:59:51,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-03 20:59:51,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 104. [2019-09-03 20:59:51,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-03 20:59:51,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 125 transitions. [2019-09-03 20:59:51,772 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 125 transitions. Word has length 32 [2019-09-03 20:59:51,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:51,773 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 125 transitions. [2019-09-03 20:59:51,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:59:51,773 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 125 transitions. [2019-09-03 20:59:51,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-03 20:59:51,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:51,775 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 10, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:51,775 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:51,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:51,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1742732037, now seen corresponding path program 1 times [2019-09-03 20:59:51,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:51,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:51,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:51,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:51,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:51,855 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 124 proven. 51 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-09-03 20:59:51,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:51,855 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:51,855 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2019-09-03 20:59:51,856 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [20], [22], [25], [27], [29], [37], [43], [50], [53], [55], [58], [60], [61], [62], [63], [65], [66] [2019-09-03 20:59:51,861 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:59:51,861 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:59:51,946 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:59:51,947 INFO L272 AbstractInterpreter]: Visited 21 different actions 103 times. Merged at 9 different actions 46 times. Widened at 2 different actions 4 times. Performed 247 root evaluator evaluations with a maximum evaluation depth of 8. Performed 247 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 15 fixpoints after 4 different actions. Largest state had 8 variables. [2019-09-03 20:59:51,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:51,947 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:59:51,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:51,948 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:51,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:51,964 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:59:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:51,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 20:59:51,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:51,993 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 122 proven. 51 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-03 20:59:51,993 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:52,088 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 124 proven. 51 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-09-03 20:59:52,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:52,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2019-09-03 20:59:52,092 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:52,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:59:52,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:59:52,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:59:52,094 INFO L87 Difference]: Start difference. First operand 104 states and 125 transitions. Second operand 9 states. [2019-09-03 20:59:52,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:52,167 INFO L93 Difference]: Finished difference Result 130 states and 155 transitions. [2019-09-03 20:59:52,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:59:52,167 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-09-03 20:59:52,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:52,171 INFO L225 Difference]: With dead ends: 130 [2019-09-03 20:59:52,171 INFO L226 Difference]: Without dead ends: 130 [2019-09-03 20:59:52,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:59:52,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-03 20:59:52,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 116. [2019-09-03 20:59:52,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-03 20:59:52,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 139 transitions. [2019-09-03 20:59:52,181 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 139 transitions. Word has length 59 [2019-09-03 20:59:52,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:52,181 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 139 transitions. [2019-09-03 20:59:52,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:59:52,181 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 139 transitions. [2019-09-03 20:59:52,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-03 20:59:52,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:52,183 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 12, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:52,185 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:52,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:52,185 INFO L82 PathProgramCache]: Analyzing trace with hash 75585305, now seen corresponding path program 2 times [2019-09-03 20:59:52,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:52,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:52,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:52,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:52,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:52,288 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 165 proven. 70 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-03 20:59:52,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:52,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:52,289 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:52,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:52,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:52,290 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:59:52,314 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:59:52,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:52,339 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 20:59:52,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:52,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 20:59:52,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:52,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:52,563 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 21 proven. 166 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:59:52,563 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:52,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:52,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:52,705 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 5 proven. 41 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2019-09-03 20:59:52,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:52,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 24 [2019-09-03 20:59:52,709 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:52,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 20:59:52,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 20:59:52,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:59:52,710 INFO L87 Difference]: Start difference. First operand 116 states and 139 transitions. Second operand 18 states. [2019-09-03 20:59:53,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:53,312 INFO L93 Difference]: Finished difference Result 216 states and 258 transitions. [2019-09-03 20:59:53,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 20:59:53,313 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 65 [2019-09-03 20:59:53,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:53,315 INFO L225 Difference]: With dead ends: 216 [2019-09-03 20:59:53,316 INFO L226 Difference]: Without dead ends: 216 [2019-09-03 20:59:53,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=358, Invalid=1282, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 20:59:53,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-03 20:59:53,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 197. [2019-09-03 20:59:53,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-03 20:59:53,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 237 transitions. [2019-09-03 20:59:53,325 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 237 transitions. Word has length 65 [2019-09-03 20:59:53,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:53,325 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 237 transitions. [2019-09-03 20:59:53,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 20:59:53,326 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 237 transitions. [2019-09-03 20:59:53,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-03 20:59:53,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:53,329 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 14, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:53,330 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:53,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:53,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1994081667, now seen corresponding path program 1 times [2019-09-03 20:59:53,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:53,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:53,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:53,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:53,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:53,430 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 212 proven. 92 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-03 20:59:53,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:53,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:53,430 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 72 with the following transitions: [2019-09-03 20:59:53,431 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [20], [22], [25], [27], [29], [35], [37], [43], [50], [53], [55], [58], [60], [61], [62], [63], [65], [66] [2019-09-03 20:59:53,432 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:59:53,433 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:59:53,628 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:59:53,629 INFO L272 AbstractInterpreter]: Visited 22 different actions 140 times. Merged at 10 different actions 57 times. Widened at 2 different actions 4 times. Performed 335 root evaluator evaluations with a maximum evaluation depth of 8. Performed 335 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 18 fixpoints after 3 different actions. Largest state had 8 variables. [2019-09-03 20:59:53,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:53,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:59:53,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:53,630 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:59:53,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:53,660 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:53,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 20:59:53,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:53,702 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 210 proven. 92 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-03 20:59:53,702 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:53,895 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 212 proven. 92 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-03 20:59:53,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:53,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2019-09-03 20:59:53,901 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:53,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:59:53,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:59:53,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:59:53,903 INFO L87 Difference]: Start difference. First operand 197 states and 237 transitions. Second operand 11 states. [2019-09-03 20:59:54,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:54,004 INFO L93 Difference]: Finished difference Result 228 states and 273 transitions. [2019-09-03 20:59:54,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:59:54,004 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2019-09-03 20:59:54,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:54,007 INFO L225 Difference]: With dead ends: 228 [2019-09-03 20:59:54,007 INFO L226 Difference]: Without dead ends: 228 [2019-09-03 20:59:54,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:59:54,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-09-03 20:59:54,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 209. [2019-09-03 20:59:54,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-09-03 20:59:54,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 251 transitions. [2019-09-03 20:59:54,021 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 251 transitions. Word has length 71 [2019-09-03 20:59:54,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:54,024 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 251 transitions. [2019-09-03 20:59:54,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:59:54,024 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 251 transitions. [2019-09-03 20:59:54,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-03 20:59:54,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:54,028 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 16, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:54,029 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:54,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:54,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1673578267, now seen corresponding path program 2 times [2019-09-03 20:59:54,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:54,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:54,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:54,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:54,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:54,164 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 265 proven. 117 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-03 20:59:54,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:54,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:54,164 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:54,165 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:54,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:54,165 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:59:54,189 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:59:54,189 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:54,209 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 20:59:54,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:54,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 20:59:54,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:54,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:54,364 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 27 proven. 266 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2019-09-03 20:59:54,364 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:54,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:54,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:54,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:54,549 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 4 proven. 54 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2019-09-03 20:59:54,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:54,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 27 [2019-09-03 20:59:54,553 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:54,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 20:59:54,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 20:59:54,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2019-09-03 20:59:54,555 INFO L87 Difference]: Start difference. First operand 209 states and 251 transitions. Second operand 20 states. [2019-09-03 20:59:55,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:55,581 INFO L93 Difference]: Finished difference Result 258 states and 306 transitions. [2019-09-03 20:59:55,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 20:59:55,581 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 77 [2019-09-03 20:59:55,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:55,584 INFO L225 Difference]: With dead ends: 258 [2019-09-03 20:59:55,584 INFO L226 Difference]: Without dead ends: 258 [2019-09-03 20:59:55,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=695, Invalid=2727, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 20:59:55,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-09-03 20:59:55,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 233. [2019-09-03 20:59:55,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-09-03 20:59:55,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 279 transitions. [2019-09-03 20:59:55,593 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 279 transitions. Word has length 77 [2019-09-03 20:59:55,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:55,594 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 279 transitions. [2019-09-03 20:59:55,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 20:59:55,594 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 279 transitions. [2019-09-03 20:59:55,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-03 20:59:55,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:55,596 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 18, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:55,596 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:55,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:55,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1928827587, now seen corresponding path program 3 times [2019-09-03 20:59:55,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:55,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:55,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:55,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:55,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:55,736 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 324 proven. 145 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-09-03 20:59:55,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:55,737 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:55,737 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:55,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:55,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:55,737 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:55,747 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:59:55,747 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:59:55,768 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:59:55,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:55,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 20:59:55,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:55,944 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 452 proven. 39 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-03 20:59:55,944 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:56,110 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 451 proven. 40 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-03 20:59:56,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:56,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 35 [2019-09-03 20:59:56,113 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:56,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 20:59:56,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 20:59:56,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=900, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 20:59:56,115 INFO L87 Difference]: Start difference. First operand 233 states and 279 transitions. Second operand 25 states. [2019-09-03 20:59:56,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:56,888 INFO L93 Difference]: Finished difference Result 382 states and 446 transitions. [2019-09-03 20:59:56,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 20:59:56,891 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 83 [2019-09-03 20:59:56,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:56,893 INFO L225 Difference]: With dead ends: 382 [2019-09-03 20:59:56,893 INFO L226 Difference]: Without dead ends: 382 [2019-09-03 20:59:56,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 144 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=842, Invalid=2464, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 20:59:56,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-09-03 20:59:56,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 355. [2019-09-03 20:59:56,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-09-03 20:59:56,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 415 transitions. [2019-09-03 20:59:56,914 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 415 transitions. Word has length 83 [2019-09-03 20:59:56,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:56,914 INFO L475 AbstractCegarLoop]: Abstraction has 355 states and 415 transitions. [2019-09-03 20:59:56,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 20:59:56,914 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 415 transitions. [2019-09-03 20:59:56,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-03 20:59:56,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:56,919 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 21, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:56,919 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:56,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:56,920 INFO L82 PathProgramCache]: Analyzing trace with hash -783559399, now seen corresponding path program 1 times [2019-09-03 20:59:56,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:56,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:56,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:56,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:56,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:56,975 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2019-09-03 20:59:56,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:59:56,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:59:56,976 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:59:56,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:59:56,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:59:56,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:59:56,977 INFO L87 Difference]: Start difference. First operand 355 states and 415 transitions. Second operand 4 states. [2019-09-03 20:59:56,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:56,989 INFO L93 Difference]: Finished difference Result 365 states and 426 transitions. [2019-09-03 20:59:56,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:59:56,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-03 20:59:56,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:56,992 INFO L225 Difference]: With dead ends: 365 [2019-09-03 20:59:56,993 INFO L226 Difference]: Without dead ends: 365 [2019-09-03 20:59:56,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:59:56,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-09-03 20:59:57,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 347. [2019-09-03 20:59:57,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-09-03 20:59:57,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 403 transitions. [2019-09-03 20:59:57,004 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 403 transitions. Word has length 89 [2019-09-03 20:59:57,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:57,004 INFO L475 AbstractCegarLoop]: Abstraction has 347 states and 403 transitions. [2019-09-03 20:59:57,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:59:57,004 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 403 transitions. [2019-09-03 20:59:57,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-03 20:59:57,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:57,006 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 20, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:57,006 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:57,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:57,006 INFO L82 PathProgramCache]: Analyzing trace with hash -2008291809, now seen corresponding path program 4 times [2019-09-03 20:59:57,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:57,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:57,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:57,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:57,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:57,125 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 389 proven. 176 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-09-03 20:59:57,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:57,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:57,126 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:57,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:57,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:57,126 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:57,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:57,137 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:59:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:57,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 20:59:57,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:57,174 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 387 proven. 176 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-09-03 20:59:57,174 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:57,385 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 389 proven. 176 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-09-03 20:59:57,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:57,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2019-09-03 20:59:57,388 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:57,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 20:59:57,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 20:59:57,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-03 20:59:57,389 INFO L87 Difference]: Start difference. First operand 347 states and 403 transitions. Second operand 14 states. [2019-09-03 20:59:57,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:57,476 INFO L93 Difference]: Finished difference Result 411 states and 477 transitions. [2019-09-03 20:59:57,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 20:59:57,480 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2019-09-03 20:59:57,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:57,483 INFO L225 Difference]: With dead ends: 411 [2019-09-03 20:59:57,483 INFO L226 Difference]: Without dead ends: 411 [2019-09-03 20:59:57,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-03 20:59:57,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-09-03 20:59:57,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 380. [2019-09-03 20:59:57,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-09-03 20:59:57,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 441 transitions. [2019-09-03 20:59:57,494 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 441 transitions. Word has length 89 [2019-09-03 20:59:57,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:57,495 INFO L475 AbstractCegarLoop]: Abstraction has 380 states and 441 transitions. [2019-09-03 20:59:57,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 20:59:57,495 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 441 transitions. [2019-09-03 20:59:57,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-03 20:59:57,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:57,496 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 22, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:57,497 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:57,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:57,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1132135865, now seen corresponding path program 5 times [2019-09-03 20:59:57,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:57,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:57,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:57,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:57,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:57,634 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 460 proven. 210 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-09-03 20:59:57,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:57,635 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:57,635 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:57,635 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:57,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:57,635 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:57,646 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:59:57,646 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:59:57,664 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 20:59:57,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:57,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 20:59:57,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:57,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:57,814 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 36 proven. 461 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2019-09-03 20:59:57,814 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:57,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:57,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:57,974 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 5 proven. 71 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (17)] Exception during sending of exit command (exit): Stream closed [2019-09-03 20:59:57,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:57,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 8] total 29 [2019-09-03 20:59:57,978 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:57,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 20:59:57,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 20:59:57,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2019-09-03 20:59:57,979 INFO L87 Difference]: Start difference. First operand 380 states and 441 transitions. Second operand 23 states. [2019-09-03 20:59:58,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:58,912 INFO L93 Difference]: Finished difference Result 517 states and 597 transitions. [2019-09-03 20:59:58,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 20:59:58,916 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 95 [2019-09-03 20:59:58,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:58,921 INFO L225 Difference]: With dead ends: 517 [2019-09-03 20:59:58,921 INFO L226 Difference]: Without dead ends: 517 [2019-09-03 20:59:58,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=708, Invalid=2372, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 20:59:58,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2019-09-03 20:59:58,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 463. [2019-09-03 20:59:58,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-09-03 20:59:58,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 537 transitions. [2019-09-03 20:59:58,943 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 537 transitions. Word has length 95 [2019-09-03 20:59:58,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:58,943 INFO L475 AbstractCegarLoop]: Abstraction has 463 states and 537 transitions. [2019-09-03 20:59:58,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 20:59:58,944 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 537 transitions. [2019-09-03 20:59:58,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 20:59:58,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:58,946 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 25, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:58,947 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:58,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:58,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1174066309, now seen corresponding path program 1 times [2019-09-03 20:59:58,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:58,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:58,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:58,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:58,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:59,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 578 proven. 247 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-03 20:59:59,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:59,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:59,137 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 105 with the following transitions: [2019-09-03 20:59:59,137 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [20], [22], [25], [27], [29], [35], [43], [50], [53], [55], [58], [60], [61], [62], [63], [65], [66] [2019-09-03 20:59:59,138 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:59:59,138 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:59:59,192 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:59:59,192 INFO L272 AbstractInterpreter]: Visited 21 different actions 100 times. Merged at 9 different actions 45 times. Widened at 2 different actions 4 times. Performed 232 root evaluator evaluations with a maximum evaluation depth of 8. Performed 232 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 14 fixpoints after 3 different actions. Largest state had 8 variables. [2019-09-03 20:59:59,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:59,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:59:59,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:59,193 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:59:59,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:59,221 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:59,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 20:59:59,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:59,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 575 proven. 247 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2019-09-03 20:59:59,304 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:59,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 577 proven. 247 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2019-09-03 20:59:59,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:59,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2019-09-03 20:59:59,617 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:59,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 20:59:59,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 20:59:59,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=553, Unknown=0, NotChecked=0, Total=992 [2019-09-03 20:59:59,619 INFO L87 Difference]: Start difference. First operand 463 states and 537 transitions. Second operand 18 states. [2019-09-03 21:00:00,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:00,015 INFO L93 Difference]: Finished difference Result 775 states and 910 transitions. [2019-09-03 21:00:00,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 21:00:00,015 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 104 [2019-09-03 21:00:00,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:00,021 INFO L225 Difference]: With dead ends: 775 [2019-09-03 21:00:00,021 INFO L226 Difference]: Without dead ends: 775 [2019-09-03 21:00:00,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=877, Invalid=1285, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 21:00:00,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-09-03 21:00:00,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 720. [2019-09-03 21:00:00,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-09-03 21:00:00,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 846 transitions. [2019-09-03 21:00:00,045 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 846 transitions. Word has length 104 [2019-09-03 21:00:00,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:00,046 INFO L475 AbstractCegarLoop]: Abstraction has 720 states and 846 transitions. [2019-09-03 21:00:00,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 21:00:00,046 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 846 transitions. [2019-09-03 21:00:00,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-03 21:00:00,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:00,049 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 26, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:00,049 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:00,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:00,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1167619899, now seen corresponding path program 2 times [2019-09-03 21:00:00,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:00,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:00,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:00,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:00,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:00,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:00,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 621 proven. 287 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-03 21:00:00,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:00,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:00,256 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:00,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:00:00,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:00,256 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:00,270 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:00:00,270 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:00:00,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-03 21:00:00,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:00,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 21:00:00,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:00,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 1 proven. 622 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2019-09-03 21:00:00,459 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:00,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:00,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:00,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:00,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:00,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:00:00,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:00:00,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:00,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:00,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:00:00,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:00:00,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 620 proven. 3 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2019-09-03 21:00:00,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:00,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 8] total 31 [2019-09-03 21:00:00,640 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:00,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 21:00:00,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 21:00:00,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=756, Unknown=0, NotChecked=0, Total=930 [2019-09-03 21:00:00,641 INFO L87 Difference]: Start difference. First operand 720 states and 846 transitions. Second operand 26 states. [2019-09-03 21:00:02,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:02,691 INFO L93 Difference]: Finished difference Result 900 states and 1052 transitions. [2019-09-03 21:00:02,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-03 21:00:02,691 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 107 [2019-09-03 21:00:02,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:02,697 INFO L225 Difference]: With dead ends: 900 [2019-09-03 21:00:02,697 INFO L226 Difference]: Without dead ends: 900 [2019-09-03 21:00:02,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 203 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2299 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1485, Invalid=7445, Unknown=0, NotChecked=0, Total=8930 [2019-09-03 21:00:02,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2019-09-03 21:00:02,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 838. [2019-09-03 21:00:02,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-09-03 21:00:02,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 977 transitions. [2019-09-03 21:00:02,727 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 977 transitions. Word has length 107 [2019-09-03 21:00:02,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:02,727 INFO L475 AbstractCegarLoop]: Abstraction has 838 states and 977 transitions. [2019-09-03 21:00:02,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 21:00:02,728 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 977 transitions. [2019-09-03 21:00:02,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-03 21:00:02,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:02,731 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 39, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:02,732 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:02,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:02,732 INFO L82 PathProgramCache]: Analyzing trace with hash 486588264, now seen corresponding path program 3 times [2019-09-03 21:00:02,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:02,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:02,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:02,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:02,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:02,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2732 backedges. 1240 proven. 287 refuted. 0 times theorem prover too weak. 1205 trivial. 0 not checked. [2019-09-03 21:00:02,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:02,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:02,883 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:02,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:00:02,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:02,883 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:02,899 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:00:02,900 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:00:02,939 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:00:02,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:02,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 21:00:02,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:02,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2732 backedges. 1236 proven. 287 refuted. 0 times theorem prover too weak. 1209 trivial. 0 not checked. [2019-09-03 21:00:02,966 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:03,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2732 backedges. 1240 proven. 287 refuted. 0 times theorem prover too weak. 1205 trivial. 0 not checked. [2019-09-03 21:00:03,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:03,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2019-09-03 21:00:03,311 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:03,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 21:00:03,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 21:00:03,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-03 21:00:03,312 INFO L87 Difference]: Start difference. First operand 838 states and 977 transitions. Second operand 17 states. [2019-09-03 21:00:03,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:03,390 INFO L93 Difference]: Finished difference Result 943 states and 1099 transitions. [2019-09-03 21:00:03,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 21:00:03,391 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 158 [2019-09-03 21:00:03,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:03,398 INFO L225 Difference]: With dead ends: 943 [2019-09-03 21:00:03,398 INFO L226 Difference]: Without dead ends: 943 [2019-09-03 21:00:03,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-03 21:00:03,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-09-03 21:00:03,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 890. [2019-09-03 21:00:03,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-09-03 21:00:03,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1035 transitions. [2019-09-03 21:00:03,425 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1035 transitions. Word has length 158 [2019-09-03 21:00:03,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:03,425 INFO L475 AbstractCegarLoop]: Abstraction has 890 states and 1035 transitions. [2019-09-03 21:00:03,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 21:00:03,426 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1035 transitions. [2019-09-03 21:00:03,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-03 21:00:03,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:03,429 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 42, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:03,429 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:03,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:03,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1764871608, now seen corresponding path program 4 times [2019-09-03 21:00:03,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:03,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:03,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:03,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:03,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:03,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3128 backedges. 1418 proven. 330 refuted. 0 times theorem prover too weak. 1380 trivial. 0 not checked. [2019-09-03 21:00:03,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:03,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:03,618 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:03,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:00:03,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:03,618 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:03,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:03,630 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:00:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:03,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 21:00:03,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:03,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3128 backedges. 1414 proven. 330 refuted. 0 times theorem prover too weak. 1384 trivial. 0 not checked. [2019-09-03 21:00:03,688 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:03,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3128 backedges. 1418 proven. 330 refuted. 0 times theorem prover too weak. 1380 trivial. 0 not checked. [2019-09-03 21:00:03,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:03,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2019-09-03 21:00:03,991 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:03,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 21:00:03,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 21:00:03,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 21:00:03,992 INFO L87 Difference]: Start difference. First operand 890 states and 1035 transitions. Second operand 18 states. [2019-09-03 21:00:04,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:04,126 INFO L93 Difference]: Finished difference Result 1015 states and 1182 transitions. [2019-09-03 21:00:04,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 21:00:04,128 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 167 [2019-09-03 21:00:04,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:04,133 INFO L225 Difference]: With dead ends: 1015 [2019-09-03 21:00:04,133 INFO L226 Difference]: Without dead ends: 1015 [2019-09-03 21:00:04,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 21:00:04,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-09-03 21:00:04,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 956. [2019-09-03 21:00:04,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2019-09-03 21:00:04,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1112 transitions. [2019-09-03 21:00:04,157 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1112 transitions. Word has length 167 [2019-09-03 21:00:04,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:04,157 INFO L475 AbstractCegarLoop]: Abstraction has 956 states and 1112 transitions. [2019-09-03 21:00:04,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 21:00:04,157 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1112 transitions. [2019-09-03 21:00:04,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-03 21:00:04,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:04,161 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 45, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:04,162 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:04,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:04,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1546017896, now seen corresponding path program 5 times [2019-09-03 21:00:04,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:04,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:04,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:04,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:04,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:04,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3551 backedges. 1608 proven. 376 refuted. 0 times theorem prover too weak. 1567 trivial. 0 not checked. [2019-09-03 21:00:04,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:04,460 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:04,460 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:04,460 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:00:04,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:04,460 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 21:00:04,479 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:00:04,479 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:04,500 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 21:00:04,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:04,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 21:00:04,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:04,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:04,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3551 backedges. 1662 proven. 1 refuted. 0 times theorem prover too weak. 1888 trivial. 0 not checked. [2019-09-03 21:00:04,659 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:04,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:04,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:04,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:04,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3551 backedges. 1616 proven. 47 refuted. 0 times theorem prover too weak. 1888 trivial. 0 not checked. [2019-09-03 21:00:04,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:04,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 9] total 31 [2019-09-03 21:00:04,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:04,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 21:00:04,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 21:00:04,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=686, Unknown=0, NotChecked=0, Total=930 [2019-09-03 21:00:04,876 INFO L87 Difference]: Start difference. First operand 956 states and 1112 transitions. Second operand 27 states. [2019-09-03 21:00:05,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:05,447 INFO L93 Difference]: Finished difference Result 1116 states and 1290 transitions. [2019-09-03 21:00:05,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 21:00:05,449 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 176 [2019-09-03 21:00:05,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:05,449 INFO L225 Difference]: With dead ends: 1116 [2019-09-03 21:00:05,449 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 21:00:05,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 340 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=660, Invalid=1692, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 21:00:05,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 21:00:05,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 21:00:05,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 21:00:05,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 21:00:05,450 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 176 [2019-09-03 21:00:05,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:05,450 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 21:00:05,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 21:00:05,451 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 21:00:05,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 21:00:05,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 09:00:05 BoogieIcfgContainer [2019-09-03 21:00:05,456 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 21:00:05,458 INFO L168 Benchmark]: Toolchain (without parser) took 18862.32 ms. Allocated memory was 132.1 MB in the beginning and 473.4 MB in the end (delta: 341.3 MB). Free memory was 87.0 MB in the beginning and 162.4 MB in the end (delta: -75.5 MB). Peak memory consumption was 265.8 MB. Max. memory is 7.1 GB. [2019-09-03 21:00:05,459 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 132.1 MB. Free memory was 105.1 MB in the beginning and 104.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 21:00:05,460 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.29 ms. Allocated memory is still 132.1 MB. Free memory was 86.5 MB in the beginning and 77.3 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-09-03 21:00:05,460 INFO L168 Benchmark]: Boogie Preprocessor took 125.34 ms. Allocated memory was 132.1 MB in the beginning and 199.8 MB in the end (delta: 67.6 MB). Free memory was 77.3 MB in the beginning and 175.3 MB in the end (delta: -98.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2019-09-03 21:00:05,461 INFO L168 Benchmark]: RCFGBuilder took 261.44 ms. Allocated memory is still 199.8 MB. Free memory was 175.3 MB in the beginning and 163.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. [2019-09-03 21:00:05,462 INFO L168 Benchmark]: TraceAbstraction took 18165.97 ms. Allocated memory was 199.8 MB in the beginning and 473.4 MB in the end (delta: 273.7 MB). Free memory was 162.7 MB in the beginning and 162.4 MB in the end (delta: 283.0 kB). Peak memory consumption was 274.0 MB. Max. memory is 7.1 GB. [2019-09-03 21:00:05,465 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.23 ms. Allocated memory is still 132.1 MB. Free memory was 105.1 MB in the beginning and 104.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 305.29 ms. Allocated memory is still 132.1 MB. Free memory was 86.5 MB in the beginning and 77.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 125.34 ms. Allocated memory was 132.1 MB in the beginning and 199.8 MB in the end (delta: 67.6 MB). Free memory was 77.3 MB in the beginning and 175.3 MB in the end (delta: -98.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 261.44 ms. Allocated memory is still 199.8 MB. Free memory was 175.3 MB in the beginning and 163.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18165.97 ms. Allocated memory was 199.8 MB in the beginning and 473.4 MB in the end (delta: 273.7 MB). Free memory was 162.7 MB in the beginning and 162.4 MB in the end (delta: 283.0 kB). Peak memory consumption was 274.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. SAFE Result, 18.0s OverallTime, 27 OverallIterations, 48 TraceHistogramMax, 8.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 524 SDtfs, 1253 SDslu, 2775 SDs, 0 SdLazy, 3930 SolverSat, 207 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3414 GetRequests, 2786 SyntacticMatches, 7 SemanticMatches, 621 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5515 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=956occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 10 AbstIntIterations, 3 AbstIntStrong, 0.8090277777777777 AbsIntWeakeningRatio, 0.7083333333333334 AbsIntAvgWeakeningVarsNumRemoved, 0.5 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 545 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 3114 NumberOfCodeBlocks, 2699 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 4515 ConstructedInterpolants, 0 QuantifiedInterpolants, 1015644 SizeOfPredicates, 58 NumberOfNonLiveVariables, 2260 ConjunctsInSsa, 269 ConjunctsInUnsatCore, 69 InterpolantComputations, 9 PerfectInterpolantSequences, 40564/47480 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...