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-invgen/seq-3.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:52:26,440 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:52:26,442 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:52:26,453 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:52:26,453 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:52:26,455 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:52:26,456 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:52:26,458 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:52:26,459 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:52:26,460 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:52:26,461 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:52:26,462 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:52:26,463 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:52:26,464 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:52:26,465 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:52:26,466 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:52:26,467 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:52:26,468 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:52:26,469 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:52:26,471 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:52:26,473 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:52:26,474 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:52:26,475 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:52:26,475 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:52:26,477 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:52:26,477 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:52:26,478 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:52:26,478 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:52:26,479 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:52:26,480 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:52:26,480 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:52:26,481 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:52:26,482 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:52:26,482 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:52:26,483 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:52:26,483 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:52:26,484 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:52:26,484 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:52:26,484 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:52:26,485 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:52:26,486 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:52:26,487 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:52:26,501 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:52:26,501 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:52:26,501 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:52:26,502 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:52:26,502 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:52:26,502 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:52:26,503 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:52:26,503 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:52:26,503 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:52:26,503 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:52:26,504 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:52:26,504 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:52:26,504 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:52:26,504 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:52:26,505 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:52:26,505 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:52:26,505 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:52:26,505 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:52:26,505 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:52:26,506 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:52:26,506 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:52:26,506 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:52:26,506 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:52:26,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:52:26,507 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:52:26,507 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:52:26,507 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:52:26,507 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:52:26,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:52:26,508 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:52:26,534 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:52:26,547 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:52:26,550 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:52:26,552 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:52:26,552 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:52:26,552 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/seq-3.i [2019-09-03 20:52:26,628 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3570b06dd/11af4332e4404430a9857f4dc875d6e9/FLAG74442ec7b [2019-09-03 20:52:27,073 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:52:27,073 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/seq-3.i [2019-09-03 20:52:27,079 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3570b06dd/11af4332e4404430a9857f4dc875d6e9/FLAG74442ec7b [2019-09-03 20:52:27,446 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3570b06dd/11af4332e4404430a9857f4dc875d6e9 [2019-09-03 20:52:27,455 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:52:27,457 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:52:27,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:52:27,458 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:52:27,461 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:52:27,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:52:27" (1/1) ... [2019-09-03 20:52:27,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78a18d0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:27, skipping insertion in model container [2019-09-03 20:52:27,465 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:52:27" (1/1) ... [2019-09-03 20:52:27,472 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:52:27,493 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:52:27,735 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:52:27,745 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:52:27,772 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:52:27,788 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:52:27,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:27 WrapperNode [2019-09-03 20:52:27,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:52:27,790 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:52:27,790 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:52:27,790 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:52:27,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:27" (1/1) ... [2019-09-03 20:52:27,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:27" (1/1) ... [2019-09-03 20:52:27,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:27" (1/1) ... [2019-09-03 20:52:27,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:27" (1/1) ... [2019-09-03 20:52:27,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:27" (1/1) ... [2019-09-03 20:52:27,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:27" (1/1) ... [2019-09-03 20:52:27,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:27" (1/1) ... [2019-09-03 20:52:27,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:52:27,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:52:27,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:52:27,989 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:52:27,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:27" (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:52:28,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:52:28,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:52:28,053 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:52:28,053 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:52:28,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:52:28,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 20:52:28,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:52:28,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 20:52:28,054 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:52:28,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:52:28,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:52:28,279 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:52:28,280 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-03 20:52:28,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:52:28 BoogieIcfgContainer [2019-09-03 20:52:28,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:52:28,290 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:52:28,290 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:52:28,295 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:52:28,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:52:27" (1/3) ... [2019-09-03 20:52:28,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33a1f61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:52:28, skipping insertion in model container [2019-09-03 20:52:28,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:27" (2/3) ... [2019-09-03 20:52:28,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33a1f61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:52:28, skipping insertion in model container [2019-09-03 20:52:28,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:52:28" (3/3) ... [2019-09-03 20:52:28,305 INFO L109 eAbstractionObserver]: Analyzing ICFG seq-3.i [2019-09-03 20:52:28,323 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:52:28,330 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:52:28,354 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:52:28,380 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:52:28,380 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:52:28,380 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:52:28,380 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:52:28,381 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:52:28,381 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:52:28,381 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:52:28,381 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:52:28,395 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-09-03 20:52:28,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 20:52:28,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:28,406 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:28,408 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:28,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:28,412 INFO L82 PathProgramCache]: Analyzing trace with hash 2112948751, now seen corresponding path program 1 times [2019-09-03 20:52:28,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:28,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:28,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:28,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:28,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:28,611 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:52:28,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:28,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-03 20:52:28,613 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:28,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:52:28,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:52:28,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:52:28,635 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 7 states. [2019-09-03 20:52:28,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:28,835 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2019-09-03 20:52:28,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:52:28,836 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-09-03 20:52:28,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:28,846 INFO L225 Difference]: With dead ends: 40 [2019-09-03 20:52:28,846 INFO L226 Difference]: Without dead ends: 28 [2019-09-03 20:52:28,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:52:28,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-03 20:52:28,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2019-09-03 20:52:28,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 20:52:28,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-09-03 20:52:28,883 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 16 [2019-09-03 20:52:28,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:28,884 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-09-03 20:52:28,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:52:28,884 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-09-03 20:52:28,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 20:52:28,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:28,885 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:52:28,886 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:28,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:28,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1040035417, now seen corresponding path program 1 times [2019-09-03 20:52:28,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:28,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:28,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:28,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:28,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:28,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:28,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:28,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 20:52:28,962 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:28,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:52:28,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:52:28,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:52:28,965 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 6 states. [2019-09-03 20:52:29,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:29,031 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-09-03 20:52:29,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:52:29,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-09-03 20:52:29,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:29,033 INFO L225 Difference]: With dead ends: 33 [2019-09-03 20:52:29,033 INFO L226 Difference]: Without dead ends: 33 [2019-09-03 20:52:29,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:52:29,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-03 20:52:29,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2019-09-03 20:52:29,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-03 20:52:29,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-09-03 20:52:29,041 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 17 [2019-09-03 20:52:29,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:29,041 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-09-03 20:52:29,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:52:29,041 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-09-03 20:52:29,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 20:52:29,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:29,043 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:29,043 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:29,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:29,043 INFO L82 PathProgramCache]: Analyzing trace with hash 349768240, now seen corresponding path program 1 times [2019-09-03 20:52:29,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:29,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:29,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:29,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:29,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:29,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:29,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:29,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:29,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:29,154 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2019-09-03 20:52:29,159 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [12], [19], [25], [32], [34], [38], [47], [49], [54], [57], [59], [62], [64], [65], [66], [67], [69], [70] [2019-09-03 20:52:29,202 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:52:29,202 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:52:29,439 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:52:29,443 INFO L272 AbstractInterpreter]: Visited 21 different actions 109 times. Merged at 6 different actions 35 times. Widened at 2 different actions 7 times. Performed 198 root evaluator evaluations with a maximum evaluation depth of 6. Performed 198 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 6 fixpoints after 2 different actions. Largest state had 12 variables. [2019-09-03 20:52:29,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:29,451 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:52:29,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:29,451 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:29,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:29,468 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:29,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 20:52:29,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:29,654 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:29,654 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:29,720 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:29,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:29,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2019-09-03 20:52:29,725 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:29,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 20:52:29,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 20:52:29,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:52:29,726 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 14 states. [2019-09-03 20:52:29,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:29,897 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2019-09-03 20:52:29,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:52:29,898 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-09-03 20:52:29,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:29,900 INFO L225 Difference]: With dead ends: 42 [2019-09-03 20:52:29,901 INFO L226 Difference]: Without dead ends: 37 [2019-09-03 20:52:29,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:52:29,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-03 20:52:29,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2019-09-03 20:52:29,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-03 20:52:29,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-09-03 20:52:29,908 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 24 [2019-09-03 20:52:29,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:29,908 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-09-03 20:52:29,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 20:52:29,908 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-09-03 20:52:29,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 20:52:29,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:29,910 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:29,910 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:29,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:29,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1141561007, now seen corresponding path program 1 times [2019-09-03 20:52:29,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:29,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:29,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:29,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:29,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:29,992 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:29,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:29,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:29,993 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2019-09-03 20:52:29,993 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [12], [19], [21], [25], [32], [38], [47], [49], [54], [57], [59], [62], [64], [65], [66], [67], [69], [70] [2019-09-03 20:52:29,995 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:52:29,995 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:52:30,047 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:52:30,047 INFO L272 AbstractInterpreter]: Visited 21 different actions 119 times. Merged at 8 different actions 45 times. Widened at 3 different actions 8 times. Performed 214 root evaluator evaluations with a maximum evaluation depth of 6. Performed 214 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 6 fixpoints after 2 different actions. Largest state had 12 variables. [2019-09-03 20:52:30,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:30,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:52:30,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:30,048 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) [2019-09-03 20:52:30,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:30,074 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:30,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 20:52:30,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:30,166 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:30,167 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:30,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:30,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:30,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2019-09-03 20:52:30,217 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:30,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 20:52:30,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 20:52:30,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:52:30,218 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 13 states. [2019-09-03 20:52:30,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:30,371 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2019-09-03 20:52:30,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:52:30,372 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-09-03 20:52:30,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:30,373 INFO L225 Difference]: With dead ends: 52 [2019-09-03 20:52:30,373 INFO L226 Difference]: Without dead ends: 47 [2019-09-03 20:52:30,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:52:30,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-03 20:52:30,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2019-09-03 20:52:30,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-03 20:52:30,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-09-03 20:52:30,381 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2019-09-03 20:52:30,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:30,381 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-09-03 20:52:30,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 20:52:30,382 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-09-03 20:52:30,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-03 20:52:30,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:30,383 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:30,383 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:30,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:30,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1152042552, now seen corresponding path program 2 times [2019-09-03 20:52:30,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:30,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:30,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:30,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:30,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:30,450 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:30,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:30,451 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:30,451 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:30,452 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:52:30,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:30,452 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:52:30,465 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:30,466 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:52:30,485 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-03 20:52:30,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:30,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 20:52:30,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:30,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:30,530 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:30,532 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:30,579 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:30,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:30,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2019-09-03 20:52:30,582 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:30,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:52:30,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:52:30,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:52:30,584 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 9 states. [2019-09-03 20:52:30,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:30,655 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-09-03 20:52:30,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:52:30,656 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-09-03 20:52:30,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:30,657 INFO L225 Difference]: With dead ends: 43 [2019-09-03 20:52:30,657 INFO L226 Difference]: Without dead ends: 43 [2019-09-03 20:52:30,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:52:30,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-03 20:52:30,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-09-03 20:52:30,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 20:52:30,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-03 20:52:30,663 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 25 [2019-09-03 20:52:30,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:30,664 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-03 20:52:30,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:52:30,664 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-03 20:52:30,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 20:52:30,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:30,665 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:30,665 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:30,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:30,666 INFO L82 PathProgramCache]: Analyzing trace with hash -805836049, now seen corresponding path program 3 times [2019-09-03 20:52:30,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:30,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:30,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:30,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:30,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:30,764 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:30,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:30,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:30,765 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:30,766 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:52:30,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:30,766 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:30,781 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:30,781 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:30,806 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:30,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:30,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 20:52:30,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:30,936 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:30,936 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:31,010 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:31,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:31,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2019-09-03 20:52:31,017 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:31,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 20:52:31,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 20:52:31,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-09-03 20:52:31,018 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 18 states. [2019-09-03 20:52:31,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:31,241 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2019-09-03 20:52:31,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:52:31,241 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-09-03 20:52:31,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:31,242 INFO L225 Difference]: With dead ends: 59 [2019-09-03 20:52:31,243 INFO L226 Difference]: Without dead ends: 51 [2019-09-03 20:52:31,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2019-09-03 20:52:31,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-03 20:52:31,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2019-09-03 20:52:31,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-03 20:52:31,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-09-03 20:52:31,253 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 32 [2019-09-03 20:52:31,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:31,255 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-09-03 20:52:31,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 20:52:31,255 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-09-03 20:52:31,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 20:52:31,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:31,257 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:31,257 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:31,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:31,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1418774638, now seen corresponding path program 1 times [2019-09-03 20:52:31,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:31,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:31,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:31,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:31,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:31,388 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:31,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:31,388 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:31,389 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2019-09-03 20:52:31,389 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [12], [19], [21], [25], [32], [34], [38], [47], [49], [54], [57], [59], [62], [64], [65], [66], [67], [69], [70] [2019-09-03 20:52:31,391 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:52:31,391 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:52:31,486 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:52:31,486 INFO L272 AbstractInterpreter]: Visited 22 different actions 146 times. Merged at 9 different actions 53 times. Widened at 4 different actions 12 times. Performed 308 root evaluator evaluations with a maximum evaluation depth of 6. Performed 308 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 13 fixpoints after 4 different actions. Largest state had 14 variables. [2019-09-03 20:52:31,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:31,487 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:52:31,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:31,487 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:52:31,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:31,502 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:52:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:31,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 20:52:31,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:31,620 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:31,620 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:31,683 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:31,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:31,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2019-09-03 20:52:31,687 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:31,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 20:52:31,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 20:52:31,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:52:31,688 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 17 states. [2019-09-03 20:52:31,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:31,906 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2019-09-03 20:52:31,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 20:52:31,907 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-09-03 20:52:31,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:31,908 INFO L225 Difference]: With dead ends: 70 [2019-09-03 20:52:31,908 INFO L226 Difference]: Without dead ends: 62 [2019-09-03 20:52:31,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 51 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2019-09-03 20:52:31,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-03 20:52:31,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 40. [2019-09-03 20:52:31,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-03 20:52:31,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-09-03 20:52:31,915 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 32 [2019-09-03 20:52:31,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:31,915 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-09-03 20:52:31,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 20:52:31,916 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-09-03 20:52:31,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 20:52:31,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:31,917 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:31,917 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:31,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:31,917 INFO L82 PathProgramCache]: Analyzing trace with hash -726221041, now seen corresponding path program 2 times [2019-09-03 20:52:31,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:31,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:31,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:31,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:31,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:32,023 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:32,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:32,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:32,024 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:32,024 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:52:32,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:32,024 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:52:32,039 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:32,039 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:32,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 20:52:32,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:32,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 20:52:32,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:32,135 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:32,136 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:32,197 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:32,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:32,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2019-09-03 20:52:32,201 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:32,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 20:52:32,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 20:52:32,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:52:32,202 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 16 states. [2019-09-03 20:52:32,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:32,382 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2019-09-03 20:52:32,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 20:52:32,383 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2019-09-03 20:52:32,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:32,384 INFO L225 Difference]: With dead ends: 83 [2019-09-03 20:52:32,384 INFO L226 Difference]: Without dead ends: 75 [2019-09-03 20:52:32,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2019-09-03 20:52:32,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-03 20:52:32,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 42. [2019-09-03 20:52:32,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-03 20:52:32,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-09-03 20:52:32,400 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 32 [2019-09-03 20:52:32,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:32,400 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-09-03 20:52:32,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 20:52:32,400 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-09-03 20:52:32,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-03 20:52:32,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:32,401 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:32,402 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:32,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:32,402 INFO L82 PathProgramCache]: Analyzing trace with hash -747175289, now seen corresponding path program 4 times [2019-09-03 20:52:32,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:32,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:32,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:32,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:32,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:32,494 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:32,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:32,494 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:32,495 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:32,495 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:52:32,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:32,495 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:32,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:32,505 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:32,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 20:52:32,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:32,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:32,537 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:32,538 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:32,574 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:32,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:32,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2019-09-03 20:52:32,578 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:32,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:52:32,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:52:32,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:52:32,580 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 10 states. [2019-09-03 20:52:32,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:32,648 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2019-09-03 20:52:32,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:52:32,649 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2019-09-03 20:52:32,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:32,650 INFO L225 Difference]: With dead ends: 53 [2019-09-03 20:52:32,650 INFO L226 Difference]: Without dead ends: 53 [2019-09-03 20:52:32,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:52:32,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-03 20:52:32,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2019-09-03 20:52:32,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-03 20:52:32,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2019-09-03 20:52:32,655 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 33 [2019-09-03 20:52:32,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:32,655 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2019-09-03 20:52:32,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:52:32,655 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2019-09-03 20:52:32,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 20:52:32,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:32,657 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:32,657 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:32,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:32,657 INFO L82 PathProgramCache]: Analyzing trace with hash -322593456, now seen corresponding path program 5 times [2019-09-03 20:52:32,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:32,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:32,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:32,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:32,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:32,771 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:52:32,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:32,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:32,772 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:32,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:52:32,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:32,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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:32,784 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:32,785 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:32,800 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 20:52:32,800 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:32,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 20:52:32,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:32,963 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:52:32,963 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:33,043 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:52:33,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:33,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 22 [2019-09-03 20:52:33,050 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:33,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 20:52:33,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 20:52:33,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2019-09-03 20:52:33,052 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 22 states. [2019-09-03 20:52:33,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:33,310 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2019-09-03 20:52:33,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 20:52:33,311 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-09-03 20:52:33,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:33,312 INFO L225 Difference]: With dead ends: 76 [2019-09-03 20:52:33,313 INFO L226 Difference]: Without dead ends: 65 [2019-09-03 20:52:33,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 62 SyntacticMatches, 10 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=233, Invalid=759, Unknown=0, NotChecked=0, Total=992 [2019-09-03 20:52:33,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-03 20:52:33,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 50. [2019-09-03 20:52:33,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-03 20:52:33,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2019-09-03 20:52:33,319 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 40 [2019-09-03 20:52:33,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:33,319 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2019-09-03 20:52:33,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 20:52:33,319 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2019-09-03 20:52:33,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 20:52:33,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:33,320 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:33,321 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:33,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:33,321 INFO L82 PathProgramCache]: Analyzing trace with hash -81490993, now seen corresponding path program 2 times [2019-09-03 20:52:33,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:33,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:33,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:33,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:33,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:33,427 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:52:33,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:33,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:33,428 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:33,428 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:52:33,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:33,428 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:52:33,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:33,439 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:33,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 20:52:33,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:33,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 20:52:33,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:33,590 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:52:33,590 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:33,663 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:52:33,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:33,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2019-09-03 20:52:33,667 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:33,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 20:52:33,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 20:52:33,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:52:33,670 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 21 states. [2019-09-03 20:52:33,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:33,920 INFO L93 Difference]: Finished difference Result 91 states and 109 transitions. [2019-09-03 20:52:33,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 20:52:33,921 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-09-03 20:52:33,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:33,922 INFO L225 Difference]: With dead ends: 91 [2019-09-03 20:52:33,922 INFO L226 Difference]: Without dead ends: 80 [2019-09-03 20:52:33,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=869, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 20:52:33,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-03 20:52:33,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 50. [2019-09-03 20:52:33,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-03 20:52:33,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2019-09-03 20:52:33,929 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 40 [2019-09-03 20:52:33,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:33,929 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2019-09-03 20:52:33,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 20:52:33,930 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2019-09-03 20:52:33,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 20:52:33,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:33,931 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:33,931 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:33,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:33,931 INFO L82 PathProgramCache]: Analyzing trace with hash -2013376144, now seen corresponding path program 3 times [2019-09-03 20:52:33,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:33,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:33,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:33,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:33,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:34,009 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:52:34,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:34,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:34,010 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:34,010 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:52:34,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:34,011 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) [2019-09-03 20:52:34,028 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:34,029 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:34,044 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:34,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:34,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 20:52:34,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:34,165 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:52:34,166 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:34,257 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:52:34,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:34,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2019-09-03 20:52:34,261 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:34,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 20:52:34,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 20:52:34,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:52:34,262 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 20 states. [2019-09-03 20:52:34,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:34,548 INFO L93 Difference]: Finished difference Result 105 states and 128 transitions. [2019-09-03 20:52:34,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 20:52:34,549 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2019-09-03 20:52:34,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:34,550 INFO L225 Difference]: With dead ends: 105 [2019-09-03 20:52:34,551 INFO L226 Difference]: Without dead ends: 94 [2019-09-03 20:52:34,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 64 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=869, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 20:52:34,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-03 20:52:34,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 50. [2019-09-03 20:52:34,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-03 20:52:34,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2019-09-03 20:52:34,557 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 40 [2019-09-03 20:52:34,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:34,558 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2019-09-03 20:52:34,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 20:52:34,558 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2019-09-03 20:52:34,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 20:52:34,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:34,559 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:34,559 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:34,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:34,559 INFO L82 PathProgramCache]: Analyzing trace with hash 972346287, now seen corresponding path program 3 times [2019-09-03 20:52:34,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:34,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:34,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:34,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:34,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:34,666 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:52:34,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:34,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:34,667 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:34,667 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:52:34,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:34,668 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:52:34,680 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:34,680 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:34,695 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:34,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:34,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 20:52:34,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:34,810 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:52:34,811 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:34,867 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:52:34,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:34,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 19 [2019-09-03 20:52:34,871 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:34,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 20:52:34,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 20:52:34,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:52:34,872 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 19 states. [2019-09-03 20:52:35,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:35,145 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2019-09-03 20:52:35,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 20:52:35,149 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2019-09-03 20:52:35,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:35,151 INFO L225 Difference]: With dead ends: 121 [2019-09-03 20:52:35,151 INFO L226 Difference]: Without dead ends: 110 [2019-09-03 20:52:35,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 65 SyntacticMatches, 10 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=233, Invalid=759, Unknown=0, NotChecked=0, Total=992 [2019-09-03 20:52:35,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-03 20:52:35,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 52. [2019-09-03 20:52:35,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-03 20:52:35,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2019-09-03 20:52:35,158 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 40 [2019-09-03 20:52:35,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:35,158 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2019-09-03 20:52:35,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 20:52:35,158 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2019-09-03 20:52:35,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-03 20:52:35,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:35,159 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:35,160 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:35,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:35,160 INFO L82 PathProgramCache]: Analyzing trace with hash 803183848, now seen corresponding path program 6 times [2019-09-03 20:52:35,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:35,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:35,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:35,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:35,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:35,217 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:52:35,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:35,218 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:35,218 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:35,218 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:52:35,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:35,218 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) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:35,228 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:35,228 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:35,260 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:35,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:35,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 20:52:35,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:35,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:35,303 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:52:35,303 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:35,344 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:52:35,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:35,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2019-09-03 20:52:35,349 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:35,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:52:35,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:52:35,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:52:35,350 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 11 states. [2019-09-03 20:52:35,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:35,447 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2019-09-03 20:52:35,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:52:35,447 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2019-09-03 20:52:35,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:35,448 INFO L225 Difference]: With dead ends: 63 [2019-09-03 20:52:35,448 INFO L226 Difference]: Without dead ends: 63 [2019-09-03 20:52:35,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 76 SyntacticMatches, 8 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:52:35,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-03 20:52:35,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2019-09-03 20:52:35,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-03 20:52:35,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2019-09-03 20:52:35,454 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 41 [2019-09-03 20:52:35,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:35,454 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2019-09-03 20:52:35,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:52:35,454 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2019-09-03 20:52:35,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 20:52:35,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:35,456 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:35,456 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:35,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:35,458 INFO L82 PathProgramCache]: Analyzing trace with hash 481149903, now seen corresponding path program 7 times [2019-09-03 20:52:35,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:35,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:35,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:35,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:35,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:35,600 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:35,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:35,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:35,601 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:35,601 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:52:35,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:35,601 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) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:35,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:35,615 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:35,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 20:52:35,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:35,822 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:35,822 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:35,917 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:35,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:35,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 26 [2019-09-03 20:52:35,920 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:35,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 20:52:35,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 20:52:35,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-09-03 20:52:35,922 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 26 states. [2019-09-03 20:52:36,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:36,223 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2019-09-03 20:52:36,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 20:52:36,224 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2019-09-03 20:52:36,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:36,226 INFO L225 Difference]: With dead ends: 93 [2019-09-03 20:52:36,226 INFO L226 Difference]: Without dead ends: 79 [2019-09-03 20:52:36,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 74 SyntacticMatches, 12 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=1091, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 20:52:36,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-03 20:52:36,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 60. [2019-09-03 20:52:36,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-03 20:52:36,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2019-09-03 20:52:36,231 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 48 [2019-09-03 20:52:36,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:36,232 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2019-09-03 20:52:36,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 20:52:36,232 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2019-09-03 20:52:36,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 20:52:36,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:36,233 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:36,233 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:36,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:36,234 INFO L82 PathProgramCache]: Analyzing trace with hash 439468878, now seen corresponding path program 4 times [2019-09-03 20:52:36,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:36,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:36,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:36,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:36,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:36,378 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:36,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:36,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:36,379 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:36,379 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:52:36,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:36,380 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) [2019-09-03 20:52:36,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:36,398 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:36,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 20:52:36,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:36,596 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:36,596 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:36,681 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:36,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:36,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 25 [2019-09-03 20:52:36,684 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:36,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 20:52:36,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 20:52:36,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:52:36,685 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 25 states. [2019-09-03 20:52:37,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:37,069 INFO L93 Difference]: Finished difference Result 112 states and 134 transitions. [2019-09-03 20:52:37,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 20:52:37,071 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-09-03 20:52:37,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:37,072 INFO L225 Difference]: With dead ends: 112 [2019-09-03 20:52:37,072 INFO L226 Difference]: Without dead ends: 98 [2019-09-03 20:52:37,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 75 SyntacticMatches, 12 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=1289, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 20:52:37,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-03 20:52:37,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 60. [2019-09-03 20:52:37,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-03 20:52:37,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2019-09-03 20:52:37,078 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 48 [2019-09-03 20:52:37,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:37,078 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2019-09-03 20:52:37,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 20:52:37,079 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2019-09-03 20:52:37,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 20:52:37,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:37,080 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:37,080 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:37,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:37,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1501538321, now seen corresponding path program 5 times [2019-09-03 20:52:37,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:37,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:37,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:37,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:37,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:37,192 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:37,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:37,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:37,193 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:37,193 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:52:37,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:37,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 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:52:37,203 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:37,203 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:37,220 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-03 20:52:37,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:37,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 20:52:37,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:37,394 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:37,394 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:37,480 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:37,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:37,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 24 [2019-09-03 20:52:37,485 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:37,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 20:52:37,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 20:52:37,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:52:37,486 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 24 states. [2019-09-03 20:52:37,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:37,895 INFO L93 Difference]: Finished difference Result 130 states and 158 transitions. [2019-09-03 20:52:37,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 20:52:37,896 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 48 [2019-09-03 20:52:37,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:37,897 INFO L225 Difference]: With dead ends: 130 [2019-09-03 20:52:37,897 INFO L226 Difference]: Without dead ends: 116 [2019-09-03 20:52:37,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 76 SyntacticMatches, 12 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=364, Invalid=1358, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 20:52:37,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-03 20:52:37,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 60. [2019-09-03 20:52:37,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-03 20:52:37,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2019-09-03 20:52:37,903 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 48 [2019-09-03 20:52:37,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:37,904 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2019-09-03 20:52:37,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 20:52:37,904 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2019-09-03 20:52:37,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 20:52:37,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:37,905 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:37,905 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:37,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:37,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1068247854, now seen corresponding path program 6 times [2019-09-03 20:52:37,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:37,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:37,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:37,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:37,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:38,017 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:38,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:38,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:38,018 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:38,018 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:52:38,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:38,019 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:52:38,036 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:38,037 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:38,051 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:38,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:38,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 20:52:38,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:38,223 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:38,223 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:38,314 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:38,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:38,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2019-09-03 20:52:38,318 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:38,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 20:52:38,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 20:52:38,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:52:38,319 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 23 states. [2019-09-03 20:52:38,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:38,697 INFO L93 Difference]: Finished difference Result 147 states and 181 transitions. [2019-09-03 20:52:38,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 20:52:38,698 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-09-03 20:52:38,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:38,700 INFO L225 Difference]: With dead ends: 147 [2019-09-03 20:52:38,700 INFO L226 Difference]: Without dead ends: 133 [2019-09-03 20:52:38,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 77 SyntacticMatches, 12 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=1289, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 20:52:38,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-03 20:52:38,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 60. [2019-09-03 20:52:38,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-03 20:52:38,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2019-09-03 20:52:38,707 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 48 [2019-09-03 20:52:38,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:38,708 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2019-09-03 20:52:38,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 20:52:38,708 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2019-09-03 20:52:38,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 20:52:38,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:38,709 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:38,709 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:38,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:38,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1982428175, now seen corresponding path program 4 times [2019-09-03 20:52:38,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:38,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:38,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:38,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:38,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:38,834 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:38,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:38,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:38,834 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:38,835 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:52:38,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:38,835 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:52:38,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:38,849 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:52:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:38,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 20:52:38,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:39,011 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:39,012 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:39,103 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:39,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:39,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 22 [2019-09-03 20:52:39,107 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:39,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 20:52:39,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 20:52:39,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2019-09-03 20:52:39,108 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 22 states. [2019-09-03 20:52:39,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:39,463 INFO L93 Difference]: Finished difference Result 166 states and 207 transitions. [2019-09-03 20:52:39,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 20:52:39,465 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2019-09-03 20:52:39,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:39,466 INFO L225 Difference]: With dead ends: 166 [2019-09-03 20:52:39,466 INFO L226 Difference]: Without dead ends: 152 [2019-09-03 20:52:39,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 78 SyntacticMatches, 12 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=1091, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 20:52:39,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-03 20:52:39,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 62. [2019-09-03 20:52:39,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-03 20:52:39,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2019-09-03 20:52:39,473 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 48 [2019-09-03 20:52:39,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:39,474 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2019-09-03 20:52:39,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 20:52:39,474 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2019-09-03 20:52:39,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-03 20:52:39,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:39,475 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:39,475 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:39,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:39,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1778035559, now seen corresponding path program 8 times [2019-09-03 20:52:39,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:39,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:39,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:39,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:39,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:39,540 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:39,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:39,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:39,541 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:39,541 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:52:39,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:39,541 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) [2019-09-03 20:52:39,566 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:39,567 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:39,585 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-03 20:52:39,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:39,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 20:52:39,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:39,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:39,616 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:39,616 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:39,694 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:39,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:39,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 12 [2019-09-03 20:52:39,697 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:39,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 20:52:39,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 20:52:39,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:52:39,698 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand 12 states. [2019-09-03 20:52:39,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:39,808 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2019-09-03 20:52:39,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:52:39,808 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2019-09-03 20:52:39,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:39,809 INFO L225 Difference]: With dead ends: 73 [2019-09-03 20:52:39,809 INFO L226 Difference]: Without dead ends: 73 [2019-09-03 20:52:39,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 91 SyntacticMatches, 10 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:52:39,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-03 20:52:39,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2019-09-03 20:52:39,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-03 20:52:39,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2019-09-03 20:52:39,814 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 49 [2019-09-03 20:52:39,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:39,814 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2019-09-03 20:52:39,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 20:52:39,815 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2019-09-03 20:52:39,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 20:52:39,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:39,815 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:39,816 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:39,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:39,816 INFO L82 PathProgramCache]: Analyzing trace with hash 928790640, now seen corresponding path program 9 times [2019-09-03 20:52:39,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:39,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:39,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:39,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:39,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:39,978 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:39,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:39,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:39,979 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:39,979 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:52:39,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:39,980 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) [2019-09-03 20:52:39,997 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:39,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:40,017 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:40,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:40,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 20:52:40,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:40,253 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:40,254 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:40,400 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:40,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:40,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 30 [2019-09-03 20:52:40,405 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:40,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 20:52:40,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 20:52:40,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-09-03 20:52:40,407 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand 30 states. [2019-09-03 20:52:40,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:40,768 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2019-09-03 20:52:40,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 20:52:40,769 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2019-09-03 20:52:40,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:40,770 INFO L225 Difference]: With dead ends: 110 [2019-09-03 20:52:40,770 INFO L226 Difference]: Without dead ends: 93 [2019-09-03 20:52:40,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 86 SyntacticMatches, 14 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=409, Invalid=1483, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 20:52:40,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-03 20:52:40,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 70. [2019-09-03 20:52:40,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-03 20:52:40,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2019-09-03 20:52:40,777 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 56 [2019-09-03 20:52:40,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:40,778 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2019-09-03 20:52:40,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 20:52:40,778 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2019-09-03 20:52:40,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 20:52:40,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:40,779 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:40,779 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:40,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:40,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1167832849, now seen corresponding path program 7 times [2019-09-03 20:52:40,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:40,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:40,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:40,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:40,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:40,918 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 50 proven. 11 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:40,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:40,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:40,919 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:40,919 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:52:40,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:40,919 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 20:52:40,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:40,934 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:40,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 20:52:40,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:41,145 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 50 proven. 11 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:41,145 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:41,245 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 50 proven. 11 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:41,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:41,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 29 [2019-09-03 20:52:41,249 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:41,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 20:52:41,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 20:52:41,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2019-09-03 20:52:41,250 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 29 states. [2019-09-03 20:52:41,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:41,867 INFO L93 Difference]: Finished difference Result 133 states and 159 transitions. [2019-09-03 20:52:41,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 20:52:41,871 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-09-03 20:52:41,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:41,872 INFO L225 Difference]: With dead ends: 133 [2019-09-03 20:52:41,872 INFO L226 Difference]: Without dead ends: 116 [2019-09-03 20:52:41,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 87 SyntacticMatches, 14 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=465, Invalid=1791, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 20:52:41,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-03 20:52:41,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 70. [2019-09-03 20:52:41,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-03 20:52:41,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2019-09-03 20:52:41,877 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 56 [2019-09-03 20:52:41,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:41,877 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2019-09-03 20:52:41,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 20:52:41,877 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2019-09-03 20:52:41,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 20:52:41,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:41,878 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:41,878 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:41,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:41,878 INFO L82 PathProgramCache]: Analyzing trace with hash -404181872, now seen corresponding path program 8 times [2019-09-03 20:52:41,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:41,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:41,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:41,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:41,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:42,021 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 50 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:42,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:42,021 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:42,021 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:42,021 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:52:42,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:42,022 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 20:52:42,040 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:42,040 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 20:52:42,063 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 20:52:42,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:42,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 20:52:42,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:42,302 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 50 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:42,303 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:42,443 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 50 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:42,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:42,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 28 [2019-09-03 20:52:42,449 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:42,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 20:52:42,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 20:52:42,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2019-09-03 20:52:42,450 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 28 states. [2019-09-03 20:52:42,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:42,996 INFO L93 Difference]: Finished difference Result 155 states and 188 transitions. [2019-09-03 20:52:42,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 20:52:42,997 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 56 [2019-09-03 20:52:42,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:42,998 INFO L225 Difference]: With dead ends: 155 [2019-09-03 20:52:42,999 INFO L226 Difference]: Without dead ends: 138 [2019-09-03 20:52:43,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 88 SyntacticMatches, 14 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=496, Invalid=1954, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 20:52:43,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-03 20:52:43,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 70. [2019-09-03 20:52:43,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-03 20:52:43,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2019-09-03 20:52:43,008 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 56 [2019-09-03 20:52:43,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:43,008 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2019-09-03 20:52:43,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 20:52:43,009 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2019-09-03 20:52:43,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 20:52:43,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:43,010 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:43,010 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:43,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:43,010 INFO L82 PathProgramCache]: Analyzing trace with hash 174641359, now seen corresponding path program 9 times [2019-09-03 20:52:43,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:43,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:43,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:43,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:43,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:43,166 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 50 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:43,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:43,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:43,166 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:43,167 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:52:43,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:43,167 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:52:43,185 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:43,185 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:43,204 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:43,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:43,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 20:52:43,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:43,388 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 50 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:43,388 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:43,487 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 50 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:43,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:43,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2019-09-03 20:52:43,490 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:43,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 20:52:43,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 20:52:43,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2019-09-03 20:52:43,491 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 27 states. [2019-09-03 20:52:43,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:43,999 INFO L93 Difference]: Finished difference Result 176 states and 216 transitions. [2019-09-03 20:52:44,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 20:52:44,000 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 56 [2019-09-03 20:52:44,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:44,002 INFO L225 Difference]: With dead ends: 176 [2019-09-03 20:52:44,002 INFO L226 Difference]: Without dead ends: 159 [2019-09-03 20:52:44,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 89 SyntacticMatches, 14 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=1954, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 20:52:44,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-09-03 20:52:44,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 70. [2019-09-03 20:52:44,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-03 20:52:44,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2019-09-03 20:52:44,008 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 56 [2019-09-03 20:52:44,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:44,008 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2019-09-03 20:52:44,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 20:52:44,008 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2019-09-03 20:52:44,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 20:52:44,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:44,009 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:44,009 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:44,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:44,009 INFO L82 PathProgramCache]: Analyzing trace with hash 54765744, now seen corresponding path program 10 times [2019-09-03 20:52:44,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:44,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:44,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:44,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:44,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:44,167 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 50 proven. 11 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:44,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:44,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:44,167 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:44,168 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:52:44,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:44,168 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:52:44,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:44,181 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:44,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 20:52:44,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:44,425 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 50 proven. 11 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:44,425 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:44,579 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 50 proven. 11 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:44,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:44,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 26 [2019-09-03 20:52:44,584 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:44,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 20:52:44,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 20:52:44,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2019-09-03 20:52:44,586 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 26 states. [2019-09-03 20:52:45,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:45,059 INFO L93 Difference]: Finished difference Result 196 states and 243 transitions. [2019-09-03 20:52:45,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 20:52:45,060 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2019-09-03 20:52:45,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:45,061 INFO L225 Difference]: With dead ends: 196 [2019-09-03 20:52:45,062 INFO L226 Difference]: Without dead ends: 179 [2019-09-03 20:52:45,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 90 SyntacticMatches, 14 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=465, Invalid=1791, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 20:52:45,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-03 20:52:45,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 70. [2019-09-03 20:52:45,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-03 20:52:45,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2019-09-03 20:52:45,069 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 56 [2019-09-03 20:52:45,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:45,069 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2019-09-03 20:52:45,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 20:52:45,069 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2019-09-03 20:52:45,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 20:52:45,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:45,071 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:45,071 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:45,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:45,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1750216529, now seen corresponding path program 5 times [2019-09-03 20:52:45,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:45,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:45,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:45,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:45,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:45,191 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:45,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:45,191 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:45,191 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:45,191 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:52:45,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:45,192 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:45,201 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:45,201 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:45,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 20:52:45,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:45,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 20:52:45,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:45,370 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:45,371 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:45,470 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:45,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:45,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2019-09-03 20:52:45,473 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:45,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 20:52:45,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 20:52:45,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:52:45,475 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 25 states. [2019-09-03 20:52:45,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:45,842 INFO L93 Difference]: Finished difference Result 218 states and 273 transitions. [2019-09-03 20:52:45,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 20:52:45,843 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 56 [2019-09-03 20:52:45,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:45,845 INFO L225 Difference]: With dead ends: 218 [2019-09-03 20:52:45,845 INFO L226 Difference]: Without dead ends: 201 [2019-09-03 20:52:45,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 91 SyntacticMatches, 14 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=409, Invalid=1483, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 20:52:45,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-03 20:52:45,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 72. [2019-09-03 20:52:45,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-03 20:52:45,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2019-09-03 20:52:45,852 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 56 [2019-09-03 20:52:45,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:45,852 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2019-09-03 20:52:45,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 20:52:45,852 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2019-09-03 20:52:45,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-03 20:52:45,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:45,853 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:45,853 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:45,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:45,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1098123272, now seen corresponding path program 10 times [2019-09-03 20:52:45,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:45,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:45,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:45,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:45,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:45,917 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 31 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:45,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:45,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:45,917 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:45,917 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:52:45,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:45,917 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:45,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:45,929 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:45,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 20:52:45,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:45,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:45,972 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 31 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:45,972 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:46,055 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 31 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:46,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:46,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2019-09-03 20:52:46,058 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:46,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 20:52:46,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 20:52:46,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:52:46,059 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 13 states. [2019-09-03 20:52:46,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:46,157 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2019-09-03 20:52:46,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:52:46,157 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-09-03 20:52:46,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:46,158 INFO L225 Difference]: With dead ends: 83 [2019-09-03 20:52:46,158 INFO L226 Difference]: Without dead ends: 83 [2019-09-03 20:52:46,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 106 SyntacticMatches, 12 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:52:46,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-03 20:52:46,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2019-09-03 20:52:46,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-03 20:52:46,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2019-09-03 20:52:46,163 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 57 [2019-09-03 20:52:46,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:46,163 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2019-09-03 20:52:46,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 20:52:46,163 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2019-09-03 20:52:46,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 20:52:46,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:46,164 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:46,164 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:46,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:46,165 INFO L82 PathProgramCache]: Analyzing trace with hash -159345489, now seen corresponding path program 11 times [2019-09-03 20:52:46,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:46,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:46,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:46,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:46,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:46,471 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:46,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:46,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:46,471 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:46,471 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:52:46,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:46,472 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:46,481 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:46,481 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:46,505 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-03 20:52:46,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:46,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 20:52:46,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:46,762 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:46,762 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:46,925 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:46,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:46,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 34 [2019-09-03 20:52:46,930 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:46,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 20:52:46,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 20:52:46,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 20:52:46,932 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 34 states. [2019-09-03 20:52:47,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:47,414 INFO L93 Difference]: Finished difference Result 127 states and 149 transitions. [2019-09-03 20:52:47,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 20:52:47,414 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2019-09-03 20:52:47,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:47,416 INFO L225 Difference]: With dead ends: 127 [2019-09-03 20:52:47,416 INFO L226 Difference]: Without dead ends: 107 [2019-09-03 20:52:47,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 98 SyntacticMatches, 16 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=515, Invalid=1935, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 20:52:47,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-03 20:52:47,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 80. [2019-09-03 20:52:47,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-03 20:52:47,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2019-09-03 20:52:47,422 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 64 [2019-09-03 20:52:47,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:47,422 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2019-09-03 20:52:47,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 20:52:47,422 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2019-09-03 20:52:47,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 20:52:47,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:47,423 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:47,424 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:47,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:47,424 INFO L82 PathProgramCache]: Analyzing trace with hash -966019538, now seen corresponding path program 11 times [2019-09-03 20:52:47,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:47,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:47,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:47,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:47,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:47,598 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 69 proven. 16 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:47,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:47,598 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:47,598 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:47,598 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:52:47,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:47,599 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:47,610 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:47,610 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:47,633 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-03 20:52:47,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:47,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 20:52:47,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:47,865 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 69 proven. 16 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:47,866 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:47,979 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 69 proven. 16 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:47,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:47,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 33 [2019-09-03 20:52:47,982 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:47,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 20:52:47,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 20:52:47,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=842, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 20:52:47,983 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 33 states. [2019-09-03 20:52:48,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:48,480 INFO L93 Difference]: Finished difference Result 154 states and 184 transitions. [2019-09-03 20:52:48,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 20:52:48,481 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-09-03 20:52:48,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:48,482 INFO L225 Difference]: With dead ends: 154 [2019-09-03 20:52:48,482 INFO L226 Difference]: Without dead ends: 134 [2019-09-03 20:52:48,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 99 SyntacticMatches, 16 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=595, Invalid=2375, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 20:52:48,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-03 20:52:48,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 80. [2019-09-03 20:52:48,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-03 20:52:48,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2019-09-03 20:52:48,487 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 64 [2019-09-03 20:52:48,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:48,487 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2019-09-03 20:52:48,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 20:52:48,488 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2019-09-03 20:52:48,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 20:52:48,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:48,488 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:48,489 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:48,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:48,489 INFO L82 PathProgramCache]: Analyzing trace with hash -437851953, now seen corresponding path program 12 times [2019-09-03 20:52:48,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:48,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:48,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:48,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:48,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:48,634 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 69 proven. 13 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:48,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:48,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:48,635 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:48,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:52:48,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:48,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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:48,653 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:48,653 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:48,674 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:48,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:48,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 20:52:48,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:48,885 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 69 proven. 13 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:48,886 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:49,044 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 69 proven. 13 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:49,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:49,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 32 [2019-09-03 20:52:49,048 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:49,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 20:52:49,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 20:52:49,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2019-09-03 20:52:49,049 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 32 states. [2019-09-03 20:52:49,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:49,708 INFO L93 Difference]: Finished difference Result 180 states and 218 transitions. [2019-09-03 20:52:49,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 20:52:49,708 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 64 [2019-09-03 20:52:49,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:49,710 INFO L225 Difference]: With dead ends: 180 [2019-09-03 20:52:49,710 INFO L226 Difference]: Without dead ends: 160 [2019-09-03 20:52:49,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 100 SyntacticMatches, 16 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1236 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=649, Invalid=2657, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 20:52:49,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-03 20:52:49,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 80. [2019-09-03 20:52:49,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-03 20:52:49,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2019-09-03 20:52:49,721 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 64 [2019-09-03 20:52:49,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:49,721 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2019-09-03 20:52:49,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 20:52:49,721 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2019-09-03 20:52:49,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 20:52:49,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:49,722 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:49,723 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:49,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:49,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1529192946, now seen corresponding path program 13 times [2019-09-03 20:52:49,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:49,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:49,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:49,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:49,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:49,894 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 69 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:49,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:49,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:49,895 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:49,895 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:52:49,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:49,895 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:49,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:49,914 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:49,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 20:52:49,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:50,170 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 69 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:50,170 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:50,285 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 69 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:50,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:50,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 31 [2019-09-03 20:52:50,288 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:50,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 20:52:50,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 20:52:50,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=746, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:52:50,289 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 31 states. [2019-09-03 20:52:50,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:50,870 INFO L93 Difference]: Finished difference Result 205 states and 251 transitions. [2019-09-03 20:52:50,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 20:52:50,871 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 64 [2019-09-03 20:52:50,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:50,873 INFO L225 Difference]: With dead ends: 205 [2019-09-03 20:52:50,873 INFO L226 Difference]: Without dead ends: 185 [2019-09-03 20:52:50,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 101 SyntacticMatches, 16 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1248 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=668, Invalid=2754, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 20:52:50,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-03 20:52:50,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 80. [2019-09-03 20:52:50,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-03 20:52:50,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2019-09-03 20:52:50,879 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 64 [2019-09-03 20:52:50,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:50,880 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2019-09-03 20:52:50,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 20:52:50,880 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2019-09-03 20:52:50,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 20:52:50,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:50,881 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:50,881 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:50,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:50,881 INFO L82 PathProgramCache]: Analyzing trace with hash -317471505, now seen corresponding path program 14 times [2019-09-03 20:52:50,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:50,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:50,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:50,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:50,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:51,049 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 69 proven. 13 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:51,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:51,049 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:51,050 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:51,050 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:52:51,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:51,050 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:51,059 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:51,059 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:51,082 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-03 20:52:51,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:51,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 20:52:51,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:51,308 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 69 proven. 13 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:51,308 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:51,422 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 69 proven. 13 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:51,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:51,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 30 [2019-09-03 20:52:51,426 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:51,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 20:52:51,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 20:52:51,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2019-09-03 20:52:51,428 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 30 states. [2019-09-03 20:52:52,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:52,032 INFO L93 Difference]: Finished difference Result 229 states and 283 transitions. [2019-09-03 20:52:52,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 20:52:52,033 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 64 [2019-09-03 20:52:52,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:52,034 INFO L225 Difference]: With dead ends: 229 [2019-09-03 20:52:52,034 INFO L226 Difference]: Without dead ends: 209 [2019-09-03 20:52:52,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 102 SyntacticMatches, 16 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=649, Invalid=2657, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 20:52:52,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-03 20:52:52,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 80. [2019-09-03 20:52:52,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-03 20:52:52,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2019-09-03 20:52:52,043 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 64 [2019-09-03 20:52:52,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:52,043 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2019-09-03 20:52:52,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 20:52:52,043 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2019-09-03 20:52:52,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 20:52:52,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:52,045 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:52,045 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:52,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:52,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1802404370, now seen corresponding path program 15 times [2019-09-03 20:52:52,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:52,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:52,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:52,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:52,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:52,213 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 69 proven. 16 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:52,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:52,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:52,214 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:52,214 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:52:52,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:52,214 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:52:52,227 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:52,227 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:52,248 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:52,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:52,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 20:52:52,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:52,451 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 69 proven. 16 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:52,452 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:52,558 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 69 proven. 16 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:52,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:52,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 29 [2019-09-03 20:52:52,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:52,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 20:52:52,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 20:52:52,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2019-09-03 20:52:52,562 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 29 states. [2019-09-03 20:52:53,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:53,171 INFO L93 Difference]: Finished difference Result 252 states and 314 transitions. [2019-09-03 20:52:53,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 20:52:53,171 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 64 [2019-09-03 20:52:53,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:53,173 INFO L225 Difference]: With dead ends: 252 [2019-09-03 20:52:53,173 INFO L226 Difference]: Without dead ends: 232 [2019-09-03 20:52:53,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 103 SyntacticMatches, 16 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=595, Invalid=2375, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 20:52:53,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-09-03 20:52:53,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 80. [2019-09-03 20:52:53,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-03 20:52:53,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2019-09-03 20:52:53,187 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 64 [2019-09-03 20:52:53,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:53,187 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2019-09-03 20:52:53,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 20:52:53,187 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2019-09-03 20:52:53,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 20:52:53,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:53,188 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:53,188 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:53,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:53,189 INFO L82 PathProgramCache]: Analyzing trace with hash -603379441, now seen corresponding path program 6 times [2019-09-03 20:52:53,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:53,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:53,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:53,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:53,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:53,397 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:53,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:53,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:53,398 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:53,398 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:52:53,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:53,399 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:53,426 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:53,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:53,453 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:53,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:53,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 20:52:53,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:53,680 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:53,681 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:53,815 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:53,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:53,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 28 [2019-09-03 20:52:53,819 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:53,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 20:52:53,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 20:52:53,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2019-09-03 20:52:53,821 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 28 states. [2019-09-03 20:52:54,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:54,291 INFO L93 Difference]: Finished difference Result 277 states and 348 transitions. [2019-09-03 20:52:54,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 20:52:54,295 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 64 [2019-09-03 20:52:54,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:54,296 INFO L225 Difference]: With dead ends: 277 [2019-09-03 20:52:54,296 INFO L226 Difference]: Without dead ends: 257 [2019-09-03 20:52:54,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 104 SyntacticMatches, 16 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=515, Invalid=1935, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 20:52:54,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-09-03 20:52:54,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 82. [2019-09-03 20:52:54,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-03 20:52:54,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2019-09-03 20:52:54,303 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 64 [2019-09-03 20:52:54,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:54,304 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2019-09-03 20:52:54,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 20:52:54,304 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2019-09-03 20:52:54,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-03 20:52:54,304 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:54,304 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:54,305 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:54,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:54,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1476086855, now seen corresponding path program 12 times [2019-09-03 20:52:54,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:54,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:54,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:54,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:54,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:54,386 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:54,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:54,386 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:54,387 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:54,387 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:52:54,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:54,387 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:54,403 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:54,403 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:54,423 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:54,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:54,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 20:52:54,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:54,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:54,445 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:54,445 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:54,522 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:54,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:54,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 14 [2019-09-03 20:52:54,526 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:54,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 20:52:54,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 20:52:54,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:52:54,527 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 14 states. [2019-09-03 20:52:54,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:54,670 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2019-09-03 20:52:54,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 20:52:54,671 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-09-03 20:52:54,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:54,672 INFO L225 Difference]: With dead ends: 93 [2019-09-03 20:52:54,672 INFO L226 Difference]: Without dead ends: 93 [2019-09-03 20:52:54,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 121 SyntacticMatches, 14 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:52:54,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-03 20:52:54,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2019-09-03 20:52:54,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-03 20:52:54,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2019-09-03 20:52:54,677 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 65 [2019-09-03 20:52:54,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:54,677 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2019-09-03 20:52:54,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 20:52:54,677 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2019-09-03 20:52:54,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 20:52:54,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:54,678 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:54,678 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:54,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:54,679 INFO L82 PathProgramCache]: Analyzing trace with hash 711908240, now seen corresponding path program 13 times [2019-09-03 20:52:54,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:54,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:54,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:54,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:54,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:54,860 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:52:54,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:54,860 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:54,860 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:54,860 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:52:54,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:54,860 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:54,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:54,870 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:54,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 20:52:54,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:55,205 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:52:55,205 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:55,346 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:52:55,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:55,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 38 [2019-09-03 20:52:55,349 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:55,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 20:52:55,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 20:52:55,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1115, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 20:52:55,350 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 38 states. [2019-09-03 20:52:55,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:55,922 INFO L93 Difference]: Finished difference Result 144 states and 169 transitions. [2019-09-03 20:52:55,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 20:52:55,923 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2019-09-03 20:52:55,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:55,924 INFO L225 Difference]: With dead ends: 144 [2019-09-03 20:52:55,924 INFO L226 Difference]: Without dead ends: 121 [2019-09-03 20:52:55,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 110 SyntacticMatches, 18 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1336 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=633, Invalid=2447, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 20:52:55,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-03 20:52:55,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 90. [2019-09-03 20:52:55,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-03 20:52:55,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-09-03 20:52:55,929 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 72 [2019-09-03 20:52:55,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:55,930 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-09-03 20:52:55,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 20:52:55,930 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-09-03 20:52:55,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 20:52:55,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:55,931 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:55,931 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:55,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:55,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1067191823, now seen corresponding path program 16 times [2019-09-03 20:52:55,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:55,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:55,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:55,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:55,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:56,134 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 91 proven. 22 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:52:56,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:56,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:56,135 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:56,135 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:52:56,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:56,135 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:52:56,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:56,156 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:56,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 20:52:56,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:56,498 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 91 proven. 22 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:52:56,499 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 91 proven. 22 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:52:56,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:56,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 37 [2019-09-03 20:52:56,691 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:56,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 20:52:56,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 20:52:56,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=1065, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 20:52:56,693 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 37 states. [2019-09-03 20:52:57,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:57,415 INFO L93 Difference]: Finished difference Result 175 states and 209 transitions. [2019-09-03 20:52:57,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 20:52:57,420 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-09-03 20:52:57,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:57,421 INFO L225 Difference]: With dead ends: 175 [2019-09-03 20:52:57,421 INFO L226 Difference]: Without dead ends: 152 [2019-09-03 20:52:57,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 111 SyntacticMatches, 18 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1524 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=741, Invalid=3041, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 20:52:57,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-03 20:52:57,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 90. [2019-09-03 20:52:57,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-03 20:52:57,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-09-03 20:52:57,427 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 72 [2019-09-03 20:52:57,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:57,429 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-09-03 20:52:57,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 20:52:57,429 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-09-03 20:52:57,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 20:52:57,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:57,430 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:57,430 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:57,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:57,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1355747248, now seen corresponding path program 17 times [2019-09-03 20:52:57,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:57,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:57,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:57,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:57,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:57,635 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 91 proven. 18 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:52:57,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:57,635 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:57,636 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:57,636 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:52:57,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:57,636 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:57,649 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:57,649 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:57,677 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-03 20:52:57,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:57,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 20:52:57,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:57,964 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 91 proven. 18 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:52:57,964 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:58,094 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 91 proven. 18 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (37)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:52:58,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:58,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 36 [2019-09-03 20:52:58,098 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:58,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 20:52:58,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 20:52:58,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1013, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 20:52:58,098 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 36 states. [2019-09-03 20:52:58,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:58,762 INFO L93 Difference]: Finished difference Result 205 states and 248 transitions. [2019-09-03 20:52:58,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 20:52:58,763 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 72 [2019-09-03 20:52:58,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:58,764 INFO L225 Difference]: With dead ends: 205 [2019-09-03 20:52:58,764 INFO L226 Difference]: Without dead ends: 182 [2019-09-03 20:52:58,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 112 SyntacticMatches, 18 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1662 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=823, Invalid=3467, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 20:52:58,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-03 20:52:58,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 90. [2019-09-03 20:52:58,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-03 20:52:58,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-09-03 20:52:58,769 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 72 [2019-09-03 20:52:58,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:58,770 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-09-03 20:52:58,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 20:52:58,770 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-09-03 20:52:58,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 20:52:58,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:58,771 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:58,771 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:58,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:58,771 INFO L82 PathProgramCache]: Analyzing trace with hash 810866159, now seen corresponding path program 18 times [2019-09-03 20:52:58,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:58,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:58,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:58,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:58,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:58,946 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 91 proven. 16 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:52:58,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:58,946 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:58,946 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:58,946 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:52:58,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:58,947 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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:58,956 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:58,956 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:58,980 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:58,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:58,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 20:52:58,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:59,226 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 91 proven. 16 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:52:59,226 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:59,397 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 91 proven. 16 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:52:59,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:59,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 35 [2019-09-03 20:52:59,400 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:59,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 20:52:59,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 20:52:59,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=959, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 20:52:59,401 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 35 states. [2019-09-03 20:53:00,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:00,218 INFO L93 Difference]: Finished difference Result 234 states and 286 transitions. [2019-09-03 20:53:00,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 20:53:00,219 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 72 [2019-09-03 20:53:00,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:00,221 INFO L225 Difference]: With dead ends: 234 [2019-09-03 20:53:00,221 INFO L226 Difference]: Without dead ends: 211 [2019-09-03 20:53:00,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 113 SyntacticMatches, 18 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1724 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=867, Invalid=3689, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 20:53:00,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-03 20:53:00,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 90. [2019-09-03 20:53:00,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-03 20:53:00,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-09-03 20:53:00,226 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 72 [2019-09-03 20:53:00,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:00,226 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-09-03 20:53:00,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 20:53:00,227 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-09-03 20:53:00,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 20:53:00,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:00,227 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:00,228 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:00,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:00,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1007825968, now seen corresponding path program 19 times [2019-09-03 20:53:00,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:00,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:00,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:00,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:00,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:00,412 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 91 proven. 16 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:53:00,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:00,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:00,413 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:00,413 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:53:00,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:00,413 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:00,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:00,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:00,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 20:53:00,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:00,695 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 91 proven. 16 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:53:00,696 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:00,830 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 91 proven. 16 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:53:00,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:00,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 34 [2019-09-03 20:53:00,833 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:00,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 20:53:00,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 20:53:00,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=903, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 20:53:00,834 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 34 states. [2019-09-03 20:53:01,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:01,595 INFO L93 Difference]: Finished difference Result 262 states and 323 transitions. [2019-09-03 20:53:01,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 20:53:01,595 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 72 [2019-09-03 20:53:01,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:01,597 INFO L225 Difference]: With dead ends: 262 [2019-09-03 20:53:01,597 INFO L226 Difference]: Without dead ends: 239 [2019-09-03 20:53:01,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 114 SyntacticMatches, 18 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1696 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=867, Invalid=3689, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 20:53:01,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-09-03 20:53:01,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 90. [2019-09-03 20:53:01,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-03 20:53:01,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-09-03 20:53:01,603 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 72 [2019-09-03 20:53:01,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:01,603 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-09-03 20:53:01,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 20:53:01,604 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-09-03 20:53:01,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 20:53:01,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:01,604 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:01,604 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:01,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:01,605 INFO L82 PathProgramCache]: Analyzing trace with hash 2120095183, now seen corresponding path program 20 times [2019-09-03 20:53:01,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:01,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:01,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:01,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:01,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:01,838 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 91 proven. 18 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:53:01,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:01,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:01,839 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:01,839 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:53:01,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:01,839 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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:01,855 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:01,855 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:01,885 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-03 20:53:01,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:01,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 20:53:01,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:02,163 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 91 proven. 18 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:53:02,163 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:02,299 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 91 proven. 18 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:53:02,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:02,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 33 [2019-09-03 20:53:02,302 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:02,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 20:53:02,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 20:53:02,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=845, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 20:53:02,303 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 33 states. [2019-09-03 20:53:02,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:02,974 INFO L93 Difference]: Finished difference Result 289 states and 359 transitions. [2019-09-03 20:53:02,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 20:53:02,975 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 72 [2019-09-03 20:53:02,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:02,977 INFO L225 Difference]: With dead ends: 289 [2019-09-03 20:53:02,978 INFO L226 Difference]: Without dead ends: 266 [2019-09-03 20:53:02,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 115 SyntacticMatches, 18 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1572 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=823, Invalid=3467, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 20:53:02,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-09-03 20:53:02,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 90. [2019-09-03 20:53:02,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-03 20:53:02,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-09-03 20:53:02,984 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 72 [2019-09-03 20:53:02,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:02,984 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-09-03 20:53:02,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 20:53:02,984 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-09-03 20:53:02,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 20:53:02,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:02,985 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:02,985 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:02,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:02,986 INFO L82 PathProgramCache]: Analyzing trace with hash 835522544, now seen corresponding path program 21 times [2019-09-03 20:53:02,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:02,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:02,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:02,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:02,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:03,206 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 91 proven. 22 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:53:03,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:03,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:03,206 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:03,206 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:53:03,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:03,207 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:53:03,226 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:03,227 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:03,254 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:03,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:03,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 20:53:03,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:03,506 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 91 proven. 22 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:53:03,507 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:03,648 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 91 proven. 22 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:53:03,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:03,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 32 [2019-09-03 20:53:03,652 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:03,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 20:53:03,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 20:53:03,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=785, Unknown=0, NotChecked=0, Total=992 [2019-09-03 20:53:03,653 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 32 states. [2019-09-03 20:53:04,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:04,334 INFO L93 Difference]: Finished difference Result 315 states and 394 transitions. [2019-09-03 20:53:04,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 20:53:04,335 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 72 [2019-09-03 20:53:04,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:04,337 INFO L225 Difference]: With dead ends: 315 [2019-09-03 20:53:04,337 INFO L226 Difference]: Without dead ends: 292 [2019-09-03 20:53:04,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 116 SyntacticMatches, 18 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1354 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=741, Invalid=3041, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 20:53:04,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-09-03 20:53:04,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 90. [2019-09-03 20:53:04,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-03 20:53:04,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-09-03 20:53:04,344 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 72 [2019-09-03 20:53:04,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:04,344 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-09-03 20:53:04,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 20:53:04,345 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-09-03 20:53:04,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 20:53:04,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:04,345 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:04,345 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:04,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:04,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1284125265, now seen corresponding path program 7 times [2019-09-03 20:53:04,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:04,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:04,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:04,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:04,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:04,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:04,534 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:53:04,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:04,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:04,535 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:04,535 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:53:04,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:04,535 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:04,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:04,545 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:04,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 20:53:04,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:04,788 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:53:04,788 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:04,939 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:53:04,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:04,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 31 [2019-09-03 20:53:04,942 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:04,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 20:53:04,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 20:53:04,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:53:04,943 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 31 states. [2019-09-03 20:53:05,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:05,538 INFO L93 Difference]: Finished difference Result 343 states and 432 transitions. [2019-09-03 20:53:05,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 20:53:05,538 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 72 [2019-09-03 20:53:05,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:05,540 INFO L225 Difference]: With dead ends: 343 [2019-09-03 20:53:05,541 INFO L226 Difference]: Without dead ends: 320 [2019-09-03 20:53:05,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 117 SyntacticMatches, 18 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1056 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=633, Invalid=2447, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 20:53:05,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-03 20:53:05,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 92. [2019-09-03 20:53:05,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-03 20:53:05,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2019-09-03 20:53:05,548 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 72 [2019-09-03 20:53:05,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:05,548 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2019-09-03 20:53:05,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 20:53:05,548 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2019-09-03 20:53:05,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-03 20:53:05,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:05,549 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:05,549 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:05,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:05,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1709472552, now seen corresponding path program 14 times [2019-09-03 20:53:05,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:05,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:05,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:05,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:05,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:05,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:05,657 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 50 proven. 77 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:53:05,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:05,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:05,658 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:05,658 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:53:05,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:05,658 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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:05,670 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:05,670 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:05,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-03 20:53:05,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:05,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 20:53:05,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:05,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:05,720 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 50 proven. 77 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:53:05,720 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:05,814 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 50 proven. 77 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:53:05,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:05,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 15 [2019-09-03 20:53:05,817 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:05,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 20:53:05,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 20:53:05,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:53:05,818 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 15 states. [2019-09-03 20:53:05,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:05,974 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2019-09-03 20:53:05,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 20:53:05,974 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2019-09-03 20:53:05,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:05,975 INFO L225 Difference]: With dead ends: 103 [2019-09-03 20:53:05,975 INFO L226 Difference]: Without dead ends: 103 [2019-09-03 20:53:05,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 136 SyntacticMatches, 16 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:53:05,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-03 20:53:05,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-09-03 20:53:05,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-03 20:53:05,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2019-09-03 20:53:05,979 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 73 [2019-09-03 20:53:05,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:05,980 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2019-09-03 20:53:05,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 20:53:05,980 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2019-09-03 20:53:05,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 20:53:05,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:05,981 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:05,981 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:05,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:05,981 INFO L82 PathProgramCache]: Analyzing trace with hash 392060303, now seen corresponding path program 15 times [2019-09-03 20:53:05,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:05,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:05,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:05,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:05,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:06,262 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 116 proven. 36 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:53:06,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:06,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:06,263 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:06,263 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:53:06,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:06,263 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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:06,283 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:06,284 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:06,309 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:06,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:06,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 20:53:06,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:06,691 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 116 proven. 36 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:53:06,691 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:06,865 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 116 proven. 36 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:53:06,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:06,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 42 [2019-09-03 20:53:06,869 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:06,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-03 20:53:06,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-03 20:53:06,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=1369, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 20:53:06,870 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 42 states. [2019-09-03 20:53:07,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:07,553 INFO L93 Difference]: Finished difference Result 161 states and 189 transitions. [2019-09-03 20:53:07,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 20:53:07,553 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2019-09-03 20:53:07,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:07,555 INFO L225 Difference]: With dead ends: 161 [2019-09-03 20:53:07,555 INFO L226 Difference]: Without dead ends: 135 [2019-09-03 20:53:07,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 122 SyntacticMatches, 20 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1688 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=763, Invalid=3019, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 20:53:07,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-09-03 20:53:07,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 100. [2019-09-03 20:53:07,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-03 20:53:07,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2019-09-03 20:53:07,559 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 80 [2019-09-03 20:53:07,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:07,559 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2019-09-03 20:53:07,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-03 20:53:07,560 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2019-09-03 20:53:07,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 20:53:07,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:07,560 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:07,561 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:07,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:07,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1691574002, now seen corresponding path program 22 times [2019-09-03 20:53:07,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:07,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:07,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:07,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:07,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:07,764 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 116 proven. 29 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:53:07,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:07,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:07,765 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:07,765 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:53:07,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:07,765 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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:07,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:07,776 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:07,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 20:53:07,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:08,284 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 116 proven. 29 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:53:08,284 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:08,551 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 116 proven. 29 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:53:08,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:08,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 41 [2019-09-03 20:53:08,555 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:08,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 20:53:08,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 20:53:08,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1314, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 20:53:08,556 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 41 states. [2019-09-03 20:53:09,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:09,338 INFO L93 Difference]: Finished difference Result 196 states and 234 transitions. [2019-09-03 20:53:09,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 20:53:09,338 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-09-03 20:53:09,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:09,340 INFO L225 Difference]: With dead ends: 196 [2019-09-03 20:53:09,340 INFO L226 Difference]: Without dead ends: 170 [2019-09-03 20:53:09,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 123 SyntacticMatches, 20 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1944 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=903, Invalid=3789, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 20:53:09,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-03 20:53:09,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 100. [2019-09-03 20:53:09,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-03 20:53:09,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2019-09-03 20:53:09,344 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 80 [2019-09-03 20:53:09,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:09,344 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2019-09-03 20:53:09,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 20:53:09,344 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2019-09-03 20:53:09,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 20:53:09,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:09,345 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:09,345 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:09,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:09,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1289253295, now seen corresponding path program 23 times [2019-09-03 20:53:09,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:09,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:09,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:09,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:09,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:09,551 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 116 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:53:09,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:09,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:09,551 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:09,552 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:53:09,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:09,552 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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:09,563 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:09,563 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:09,605 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-03 20:53:09,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:09,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 20:53:09,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:09,934 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 116 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:53:09,934 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:10,129 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 116 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:53:10,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:10,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 40 [2019-09-03 20:53:10,133 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:10,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 20:53:10,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 20:53:10,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=1257, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 20:53:10,134 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 40 states. [2019-09-03 20:53:10,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:10,922 INFO L93 Difference]: Finished difference Result 230 states and 278 transitions. [2019-09-03 20:53:10,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 20:53:10,923 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 80 [2019-09-03 20:53:10,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:10,925 INFO L225 Difference]: With dead ends: 230 [2019-09-03 20:53:10,925 INFO L226 Difference]: Without dead ends: 204 [2019-09-03 20:53:10,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 124 SyntacticMatches, 20 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2151 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1018, Invalid=4384, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 20:53:10,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-09-03 20:53:10,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 100. [2019-09-03 20:53:10,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-03 20:53:10,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2019-09-03 20:53:10,930 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 80 [2019-09-03 20:53:10,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:10,930 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2019-09-03 20:53:10,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 20:53:10,931 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2019-09-03 20:53:10,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 20:53:10,931 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:10,931 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:10,931 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:10,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:10,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1108314350, now seen corresponding path program 24 times [2019-09-03 20:53:10,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:10,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:10,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:10,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:10,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:11,157 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 116 proven. 21 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:53:11,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:11,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:11,157 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:11,157 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:53:11,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:11,158 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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:11,167 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:11,168 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:11,197 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:11,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:11,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 20:53:11,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:11,489 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 116 proven. 21 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:53:11,489 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:11,684 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 116 proven. 21 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:53:11,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:11,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 39 [2019-09-03 20:53:11,687 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:11,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 20:53:11,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 20:53:11,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=1198, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 20:53:11,688 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 39 states. [2019-09-03 20:53:12,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:12,615 INFO L93 Difference]: Finished difference Result 263 states and 321 transitions. [2019-09-03 20:53:12,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 20:53:12,615 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 80 [2019-09-03 20:53:12,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:12,617 INFO L225 Difference]: With dead ends: 263 [2019-09-03 20:53:12,617 INFO L226 Difference]: Without dead ends: 237 [2019-09-03 20:53:12,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 125 SyntacticMatches, 20 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2277 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1093, Invalid=4759, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 20:53:12,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-09-03 20:53:12,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 100. [2019-09-03 20:53:12,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-03 20:53:12,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2019-09-03 20:53:12,623 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 80 [2019-09-03 20:53:12,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:12,624 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2019-09-03 20:53:12,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 20:53:12,624 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2019-09-03 20:53:12,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 20:53:12,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:12,625 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:12,625 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:12,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:12,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1945563697, now seen corresponding path program 25 times [2019-09-03 20:53:12,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:12,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:12,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:12,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:12,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:12,860 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 116 proven. 20 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:53:12,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:12,861 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:12,861 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:12,861 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:53:12,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:12,861 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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:53:12,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:12,880 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:12,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 20:53:12,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:13,244 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 116 proven. 20 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:53:13,245 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:13,397 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 116 proven. 20 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:53:13,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:13,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 38 [2019-09-03 20:53:13,399 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:13,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 20:53:13,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 20:53:13,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=1137, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 20:53:13,400 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 38 states. [2019-09-03 20:53:14,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:14,372 INFO L93 Difference]: Finished difference Result 295 states and 363 transitions. [2019-09-03 20:53:14,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 20:53:14,373 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 80 [2019-09-03 20:53:14,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:14,375 INFO L225 Difference]: With dead ends: 295 [2019-09-03 20:53:14,375 INFO L226 Difference]: Without dead ends: 269 [2019-09-03 20:53:14,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 126 SyntacticMatches, 20 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2302 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1119, Invalid=4887, Unknown=0, NotChecked=0, Total=6006 [2019-09-03 20:53:14,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-03 20:53:14,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 100. [2019-09-03 20:53:14,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-03 20:53:14,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2019-09-03 20:53:14,380 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 80 [2019-09-03 20:53:14,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:14,381 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2019-09-03 20:53:14,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 20:53:14,381 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2019-09-03 20:53:14,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 20:53:14,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:14,382 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:14,382 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:14,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:14,382 INFO L82 PathProgramCache]: Analyzing trace with hash 172681422, now seen corresponding path program 26 times [2019-09-03 20:53:14,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:14,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:14,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:14,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:14,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:14,653 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 116 proven. 21 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:53:14,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:14,653 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:14,654 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:14,654 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:53:14,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:14,654 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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:53:14,685 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:14,685 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:14,729 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-03 20:53:14,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:14,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 20:53:14,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:15,111 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 116 proven. 21 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:53:15,111 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:15,318 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 116 proven. 21 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:53:15,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:15,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 37 [2019-09-03 20:53:15,321 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:15,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 20:53:15,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 20:53:15,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=1074, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 20:53:15,322 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 37 states. [2019-09-03 20:53:16,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:16,251 INFO L93 Difference]: Finished difference Result 326 states and 404 transitions. [2019-09-03 20:53:16,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-03 20:53:16,251 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 80 [2019-09-03 20:53:16,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:16,253 INFO L225 Difference]: With dead ends: 326 [2019-09-03 20:53:16,254 INFO L226 Difference]: Without dead ends: 300 [2019-09-03 20:53:16,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 127 SyntacticMatches, 20 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2217 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1093, Invalid=4759, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 20:53:16,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-09-03 20:53:16,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 100. [2019-09-03 20:53:16,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-03 20:53:16,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2019-09-03 20:53:16,259 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 80 [2019-09-03 20:53:16,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:16,260 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2019-09-03 20:53:16,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 20:53:16,260 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2019-09-03 20:53:16,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 20:53:16,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:16,261 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:16,261 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:16,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:16,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1626485231, now seen corresponding path program 27 times [2019-09-03 20:53:16,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:16,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:16,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:16,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:16,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:16,485 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 116 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:53:16,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:16,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:16,485 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:16,486 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:53:16,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:16,486 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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:16,496 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:16,496 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:16,520 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:16,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:16,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 20:53:16,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:16,817 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 116 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:53:16,817 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:17,017 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 116 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:53:17,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:17,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 36 [2019-09-03 20:53:17,021 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:17,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 20:53:17,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 20:53:17,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1009, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 20:53:17,022 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 36 states. [2019-09-03 20:53:18,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:18,195 INFO L93 Difference]: Finished difference Result 356 states and 444 transitions. [2019-09-03 20:53:18,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 20:53:18,196 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 80 [2019-09-03 20:53:18,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:18,199 INFO L225 Difference]: With dead ends: 356 [2019-09-03 20:53:18,199 INFO L226 Difference]: Without dead ends: 330 [2019-09-03 20:53:18,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 128 SyntacticMatches, 20 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2019 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1018, Invalid=4384, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 20:53:18,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-03 20:53:18,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 100. [2019-09-03 20:53:18,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-03 20:53:18,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2019-09-03 20:53:18,206 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 80 [2019-09-03 20:53:18,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:18,206 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2019-09-03 20:53:18,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 20:53:18,206 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2019-09-03 20:53:18,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 20:53:18,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:18,207 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:18,207 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:18,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:18,208 INFO L82 PathProgramCache]: Analyzing trace with hash -543375186, now seen corresponding path program 28 times [2019-09-03 20:53:18,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:18,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:18,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:18,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:18,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:18,429 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 116 proven. 29 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:53:18,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:18,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:18,429 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:18,429 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:53:18,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:18,430 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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:53:18,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:18,442 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:18,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 20:53:18,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:18,787 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 116 proven. 29 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:53:18,787 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:19,020 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 116 proven. 29 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:53:19,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:19,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 35 [2019-09-03 20:53:19,023 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:19,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 20:53:19,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 20:53:19,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=942, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 20:53:19,025 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 35 states. [2019-09-03 20:53:19,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:19,737 INFO L93 Difference]: Finished difference Result 385 states and 483 transitions. [2019-09-03 20:53:19,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 20:53:19,737 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 80 [2019-09-03 20:53:19,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:19,740 INFO L225 Difference]: With dead ends: 385 [2019-09-03 20:53:19,740 INFO L226 Difference]: Without dead ends: 359 [2019-09-03 20:53:19,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 129 SyntacticMatches, 20 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1716 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=903, Invalid=3789, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 20:53:19,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-09-03 20:53:19,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 100. [2019-09-03 20:53:19,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-03 20:53:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2019-09-03 20:53:19,747 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 80 [2019-09-03 20:53:19,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:19,747 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2019-09-03 20:53:19,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 20:53:19,747 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2019-09-03 20:53:19,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 20:53:19,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:19,748 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:19,748 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:19,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:19,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1880481295, now seen corresponding path program 8 times [2019-09-03 20:53:19,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:19,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:19,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:19,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:19,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:19,949 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 116 proven. 36 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:53:19,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:19,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:19,950 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:19,950 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:53:19,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:19,950 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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:19,960 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:19,961 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:20,003 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-03 20:53:20,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:20,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 20:53:20,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:20,225 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 116 proven. 36 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:53:20,225 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:20,373 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 116 proven. 36 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:53:20,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:20,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 34 [2019-09-03 20:53:20,376 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:20,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 20:53:20,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 20:53:20,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=873, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 20:53:20,377 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 34 states. [2019-09-03 20:53:21,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:21,059 INFO L93 Difference]: Finished difference Result 416 states and 525 transitions. [2019-09-03 20:53:21,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 20:53:21,060 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 80 [2019-09-03 20:53:21,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:21,062 INFO L225 Difference]: With dead ends: 416 [2019-09-03 20:53:21,062 INFO L226 Difference]: Without dead ends: 390 [2019-09-03 20:53:21,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 130 SyntacticMatches, 20 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1328 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=763, Invalid=3019, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 20:53:21,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-09-03 20:53:21,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 102. [2019-09-03 20:53:21,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-03 20:53:21,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2019-09-03 20:53:21,068 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 80 [2019-09-03 20:53:21,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:21,069 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2019-09-03 20:53:21,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 20:53:21,069 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2019-09-03 20:53:21,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-03 20:53:21,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:21,070 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:21,070 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:21,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:21,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1754864345, now seen corresponding path program 16 times [2019-09-03 20:53:21,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:21,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:21,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:21,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:21,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:21,194 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 61 proven. 100 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:53:21,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:21,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:21,194 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:21,194 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:53:21,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:21,195 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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:53:21,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:21,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:21,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 20:53:21,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:21,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:21,296 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 61 proven. 100 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:53:21,297 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:21,390 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 61 proven. 100 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:53:21,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:21,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 16 [2019-09-03 20:53:21,393 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:21,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 20:53:21,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 20:53:21,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:53:21,394 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand 16 states. [2019-09-03 20:53:21,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:21,529 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2019-09-03 20:53:21,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 20:53:21,529 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 81 [2019-09-03 20:53:21,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:21,530 INFO L225 Difference]: With dead ends: 113 [2019-09-03 20:53:21,530 INFO L226 Difference]: Without dead ends: 113 [2019-09-03 20:53:21,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 151 SyntacticMatches, 18 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:53:21,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-03 20:53:21,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2019-09-03 20:53:21,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-09-03 20:53:21,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2019-09-03 20:53:21,534 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 81 [2019-09-03 20:53:21,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:21,534 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2019-09-03 20:53:21,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 20:53:21,534 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2019-09-03 20:53:21,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 20:53:21,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:21,535 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:21,535 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:21,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:21,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1682933424, now seen corresponding path program 17 times [2019-09-03 20:53:21,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:21,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:21,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:21,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:21,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:21,815 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 144 proven. 45 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:21,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:21,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:21,815 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:21,815 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:53:21,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:21,815 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 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:21,831 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:21,831 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:21,861 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-03 20:53:21,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:21,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 20:53:21,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:22,545 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 144 proven. 45 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:22,545 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:22,774 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 144 proven. 45 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:22,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:22,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 46 [2019-09-03 20:53:22,777 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:22,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 20:53:22,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 20:53:22,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=1649, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 20:53:22,778 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand 46 states. [2019-09-03 20:53:23,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:23,425 INFO L93 Difference]: Finished difference Result 178 states and 209 transitions. [2019-09-03 20:53:23,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 20:53:23,426 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2019-09-03 20:53:23,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:23,427 INFO L225 Difference]: With dead ends: 178 [2019-09-03 20:53:23,427 INFO L226 Difference]: Without dead ends: 149 [2019-09-03 20:53:23,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 134 SyntacticMatches, 22 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2081 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=905, Invalid=3651, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 20:53:23,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-03 20:53:23,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 110. [2019-09-03 20:53:23,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-03 20:53:23,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-09-03 20:53:23,431 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 88 [2019-09-03 20:53:23,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:23,431 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-09-03 20:53:23,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 20:53:23,432 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-09-03 20:53:23,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 20:53:23,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:23,432 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:23,433 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:23,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:23,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1323443409, now seen corresponding path program 29 times [2019-09-03 20:53:23,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:23,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:23,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:23,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:23,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:23,700 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 144 proven. 37 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:23,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:23,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:23,701 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:23,701 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:53:23,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:23,701 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 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:23,712 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:23,712 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:23,745 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-03 20:53:23,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:23,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 20:53:23,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:24,182 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 144 proven. 37 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:24,183 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:24,370 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 144 proven. 37 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (55)] Exception during sending of exit command (exit): Stream closed [2019-09-03 20:53:24,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:24,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 45 [2019-09-03 20:53:24,373 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:24,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 20:53:24,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 20:53:24,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=1589, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 20:53:24,378 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 45 states. [2019-09-03 20:53:25,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:25,066 INFO L93 Difference]: Finished difference Result 217 states and 259 transitions. [2019-09-03 20:53:25,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 20:53:25,067 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-09-03 20:53:25,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:25,068 INFO L225 Difference]: With dead ends: 217 [2019-09-03 20:53:25,069 INFO L226 Difference]: Without dead ends: 188 [2019-09-03 20:53:25,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 135 SyntacticMatches, 22 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1081, Invalid=4619, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 20:53:25,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-03 20:53:25,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 110. [2019-09-03 20:53:25,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-03 20:53:25,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-09-03 20:53:25,072 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 88 [2019-09-03 20:53:25,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:25,073 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-09-03 20:53:25,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 20:53:25,073 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-09-03 20:53:25,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 20:53:25,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:25,074 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:25,074 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:25,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:25,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1627618000, now seen corresponding path program 30 times [2019-09-03 20:53:25,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:25,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:25,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:25,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:25,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:25,319 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 144 proven. 31 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:25,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:25,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:25,320 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:25,320 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:53:25,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:25,320 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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:25,330 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:25,330 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:25,362 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:25,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:25,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 20:53:25,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:25,751 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 144 proven. 31 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:25,751 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:25,951 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 144 proven. 31 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:25,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:25,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 44 [2019-09-03 20:53:25,955 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:25,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 20:53:25,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 20:53:25,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=1527, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 20:53:25,956 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 44 states. [2019-09-03 20:53:26,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:26,728 INFO L93 Difference]: Finished difference Result 255 states and 308 transitions. [2019-09-03 20:53:26,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 20:53:26,729 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 88 [2019-09-03 20:53:26,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:26,731 INFO L225 Difference]: With dead ends: 255 [2019-09-03 20:53:26,731 INFO L226 Difference]: Without dead ends: 226 [2019-09-03 20:53:26,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 136 SyntacticMatches, 22 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2703 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1234, Invalid=5408, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 20:53:26,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-03 20:53:26,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 110. [2019-09-03 20:53:26,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-03 20:53:26,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-09-03 20:53:26,735 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 88 [2019-09-03 20:53:26,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:26,735 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-09-03 20:53:26,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 20:53:26,735 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-09-03 20:53:26,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 20:53:26,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:26,736 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:26,736 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:26,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:26,736 INFO L82 PathProgramCache]: Analyzing trace with hash -771038449, now seen corresponding path program 31 times [2019-09-03 20:53:26,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:26,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:26,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:26,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:26,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 144 proven. 27 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:27,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:27,096 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:27,096 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:27,096 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:53:27,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:27,097 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 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:27,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:27,123 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:27,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 20:53:27,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:27,726 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 144 proven. 27 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:27,726 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:27,925 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 144 proven. 27 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:27,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:27,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 43 [2019-09-03 20:53:27,928 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:27,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 20:53:27,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 20:53:27,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=1463, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 20:53:27,929 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 43 states. [2019-09-03 20:53:28,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:28,988 INFO L93 Difference]: Finished difference Result 292 states and 356 transitions. [2019-09-03 20:53:28,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 20:53:28,988 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 88 [2019-09-03 20:53:28,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:28,990 INFO L225 Difference]: With dead ends: 292 [2019-09-03 20:53:28,990 INFO L226 Difference]: Without dead ends: 263 [2019-09-03 20:53:28,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 137 SyntacticMatches, 22 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2907 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1346, Invalid=5964, Unknown=0, NotChecked=0, Total=7310 [2019-09-03 20:53:28,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-09-03 20:53:28,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 110. [2019-09-03 20:53:28,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-03 20:53:28,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-09-03 20:53:28,995 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 88 [2019-09-03 20:53:28,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:28,995 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-09-03 20:53:28,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 20:53:28,995 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-09-03 20:53:28,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 20:53:28,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:28,996 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:28,996 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:28,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:28,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1402603792, now seen corresponding path program 32 times [2019-09-03 20:53:28,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:28,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:28,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:28,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:28,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:29,232 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 144 proven. 25 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:29,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:29,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:29,233 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:29,233 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:53:29,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:29,233 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 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:29,243 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:29,243 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:29,276 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-03 20:53:29,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:29,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 20:53:29,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:29,665 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 144 proven. 25 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:29,665 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:29,851 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 144 proven. 25 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:29,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:29,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 42 [2019-09-03 20:53:29,855 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:29,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-03 20:53:29,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-03 20:53:29,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=1397, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 20:53:29,856 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 42 states. [2019-09-03 20:53:30,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:30,944 INFO L93 Difference]: Finished difference Result 328 states and 403 transitions. [2019-09-03 20:53:30,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 20:53:30,945 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 88 [2019-09-03 20:53:30,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:30,947 INFO L225 Difference]: With dead ends: 328 [2019-09-03 20:53:30,947 INFO L226 Difference]: Without dead ends: 299 [2019-09-03 20:53:30,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 138 SyntacticMatches, 22 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3001 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1405, Invalid=6251, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 20:53:30,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-09-03 20:53:30,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 110. [2019-09-03 20:53:30,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-03 20:53:30,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-09-03 20:53:30,951 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 88 [2019-09-03 20:53:30,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:30,951 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-09-03 20:53:30,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-03 20:53:30,952 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-09-03 20:53:30,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 20:53:30,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:30,952 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:30,953 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:30,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:30,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1347969775, now seen corresponding path program 33 times [2019-09-03 20:53:30,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:30,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:30,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:30,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:30,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:31,195 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 144 proven. 25 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:31,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:31,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:31,196 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:31,196 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:53:31,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:31,196 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 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:31,206 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:31,206 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:31,234 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:31,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:31,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 20:53:31,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:31,612 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 144 proven. 25 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:31,612 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:31,807 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 144 proven. 25 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:31,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:31,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 41 [2019-09-03 20:53:31,810 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:31,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 20:53:31,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 20:53:31,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=1329, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 20:53:31,811 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 41 states. [2019-09-03 20:53:32,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:32,895 INFO L93 Difference]: Finished difference Result 363 states and 449 transitions. [2019-09-03 20:53:32,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 20:53:32,896 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 88 [2019-09-03 20:53:32,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:32,898 INFO L225 Difference]: With dead ends: 363 [2019-09-03 20:53:32,898 INFO L226 Difference]: Without dead ends: 334 [2019-09-03 20:53:32,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 139 SyntacticMatches, 22 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2971 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1405, Invalid=6251, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 20:53:32,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-03 20:53:32,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 110. [2019-09-03 20:53:32,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-03 20:53:32,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-09-03 20:53:32,903 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 88 [2019-09-03 20:53:32,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:32,903 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-09-03 20:53:32,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 20:53:32,903 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-09-03 20:53:32,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 20:53:32,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:32,904 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:32,904 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:32,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:32,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1334248688, now seen corresponding path program 34 times [2019-09-03 20:53:32,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:32,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:32,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:32,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:32,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:33,178 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 144 proven. 27 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:33,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:33,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:33,179 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:33,179 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:53:33,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:33,179 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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:53:33,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:33,198 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:33,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 20:53:33,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:33,771 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 144 proven. 27 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:33,772 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:33,980 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 144 proven. 27 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:33,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:33,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 40 [2019-09-03 20:53:33,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:33,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 20:53:33,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 20:53:33,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1259, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 20:53:33,984 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 40 states. [2019-09-03 20:53:35,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:35,029 INFO L93 Difference]: Finished difference Result 397 states and 494 transitions. [2019-09-03 20:53:35,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 20:53:35,029 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 88 [2019-09-03 20:53:35,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:35,031 INFO L225 Difference]: With dead ends: 397 [2019-09-03 20:53:35,031 INFO L226 Difference]: Without dead ends: 368 [2019-09-03 20:53:35,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 140 SyntacticMatches, 22 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2811 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1346, Invalid=5964, Unknown=0, NotChecked=0, Total=7310 [2019-09-03 20:53:35,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-09-03 20:53:35,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 110. [2019-09-03 20:53:35,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-03 20:53:35,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-09-03 20:53:35,039 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 88 [2019-09-03 20:53:35,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:35,039 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-09-03 20:53:35,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 20:53:35,039 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-09-03 20:53:35,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 20:53:35,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:35,040 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:35,040 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:35,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:35,040 INFO L82 PathProgramCache]: Analyzing trace with hash 2042911439, now seen corresponding path program 35 times [2019-09-03 20:53:35,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:35,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:35,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:35,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:35,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:35,265 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 144 proven. 31 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:35,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:35,265 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:35,266 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:35,266 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:53:35,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:35,266 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 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:35,276 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:35,276 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:35,306 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-03 20:53:35,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:35,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 20:53:35,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:35,642 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 144 proven. 31 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:35,642 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:35,826 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 144 proven. 31 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:35,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:35,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 39 [2019-09-03 20:53:35,829 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:35,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 20:53:35,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 20:53:35,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1187, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 20:53:35,829 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 39 states. [2019-09-03 20:53:36,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:36,830 INFO L93 Difference]: Finished difference Result 430 states and 538 transitions. [2019-09-03 20:53:36,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 20:53:36,831 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 88 [2019-09-03 20:53:36,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:36,833 INFO L225 Difference]: With dead ends: 430 [2019-09-03 20:53:36,833 INFO L226 Difference]: Without dead ends: 401 [2019-09-03 20:53:36,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 141 SyntacticMatches, 22 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2523 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1234, Invalid=5408, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 20:53:36,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2019-09-03 20:53:36,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 110. [2019-09-03 20:53:36,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-03 20:53:36,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-09-03 20:53:36,839 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 88 [2019-09-03 20:53:36,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:36,839 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-09-03 20:53:36,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 20:53:36,840 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-09-03 20:53:36,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 20:53:36,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:36,840 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:36,841 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:36,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:36,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1874757424, now seen corresponding path program 36 times [2019-09-03 20:53:36,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:36,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:36,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:36,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:36,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:37,072 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 144 proven. 37 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:37,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:37,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:37,072 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:37,072 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:53:37,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:37,072 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 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:37,088 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:37,088 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:37,114 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:37,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:37,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 20:53:37,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:37,429 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 144 proven. 37 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:37,429 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:37,617 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 144 proven. 37 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:37,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:37,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 38 [2019-09-03 20:53:37,620 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:37,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 20:53:37,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 20:53:37,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1113, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 20:53:37,621 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 38 states. [2019-09-03 20:53:38,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:38,502 INFO L93 Difference]: Finished difference Result 462 states and 581 transitions. [2019-09-03 20:53:38,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 20:53:38,503 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 88 [2019-09-03 20:53:38,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:38,505 INFO L225 Difference]: With dead ends: 462 [2019-09-03 20:53:38,505 INFO L226 Difference]: Without dead ends: 433 [2019-09-03 20:53:38,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 142 SyntacticMatches, 22 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2121 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1081, Invalid=4619, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 20:53:38,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-09-03 20:53:38,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 110. [2019-09-03 20:53:38,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-03 20:53:38,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-09-03 20:53:38,513 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 88 [2019-09-03 20:53:38,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:38,513 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-09-03 20:53:38,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 20:53:38,513 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-09-03 20:53:38,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 20:53:38,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:38,514 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:38,514 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:38,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:38,514 INFO L82 PathProgramCache]: Analyzing trace with hash -208876881, now seen corresponding path program 9 times [2019-09-03 20:53:38,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:38,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:38,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:38,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:38,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:38,743 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 144 proven. 45 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:38,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:38,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:38,743 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:38,743 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:53:38,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:38,743 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 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:38,755 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:38,756 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:38,781 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:38,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:38,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 20:53:38,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:39,076 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 144 proven. 45 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:39,076 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:39,315 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 144 proven. 45 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (63)] Exception during sending of exit command (exit): Stream closed [2019-09-03 20:53:39,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:39,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 37 [2019-09-03 20:53:39,319 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:39,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 20:53:39,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 20:53:39,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1037, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 20:53:39,322 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 37 states. [2019-09-03 20:53:40,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:40,126 INFO L93 Difference]: Finished difference Result 496 states and 627 transitions. [2019-09-03 20:53:40,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 20:53:40,127 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 88 [2019-09-03 20:53:40,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:40,130 INFO L225 Difference]: With dead ends: 496 [2019-09-03 20:53:40,130 INFO L226 Difference]: Without dead ends: 467 [2019-09-03 20:53:40,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 143 SyntacticMatches, 22 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1631 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=905, Invalid=3651, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 20:53:40,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-09-03 20:53:40,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 112. [2019-09-03 20:53:40,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-03 20:53:40,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2019-09-03 20:53:40,136 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 88 [2019-09-03 20:53:40,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:40,136 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2019-09-03 20:53:40,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 20:53:40,137 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2019-09-03 20:53:40,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-03 20:53:40,137 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:40,137 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:40,138 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:40,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:40,138 INFO L82 PathProgramCache]: Analyzing trace with hash 2072180296, now seen corresponding path program 18 times [2019-09-03 20:53:40,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:40,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:40,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:40,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:40,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:40,268 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 73 proven. 126 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:40,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:40,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:40,269 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:40,269 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:53:40,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:40,269 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 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:53:40,288 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:40,289 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:40,322 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:40,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:40,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:53:40,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:40,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:40,390 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 73 proven. 126 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:40,390 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:40,543 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 73 proven. 126 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:40,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:40,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 17 [2019-09-03 20:53:40,547 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:40,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 20:53:40,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 20:53:40,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:53:40,548 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand 17 states. [2019-09-03 20:53:40,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:40,705 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2019-09-03 20:53:40,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 20:53:40,705 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 89 [2019-09-03 20:53:40,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:40,706 INFO L225 Difference]: With dead ends: 123 [2019-09-03 20:53:40,706 INFO L226 Difference]: Without dead ends: 123 [2019-09-03 20:53:40,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 166 SyntacticMatches, 20 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2019-09-03 20:53:40,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-03 20:53:40,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2019-09-03 20:53:40,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-03 20:53:40,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2019-09-03 20:53:40,710 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 89 [2019-09-03 20:53:40,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:40,710 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2019-09-03 20:53:40,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 20:53:40,710 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2019-09-03 20:53:40,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-03 20:53:40,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:40,711 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:40,711 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:40,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:40,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1085611631, now seen corresponding path program 19 times [2019-09-03 20:53:40,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:40,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:40,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:40,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:40,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:40,983 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 175 proven. 55 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:53:40,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:40,984 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:40,984 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:40,984 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:53:40,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:40,984 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 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:40,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:40,995 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:41,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:53:41,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:41,512 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 175 proven. 55 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:53:41,512 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:41,738 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 175 proven. 55 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:53:41,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:41,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 50 [2019-09-03 20:53:41,741 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:41,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-03 20:53:41,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-03 20:53:41,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=1955, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 20:53:41,742 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand 50 states. [2019-09-03 20:53:42,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:42,588 INFO L93 Difference]: Finished difference Result 195 states and 229 transitions. [2019-09-03 20:53:42,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 20:53:42,588 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2019-09-03 20:53:42,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:42,589 INFO L225 Difference]: With dead ends: 195 [2019-09-03 20:53:42,590 INFO L226 Difference]: Without dead ends: 163 [2019-09-03 20:53:42,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 146 SyntacticMatches, 24 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2515 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1059, Invalid=4343, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 20:53:42,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-03 20:53:42,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 120. [2019-09-03 20:53:42,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-03 20:53:42,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2019-09-03 20:53:42,594 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 96 [2019-09-03 20:53:42,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:42,594 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2019-09-03 20:53:42,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-03 20:53:42,594 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2019-09-03 20:53:42,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-03 20:53:42,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:42,595 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:42,595 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:42,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:42,596 INFO L82 PathProgramCache]: Analyzing trace with hash -505248786, now seen corresponding path program 37 times [2019-09-03 20:53:42,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:42,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:42,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:42,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:42,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:43,023 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 175 proven. 46 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:53:43,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:43,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:43,024 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:43,024 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:53:43,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:43,024 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 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:43,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:43,045 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:43,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:53:43,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:43,648 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 175 proven. 46 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:53:43,649 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:43,886 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 175 proven. 46 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:53:43,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:43,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 49 [2019-09-03 20:53:43,889 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:43,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 20:53:43,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 20:53:43,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=462, Invalid=1890, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 20:53:43,890 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 49 states. [2019-09-03 20:53:44,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:44,837 INFO L93 Difference]: Finished difference Result 238 states and 284 transitions. [2019-09-03 20:53:44,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-03 20:53:44,838 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-09-03 20:53:44,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:44,839 INFO L225 Difference]: With dead ends: 238 [2019-09-03 20:53:44,839 INFO L226 Difference]: Without dead ends: 206 [2019-09-03 20:53:44,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 147 SyntacticMatches, 24 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2937 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1275, Invalid=5531, Unknown=0, NotChecked=0, Total=6806 [2019-09-03 20:53:44,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-03 20:53:44,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 120. [2019-09-03 20:53:44,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-03 20:53:44,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2019-09-03 20:53:44,843 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 96 [2019-09-03 20:53:44,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:44,844 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2019-09-03 20:53:44,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 20:53:44,844 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2019-09-03 20:53:44,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-03 20:53:44,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:44,845 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:44,845 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:44,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:44,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1664945521, now seen corresponding path program 38 times [2019-09-03 20:53:44,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:44,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:44,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:44,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:44,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:45,148 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 175 proven. 39 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:53:45,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:45,148 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:45,149 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:45,149 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:53:45,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:45,149 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 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:45,159 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:45,159 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:45,191 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-03 20:53:45,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:45,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:53:45,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:45,632 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 175 proven. 39 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:53:45,633 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:45,856 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 175 proven. 39 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:53:45,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:45,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 48 [2019-09-03 20:53:45,858 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:45,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-03 20:53:45,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-03 20:53:45,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=1823, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 20:53:45,860 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 48 states. [2019-09-03 20:53:47,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:47,000 INFO L93 Difference]: Finished difference Result 280 states and 338 transitions. [2019-09-03 20:53:47,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 20:53:47,001 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 96 [2019-09-03 20:53:47,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:47,002 INFO L225 Difference]: With dead ends: 280 [2019-09-03 20:53:47,002 INFO L226 Difference]: Without dead ends: 248 [2019-09-03 20:53:47,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 148 SyntacticMatches, 24 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3318 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1471, Invalid=6539, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 20:53:47,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-09-03 20:53:47,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 120. [2019-09-03 20:53:47,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-03 20:53:47,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2019-09-03 20:53:47,007 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 96 [2019-09-03 20:53:47,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:47,007 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2019-09-03 20:53:47,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-03 20:53:47,007 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2019-09-03 20:53:47,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-03 20:53:47,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:47,008 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:47,008 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:47,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:47,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1622780878, now seen corresponding path program 39 times [2019-09-03 20:53:47,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:47,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:47,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:47,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:47,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:47,308 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 175 proven. 34 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:53:47,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:47,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:47,309 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:47,309 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:53:47,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:47,309 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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:53:47,345 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:47,345 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:47,376 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:47,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:47,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:53:47,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:47,813 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 175 proven. 34 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:53:47,814 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:48,019 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 175 proven. 34 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:53:48,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:48,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 47 [2019-09-03 20:53:48,022 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:48,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 20:53:48,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 20:53:48,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=1754, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 20:53:48,023 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 47 states. [2019-09-03 20:53:49,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:49,219 INFO L93 Difference]: Finished difference Result 321 states and 391 transitions. [2019-09-03 20:53:49,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-03 20:53:49,220 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 96 [2019-09-03 20:53:49,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:49,222 INFO L225 Difference]: With dead ends: 321 [2019-09-03 20:53:49,222 INFO L226 Difference]: Without dead ends: 289 [2019-09-03 20:53:49,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 149 SyntacticMatches, 24 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3614 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1626, Invalid=7304, Unknown=0, NotChecked=0, Total=8930 [2019-09-03 20:53:49,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-09-03 20:53:49,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 120. [2019-09-03 20:53:49,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-03 20:53:49,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2019-09-03 20:53:49,226 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 96 [2019-09-03 20:53:49,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:49,226 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2019-09-03 20:53:49,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 20:53:49,226 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2019-09-03 20:53:49,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-03 20:53:49,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:49,227 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:49,227 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:49,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:49,228 INFO L82 PathProgramCache]: Analyzing trace with hash 343363247, now seen corresponding path program 40 times [2019-09-03 20:53:49,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:49,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:49,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:49,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:49,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:49,517 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 175 proven. 31 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:53:49,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:49,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:49,517 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:49,517 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:53:49,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:49,518 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 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:49,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:49,528 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:49,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:53:49,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:49,946 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 175 proven. 31 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:53:49,946 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:50,177 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 175 proven. 31 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:53:50,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:50,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 46 [2019-09-03 20:53:50,180 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:50,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 20:53:50,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 20:53:50,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=1683, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 20:53:50,181 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 46 states. [2019-09-03 20:53:51,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:51,449 INFO L93 Difference]: Finished difference Result 361 states and 443 transitions. [2019-09-03 20:53:51,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 20:53:51,450 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 96 [2019-09-03 20:53:51,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:51,452 INFO L225 Difference]: With dead ends: 361 [2019-09-03 20:53:51,452 INFO L226 Difference]: Without dead ends: 329 [2019-09-03 20:53:51,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 150 SyntacticMatches, 24 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3793 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1725, Invalid=7781, Unknown=0, NotChecked=0, Total=9506 [2019-09-03 20:53:51,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-09-03 20:53:51,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 120. [2019-09-03 20:53:51,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-03 20:53:51,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2019-09-03 20:53:51,456 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 96 [2019-09-03 20:53:51,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:51,457 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2019-09-03 20:53:51,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 20:53:51,457 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2019-09-03 20:53:51,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-03 20:53:51,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:51,458 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:51,458 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:51,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:51,458 INFO L82 PathProgramCache]: Analyzing trace with hash -252097618, now seen corresponding path program 41 times [2019-09-03 20:53:51,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:51,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:51,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:51,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:51,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:51,715 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 175 proven. 30 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:53:51,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:51,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:51,715 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:51,716 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:53:51,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:51,716 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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:51,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:51,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:51,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-03 20:53:51,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:51,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:53:51,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:52,217 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 175 proven. 30 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:53:52,218 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:52,480 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 175 proven. 30 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:53:52,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:52,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 45 [2019-09-03 20:53:52,483 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:52,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 20:53:52,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 20:53:52,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=1610, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 20:53:52,484 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 45 states. [2019-09-03 20:53:53,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:53,750 INFO L93 Difference]: Finished difference Result 400 states and 494 transitions. [2019-09-03 20:53:53,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-03 20:53:53,751 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 96 [2019-09-03 20:53:53,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:53,753 INFO L225 Difference]: With dead ends: 400 [2019-09-03 20:53:53,753 INFO L226 Difference]: Without dead ends: 368 [2019-09-03 20:53:53,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 151 SyntacticMatches, 24 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3835 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1759, Invalid=7943, Unknown=0, NotChecked=0, Total=9702 [2019-09-03 20:53:53,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-09-03 20:53:53,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 120. [2019-09-03 20:53:53,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-03 20:53:53,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2019-09-03 20:53:53,757 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 96 [2019-09-03 20:53:53,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:53,757 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2019-09-03 20:53:53,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 20:53:53,758 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2019-09-03 20:53:53,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-03 20:53:53,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:53,758 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:53,758 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:53,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:53,759 INFO L82 PathProgramCache]: Analyzing trace with hash -271306033, now seen corresponding path program 42 times [2019-09-03 20:53:53,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:53,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:53,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:53,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:53,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:54,148 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 175 proven. 31 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:53:54,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:54,148 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:54,148 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:54,149 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:53:54,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:54,149 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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:54,178 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:54,178 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:54,220 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:54,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:54,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:53:54,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:54,728 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 175 proven. 31 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:53:54,728 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:54,938 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 175 proven. 31 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:53:54,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:54,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 44 [2019-09-03 20:53:54,941 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:54,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 20:53:54,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 20:53:54,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=1535, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 20:53:54,942 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 44 states. [2019-09-03 20:53:56,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:56,207 INFO L93 Difference]: Finished difference Result 438 states and 544 transitions. [2019-09-03 20:53:56,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-03 20:53:56,207 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 96 [2019-09-03 20:53:56,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:56,210 INFO L225 Difference]: With dead ends: 438 [2019-09-03 20:53:56,210 INFO L226 Difference]: Without dead ends: 406 [2019-09-03 20:53:56,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 152 SyntacticMatches, 24 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3731 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1725, Invalid=7781, Unknown=0, NotChecked=0, Total=9506 [2019-09-03 20:53:56,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-09-03 20:53:56,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 120. [2019-09-03 20:53:56,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-03 20:53:56,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2019-09-03 20:53:56,216 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 96 [2019-09-03 20:53:56,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:56,216 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2019-09-03 20:53:56,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 20:53:56,216 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2019-09-03 20:53:56,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-03 20:53:56,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:56,217 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:56,217 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:56,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:56,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1113547662, now seen corresponding path program 43 times [2019-09-03 20:53:56,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:56,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:56,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:56,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:56,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:56,488 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 175 proven. 34 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:53:56,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:56,489 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:56,489 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:56,489 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:53:56,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:56,489 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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:56,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:56,501 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:56,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:53:56,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:56,887 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 175 proven. 34 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:53:56,887 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:57,098 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 175 proven. 34 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:53:57,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:57,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 43 [2019-09-03 20:53:57,102 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:57,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 20:53:57,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 20:53:57,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=1458, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 20:53:57,103 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 43 states. [2019-09-03 20:53:58,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:58,333 INFO L93 Difference]: Finished difference Result 475 states and 593 transitions. [2019-09-03 20:53:58,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-03 20:53:58,339 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 96 [2019-09-03 20:53:58,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:58,341 INFO L225 Difference]: With dead ends: 475 [2019-09-03 20:53:58,342 INFO L226 Difference]: Without dead ends: 443 [2019-09-03 20:53:58,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 153 SyntacticMatches, 24 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3478 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1626, Invalid=7304, Unknown=0, NotChecked=0, Total=8930 [2019-09-03 20:53:58,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-09-03 20:53:58,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 120. [2019-09-03 20:53:58,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-03 20:53:58,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2019-09-03 20:53:58,349 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 96 [2019-09-03 20:53:58,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:58,349 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2019-09-03 20:53:58,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 20:53:58,349 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2019-09-03 20:53:58,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-03 20:53:58,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:58,350 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:58,350 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:58,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:58,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1889820945, now seen corresponding path program 44 times [2019-09-03 20:53:58,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:58,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:58,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:58,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:58,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:58,613 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 175 proven. 39 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:53:58,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:58,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:58,614 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:58,614 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:53:58,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:58,614 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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:58,623 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:58,623 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:58,655 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-03 20:53:58,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:58,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:53:58,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:58,992 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 175 proven. 39 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:53:58,993 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:59,198 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 175 proven. 39 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:53:59,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:59,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 42 [2019-09-03 20:53:59,201 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:59,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-03 20:53:59,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-03 20:53:59,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=1379, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 20:53:59,202 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 42 states. [2019-09-03 20:54:00,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:00,320 INFO L93 Difference]: Finished difference Result 511 states and 641 transitions. [2019-09-03 20:54:00,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 20:54:00,320 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 96 [2019-09-03 20:54:00,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:00,323 INFO L225 Difference]: With dead ends: 511 [2019-09-03 20:54:00,323 INFO L226 Difference]: Without dead ends: 479 [2019-09-03 20:54:00,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 154 SyntacticMatches, 24 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3084 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1471, Invalid=6539, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 20:54:00,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-09-03 20:54:00,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 120. [2019-09-03 20:54:00,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-03 20:54:00,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2019-09-03 20:54:00,330 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 96 [2019-09-03 20:54:00,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:00,331 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2019-09-03 20:54:00,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-03 20:54:00,331 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2019-09-03 20:54:00,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-03 20:54:00,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:00,332 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:00,332 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:00,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:00,332 INFO L82 PathProgramCache]: Analyzing trace with hash -601230482, now seen corresponding path program 45 times [2019-09-03 20:54:00,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:00,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:00,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:00,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:00,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:00,582 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 175 proven. 46 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:54:00,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:00,583 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:00,583 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:00,583 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:54:00,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:00,583 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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:00,592 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:00,592 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:00,621 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:00,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:00,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:54:00,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:00,961 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 175 proven. 46 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:54:00,961 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:01,343 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 175 proven. 46 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (74)] Exception during sending of exit command (exit): Stream closed [2019-09-03 20:54:01,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:01,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 41 [2019-09-03 20:54:01,348 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:01,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 20:54:01,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 20:54:01,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=1298, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 20:54:01,350 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 41 states. [2019-09-03 20:54:02,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:02,396 INFO L93 Difference]: Finished difference Result 546 states and 688 transitions. [2019-09-03 20:54:02,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-03 20:54:02,396 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 96 [2019-09-03 20:54:02,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:02,399 INFO L225 Difference]: With dead ends: 546 [2019-09-03 20:54:02,399 INFO L226 Difference]: Without dead ends: 514 [2019-09-03 20:54:02,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 155 SyntacticMatches, 24 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2569 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1275, Invalid=5531, Unknown=0, NotChecked=0, Total=6806 [2019-09-03 20:54:02,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-09-03 20:54:02,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 120. [2019-09-03 20:54:02,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-03 20:54:02,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2019-09-03 20:54:02,408 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 96 [2019-09-03 20:54:02,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:02,408 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2019-09-03 20:54:02,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 20:54:02,408 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2019-09-03 20:54:02,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-03 20:54:02,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:02,409 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:02,409 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:02,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:02,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1945136369, now seen corresponding path program 10 times [2019-09-03 20:54:02,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:02,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:02,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:02,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:02,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:02,719 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 175 proven. 55 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:54:02,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:02,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:02,720 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:02,720 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:54:02,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:02,720 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 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:54:02,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:02,737 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:02,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:54:02,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:03,092 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 175 proven. 55 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:54:03,093 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:03,307 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 175 proven. 55 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:54:03,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:03,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 40 [2019-09-03 20:54:03,310 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:03,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 20:54:03,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 20:54:03,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=1215, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 20:54:03,312 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 40 states. [2019-09-03 20:54:04,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:04,198 INFO L93 Difference]: Finished difference Result 583 states and 738 transitions. [2019-09-03 20:54:04,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 20:54:04,199 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 96 [2019-09-03 20:54:04,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:04,201 INFO L225 Difference]: With dead ends: 583 [2019-09-03 20:54:04,201 INFO L226 Difference]: Without dead ends: 551 [2019-09-03 20:54:04,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 156 SyntacticMatches, 24 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1965 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1059, Invalid=4343, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 20:54:04,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-09-03 20:54:04,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 122. [2019-09-03 20:54:04,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-03 20:54:04,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2019-09-03 20:54:04,209 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 96 [2019-09-03 20:54:04,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:04,209 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2019-09-03 20:54:04,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 20:54:04,209 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2019-09-03 20:54:04,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-03 20:54:04,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:04,209 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:04,210 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:04,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:04,210 INFO L82 PathProgramCache]: Analyzing trace with hash 699102727, now seen corresponding path program 20 times [2019-09-03 20:54:04,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:04,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:04,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:04,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:04,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:04,356 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 86 proven. 155 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:54:04,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:04,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:04,357 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:04,357 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:54:04,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:04,357 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 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:54:04,374 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:04,374 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:04,413 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-03 20:54:04,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:04,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 20:54:04,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:04,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:04,474 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 86 proven. 155 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:54:04,474 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:04,617 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 86 proven. 155 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:54:04,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:04,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 18 [2019-09-03 20:54:04,620 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:04,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 20:54:04,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 20:54:04,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2019-09-03 20:54:04,621 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand 18 states. [2019-09-03 20:54:04,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:04,825 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2019-09-03 20:54:04,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 20:54:04,825 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 97 [2019-09-03 20:54:04,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:04,826 INFO L225 Difference]: With dead ends: 133 [2019-09-03 20:54:04,826 INFO L226 Difference]: Without dead ends: 133 [2019-09-03 20:54:04,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 181 SyntacticMatches, 22 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:54:04,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-03 20:54:04,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2019-09-03 20:54:04,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-03 20:54:04,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2019-09-03 20:54:04,830 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 142 transitions. Word has length 97 [2019-09-03 20:54:04,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:04,830 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 142 transitions. [2019-09-03 20:54:04,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 20:54:04,830 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 142 transitions. [2019-09-03 20:54:04,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 20:54:04,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:04,831 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:04,831 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:04,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:04,832 INFO L82 PathProgramCache]: Analyzing trace with hash 198195664, now seen corresponding path program 21 times [2019-09-03 20:54:04,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:04,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:04,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:04,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:04,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:05,148 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 209 proven. 66 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:05,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:05,148 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:05,148 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:05,149 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:54:05,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:05,149 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 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:05,158 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:05,159 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:05,191 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:05,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:05,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 20:54:05,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:05,747 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 209 proven. 66 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:05,748 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:06,045 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 209 proven. 66 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:06,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:06,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 54 [2019-09-03 20:54:06,048 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:06,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-03 20:54:06,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-03 20:54:06,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=2287, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 20:54:06,049 INFO L87 Difference]: Start difference. First operand 129 states and 142 transitions. Second operand 54 states. [2019-09-03 20:54:06,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:06,952 INFO L93 Difference]: Finished difference Result 212 states and 249 transitions. [2019-09-03 20:54:06,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 20:54:06,952 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2019-09-03 20:54:06,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:06,954 INFO L225 Difference]: With dead ends: 212 [2019-09-03 20:54:06,954 INFO L226 Difference]: Without dead ends: 177 [2019-09-03 20:54:06,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 158 SyntacticMatches, 26 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2990 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1225, Invalid=5095, Unknown=0, NotChecked=0, Total=6320 [2019-09-03 20:54:06,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-03 20:54:06,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 130. [2019-09-03 20:54:06,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-03 20:54:06,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-09-03 20:54:06,958 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 104 [2019-09-03 20:54:06,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:06,958 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-09-03 20:54:06,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-03 20:54:06,958 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-09-03 20:54:06,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 20:54:06,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:06,959 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:06,959 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:06,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:06,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1111773105, now seen corresponding path program 46 times [2019-09-03 20:54:06,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:06,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:06,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:06,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:06,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:07,253 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 209 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:07,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:07,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:07,254 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:07,254 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:54:07,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:07,254 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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:07,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:07,264 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:07,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 20:54:07,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:07,828 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 209 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:07,829 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:08,092 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 209 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:08,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:08,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 53 [2019-09-03 20:54:08,096 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:08,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-03 20:54:08,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-03 20:54:08,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=539, Invalid=2217, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 20:54:08,097 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 53 states. [2019-09-03 20:54:09,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:09,414 INFO L93 Difference]: Finished difference Result 259 states and 309 transitions. [2019-09-03 20:54:09,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 20:54:09,415 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-09-03 20:54:09,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:09,417 INFO L225 Difference]: With dead ends: 259 [2019-09-03 20:54:09,417 INFO L226 Difference]: Without dead ends: 224 [2019-09-03 20:54:09,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 159 SyntacticMatches, 26 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3510 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1485, Invalid=6525, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 20:54:09,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-09-03 20:54:09,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 130. [2019-09-03 20:54:09,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-03 20:54:09,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-09-03 20:54:09,420 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 104 [2019-09-03 20:54:09,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:09,420 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-09-03 20:54:09,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-03 20:54:09,420 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-09-03 20:54:09,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 20:54:09,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:09,421 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:09,421 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:09,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:09,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1062727152, now seen corresponding path program 47 times [2019-09-03 20:54:09,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:09,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:09,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:09,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:09,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:09,755 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 209 proven. 48 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:09,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:09,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:09,755 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:09,755 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:54:09,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:09,756 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 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:09,765 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:09,765 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:09,801 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-03 20:54:09,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:09,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 20:54:09,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:10,330 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 209 proven. 48 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:10,331 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:10,588 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 209 proven. 48 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:10,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:10,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 52 [2019-09-03 20:54:10,591 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:10,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 20:54:10,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 20:54:10,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=2145, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:54:10,592 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 52 states. [2019-09-03 20:54:12,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:12,042 INFO L93 Difference]: Finished difference Result 305 states and 368 transitions. [2019-09-03 20:54:12,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 20:54:12,043 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 104 [2019-09-03 20:54:12,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:12,044 INFO L225 Difference]: With dead ends: 305 [2019-09-03 20:54:12,044 INFO L226 Difference]: Without dead ends: 270 [2019-09-03 20:54:12,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 160 SyntacticMatches, 26 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3996 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1729, Invalid=7777, Unknown=0, NotChecked=0, Total=9506 [2019-09-03 20:54:12,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-09-03 20:54:12,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 130. [2019-09-03 20:54:12,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-03 20:54:12,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-09-03 20:54:12,048 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 104 [2019-09-03 20:54:12,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:12,048 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-09-03 20:54:12,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 20:54:12,048 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-09-03 20:54:12,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 20:54:12,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:12,049 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:12,049 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:12,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:12,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1638074321, now seen corresponding path program 48 times [2019-09-03 20:54:12,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:12,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:12,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:12,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:12,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:12,365 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 209 proven. 42 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:12,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:12,365 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:12,365 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:12,365 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:54:12,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:12,365 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 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:12,375 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:12,375 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:12,406 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:12,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:12,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 20:54:12,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:12,909 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 209 proven. 42 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:12,909 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:13,161 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 209 proven. 42 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:13,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:13,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 51 [2019-09-03 20:54:13,164 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:13,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 20:54:13,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 20:54:13,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=2071, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 20:54:13,165 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 51 states. [2019-09-03 20:54:14,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:14,414 INFO L93 Difference]: Finished difference Result 350 states and 426 transitions. [2019-09-03 20:54:14,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 20:54:14,414 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 104 [2019-09-03 20:54:14,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:14,416 INFO L225 Difference]: With dead ends: 350 [2019-09-03 20:54:14,417 INFO L226 Difference]: Without dead ends: 315 [2019-09-03 20:54:14,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 161 SyntacticMatches, 26 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4398 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1933, Invalid=8779, Unknown=0, NotChecked=0, Total=10712 [2019-09-03 20:54:14,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-03 20:54:14,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 130. [2019-09-03 20:54:14,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-03 20:54:14,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-09-03 20:54:14,420 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 104 [2019-09-03 20:54:14,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:14,421 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-09-03 20:54:14,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 20:54:14,421 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-09-03 20:54:14,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 20:54:14,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:14,422 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:14,422 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:14,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:14,422 INFO L82 PathProgramCache]: Analyzing trace with hash -478270960, now seen corresponding path program 49 times [2019-09-03 20:54:14,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:14,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:14,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:14,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:14,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:14,723 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 209 proven. 38 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:14,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:14,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:14,724 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:14,724 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:54:14,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:14,724 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 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:14,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:14,734 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:14,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 20:54:14,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:15,242 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 209 proven. 38 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:15,242 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:15,486 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 209 proven. 38 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:15,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:15,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 50 [2019-09-03 20:54:15,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:15,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-03 20:54:15,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-03 20:54:15,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=455, Invalid=1995, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 20:54:15,490 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 50 states. [2019-09-03 20:54:16,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:16,906 INFO L93 Difference]: Finished difference Result 394 states and 483 transitions. [2019-09-03 20:54:16,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-03 20:54:16,906 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 104 [2019-09-03 20:54:16,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:16,909 INFO L225 Difference]: With dead ends: 394 [2019-09-03 20:54:16,909 INFO L226 Difference]: Without dead ends: 359 [2019-09-03 20:54:16,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 162 SyntacticMatches, 26 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4678 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2079, Invalid=9477, Unknown=0, NotChecked=0, Total=11556 [2019-09-03 20:54:16,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-09-03 20:54:16,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 130. [2019-09-03 20:54:16,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-03 20:54:16,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-09-03 20:54:16,915 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 104 [2019-09-03 20:54:16,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:16,915 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-09-03 20:54:16,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-03 20:54:16,915 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-09-03 20:54:16,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 20:54:16,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:16,916 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:16,916 INFO L418 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:16,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:16,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1133594609, now seen corresponding path program 50 times [2019-09-03 20:54:16,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:16,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:16,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:16,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:16,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:17,206 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 209 proven. 36 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:17,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:17,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:17,207 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:17,207 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:54:17,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:17,207 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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:17,217 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:17,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:17,261 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-03 20:54:17,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:17,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 20:54:17,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:17,754 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 209 proven. 36 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:17,754 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:17,996 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 209 proven. 36 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:17,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:17,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 49 [2019-09-03 20:54:17,999 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:18,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 20:54:18,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 20:54:18,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1917, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 20:54:18,001 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 49 states. [2019-09-03 20:54:19,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:19,385 INFO L93 Difference]: Finished difference Result 437 states and 539 transitions. [2019-09-03 20:54:19,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-03 20:54:19,386 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 104 [2019-09-03 20:54:19,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:19,388 INFO L225 Difference]: With dead ends: 437 [2019-09-03 20:54:19,388 INFO L226 Difference]: Without dead ends: 402 [2019-09-03 20:54:19,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 163 SyntacticMatches, 26 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4810 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2155, Invalid=9835, Unknown=0, NotChecked=0, Total=11990 [2019-09-03 20:54:19,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-09-03 20:54:19,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 130. [2019-09-03 20:54:19,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-03 20:54:19,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-09-03 20:54:19,392 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 104 [2019-09-03 20:54:19,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:19,392 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-09-03 20:54:19,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 20:54:19,393 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-09-03 20:54:19,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 20:54:19,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:19,393 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:19,393 INFO L418 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:19,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:19,394 INFO L82 PathProgramCache]: Analyzing trace with hash 507833904, now seen corresponding path program 51 times [2019-09-03 20:54:19,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:19,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:19,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:19,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:19,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:19,689 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 209 proven. 36 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:19,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:19,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:19,689 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:19,690 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:54:19,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:19,690 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 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:19,700 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:19,700 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:19,733 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:19,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:19,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 20:54:19,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:20,176 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 209 proven. 36 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:20,177 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:20,416 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 209 proven. 36 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:20,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:20,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 48 [2019-09-03 20:54:20,419 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:20,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-03 20:54:20,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-03 20:54:20,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1837, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 20:54:20,420 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 48 states. [2019-09-03 20:54:21,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:21,829 INFO L93 Difference]: Finished difference Result 479 states and 594 transitions. [2019-09-03 20:54:21,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 20:54:21,829 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 104 [2019-09-03 20:54:21,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:21,832 INFO L225 Difference]: With dead ends: 479 [2019-09-03 20:54:21,832 INFO L226 Difference]: Without dead ends: 444 [2019-09-03 20:54:21,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 164 SyntacticMatches, 26 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4780 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2155, Invalid=9835, Unknown=0, NotChecked=0, Total=11990 [2019-09-03 20:54:21,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-09-03 20:54:21,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 130. [2019-09-03 20:54:21,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-03 20:54:21,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-09-03 20:54:21,838 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 104 [2019-09-03 20:54:21,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:21,838 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-09-03 20:54:21,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-03 20:54:21,839 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-09-03 20:54:21,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 20:54:21,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:21,839 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:21,840 INFO L418 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:21,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:21,840 INFO L82 PathProgramCache]: Analyzing trace with hash 699330543, now seen corresponding path program 52 times [2019-09-03 20:54:21,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:21,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:21,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:21,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:21,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:22,269 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 209 proven. 38 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:22,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:22,270 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:22,270 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:22,270 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:54:22,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:22,271 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 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:22,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:22,298 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:22,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 20:54:22,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:22,871 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 209 proven. 38 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:22,872 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:23,156 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 209 proven. 38 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:23,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:23,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 47 [2019-09-03 20:54:23,160 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:23,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 20:54:23,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 20:54:23,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=1755, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 20:54:23,161 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 47 states. [2019-09-03 20:54:24,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:24,510 INFO L93 Difference]: Finished difference Result 520 states and 648 transitions. [2019-09-03 20:54:24,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 20:54:24,514 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 104 [2019-09-03 20:54:24,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:24,517 INFO L225 Difference]: With dead ends: 520 [2019-09-03 20:54:24,517 INFO L226 Difference]: Without dead ends: 485 [2019-09-03 20:54:24,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 165 SyntacticMatches, 26 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4582 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2079, Invalid=9477, Unknown=0, NotChecked=0, Total=11556 [2019-09-03 20:54:24,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-09-03 20:54:24,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 130. [2019-09-03 20:54:24,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-03 20:54:24,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-09-03 20:54:24,525 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 104 [2019-09-03 20:54:24,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:24,525 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-09-03 20:54:24,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 20:54:24,526 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-09-03 20:54:24,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 20:54:24,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:24,527 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:24,527 INFO L418 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:24,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:24,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1372702128, now seen corresponding path program 53 times [2019-09-03 20:54:24,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:24,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:24,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:24,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:24,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:24,835 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 209 proven. 42 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:24,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:24,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:24,835 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:24,836 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:54:24,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:24,836 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 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:24,846 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:24,846 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:24,881 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-03 20:54:24,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:24,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 20:54:24,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:25,277 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 209 proven. 42 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:25,277 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:25,531 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 209 proven. 42 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:25,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:25,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 46 [2019-09-03 20:54:25,534 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:25,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 20:54:25,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 20:54:25,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1671, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 20:54:25,536 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 46 states. [2019-09-03 20:54:26,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:26,923 INFO L93 Difference]: Finished difference Result 560 states and 701 transitions. [2019-09-03 20:54:26,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-03 20:54:26,924 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 104 [2019-09-03 20:54:26,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:26,927 INFO L225 Difference]: With dead ends: 560 [2019-09-03 20:54:26,927 INFO L226 Difference]: Without dead ends: 525 [2019-09-03 20:54:26,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 166 SyntacticMatches, 26 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4218 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1933, Invalid=8779, Unknown=0, NotChecked=0, Total=10712 [2019-09-03 20:54:26,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-09-03 20:54:26,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 130. [2019-09-03 20:54:26,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-03 20:54:26,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-09-03 20:54:26,936 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 104 [2019-09-03 20:54:26,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:26,937 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-09-03 20:54:26,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 20:54:26,937 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-09-03 20:54:26,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 20:54:26,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:26,938 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:26,938 INFO L418 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:26,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:26,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1331404751, now seen corresponding path program 54 times [2019-09-03 20:54:26,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:26,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:26,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:26,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:26,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:26,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:27,246 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 209 proven. 48 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:27,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:27,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:27,247 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:27,247 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:54:27,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:27,247 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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:27,260 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:27,260 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:27,291 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:27,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:27,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 20:54:27,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:27,702 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 209 proven. 48 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:27,702 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:27,945 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 209 proven. 48 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:27,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:27,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 45 [2019-09-03 20:54:27,949 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:27,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 20:54:27,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 20:54:27,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=1585, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 20:54:27,950 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 45 states. [2019-09-03 20:54:29,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:29,213 INFO L93 Difference]: Finished difference Result 599 states and 753 transitions. [2019-09-03 20:54:29,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-03 20:54:29,213 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 104 [2019-09-03 20:54:29,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:29,217 INFO L225 Difference]: With dead ends: 599 [2019-09-03 20:54:29,217 INFO L226 Difference]: Without dead ends: 564 [2019-09-03 20:54:29,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 167 SyntacticMatches, 26 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3702 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1729, Invalid=7777, Unknown=0, NotChecked=0, Total=9506 [2019-09-03 20:54:29,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-09-03 20:54:29,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 130. [2019-09-03 20:54:29,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-03 20:54:29,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-09-03 20:54:29,223 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 104 [2019-09-03 20:54:29,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:29,223 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-09-03 20:54:29,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 20:54:29,223 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-09-03 20:54:29,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 20:54:29,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:29,224 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:29,224 INFO L418 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:29,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:29,225 INFO L82 PathProgramCache]: Analyzing trace with hash 171708016, now seen corresponding path program 55 times [2019-09-03 20:54:29,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:29,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:29,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:29,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:29,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 209 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:29,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:29,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:29,522 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:29,522 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:54:29,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:29,522 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 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:29,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:29,533 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:29,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 20:54:29,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:30,112 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 209 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:30,112 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:30,369 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 209 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:30,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:30,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 44 [2019-09-03 20:54:30,372 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:30,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 20:54:30,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 20:54:30,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=1497, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 20:54:30,372 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 44 states. [2019-09-03 20:54:31,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:31,478 INFO L93 Difference]: Finished difference Result 637 states and 804 transitions. [2019-09-03 20:54:31,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 20:54:31,479 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 104 [2019-09-03 20:54:31,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:31,482 INFO L225 Difference]: With dead ends: 637 [2019-09-03 20:54:31,482 INFO L226 Difference]: Without dead ends: 602 [2019-09-03 20:54:31,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 168 SyntacticMatches, 26 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3060 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1485, Invalid=6525, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 20:54:31,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-09-03 20:54:31,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 130. [2019-09-03 20:54:31,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-03 20:54:31,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-09-03 20:54:31,490 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 104 [2019-09-03 20:54:31,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:31,490 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-09-03 20:54:31,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 20:54:31,491 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-09-03 20:54:31,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 20:54:31,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:31,492 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:31,492 INFO L418 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:31,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:31,492 INFO L82 PathProgramCache]: Analyzing trace with hash -835532881, now seen corresponding path program 11 times [2019-09-03 20:54:31,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:31,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:31,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:31,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:31,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:31,770 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 209 proven. 66 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:31,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:31,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:31,770 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:31,771 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:54:31,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:31,771 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 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:31,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:31,787 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:31,827 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-03 20:54:31,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:31,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 20:54:31,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:32,195 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 209 proven. 66 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:32,195 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:32,436 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 209 proven. 66 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:32,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:32,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 43 [2019-09-03 20:54:32,439 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:32,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 20:54:32,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 20:54:32,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1407, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 20:54:32,440 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 43 states. [2019-09-03 20:54:33,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:33,327 INFO L93 Difference]: Finished difference Result 677 states and 858 transitions. [2019-09-03 20:54:33,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 20:54:33,328 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 104 [2019-09-03 20:54:33,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:33,331 INFO L225 Difference]: With dead ends: 677 [2019-09-03 20:54:33,331 INFO L226 Difference]: Without dead ends: 642 [2019-09-03 20:54:33,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 169 SyntacticMatches, 26 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2330 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1225, Invalid=5095, Unknown=0, NotChecked=0, Total=6320 [2019-09-03 20:54:33,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-09-03 20:54:33,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 132. [2019-09-03 20:54:33,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-03 20:54:33,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 146 transitions. [2019-09-03 20:54:33,342 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 146 transitions. Word has length 104 [2019-09-03 20:54:33,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:33,342 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 146 transitions. [2019-09-03 20:54:33,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 20:54:33,342 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 146 transitions. [2019-09-03 20:54:33,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-03 20:54:33,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:33,343 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:33,343 INFO L418 AbstractCegarLoop]: === Iteration 90 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:33,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:33,343 INFO L82 PathProgramCache]: Analyzing trace with hash -383682200, now seen corresponding path program 22 times [2019-09-03 20:54:33,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:33,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:33,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:33,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:33,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:33,471 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 100 proven. 187 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:33,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:33,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:33,472 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:33,472 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:54:33,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:33,472 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 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:54:33,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:33,489 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:33,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:33,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:54:33,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:33,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:33,544 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 100 proven. 187 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:33,545 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:33,702 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 100 proven. 187 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:54:33,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:33,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 19 [2019-09-03 20:54:33,705 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:33,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 20:54:33,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 20:54:33,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:54:33,706 INFO L87 Difference]: Start difference. First operand 132 states and 146 transitions. Second operand 19 states. [2019-09-03 20:54:33,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:33,933 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2019-09-03 20:54:33,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 20:54:33,934 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 105 [2019-09-03 20:54:33,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:33,935 INFO L225 Difference]: With dead ends: 143 [2019-09-03 20:54:33,935 INFO L226 Difference]: Without dead ends: 143 [2019-09-03 20:54:33,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 196 SyntacticMatches, 24 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:54:33,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-09-03 20:54:33,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2019-09-03 20:54:33,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-03 20:54:33,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2019-09-03 20:54:33,938 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 105 [2019-09-03 20:54:33,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:33,939 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2019-09-03 20:54:33,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 20:54:33,939 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2019-09-03 20:54:33,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 20:54:33,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:33,940 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:33,940 INFO L418 AbstractCegarLoop]: === Iteration 91 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:33,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:33,940 INFO L82 PathProgramCache]: Analyzing trace with hash 460511055, now seen corresponding path program 23 times [2019-09-03 20:54:33,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:33,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:33,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:33,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:33,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:34,273 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 246 proven. 78 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:54:34,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:34,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:34,274 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:34,274 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:54:34,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:34,274 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 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:34,284 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:34,285 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:34,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-03 20:54:34,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:34,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:54:34,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:34,964 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 246 proven. 78 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:54:34,964 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:35,259 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 246 proven. 78 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:54:35,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:35,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 58 [2019-09-03 20:54:35,262 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:35,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-03 20:54:35,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-03 20:54:35,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=661, Invalid=2645, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 20:54:35,263 INFO L87 Difference]: Start difference. First operand 139 states and 153 transitions. Second operand 58 states. [2019-09-03 20:54:36,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:36,539 INFO L93 Difference]: Finished difference Result 229 states and 269 transitions. [2019-09-03 20:54:36,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 20:54:36,540 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2019-09-03 20:54:36,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:36,542 INFO L225 Difference]: With dead ends: 229 [2019-09-03 20:54:36,542 INFO L226 Difference]: Without dead ends: 191 [2019-09-03 20:54:36,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 170 SyntacticMatches, 28 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3506 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1403, Invalid=5907, Unknown=0, NotChecked=0, Total=7310 [2019-09-03 20:54:36,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-09-03 20:54:36,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 140. [2019-09-03 20:54:36,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-03 20:54:36,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-03 20:54:36,547 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-03 20:54:36,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:36,548 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-03 20:54:36,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-03 20:54:36,548 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-03 20:54:36,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 20:54:36,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:36,550 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:36,550 INFO L418 AbstractCegarLoop]: === Iteration 92 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:36,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:36,550 INFO L82 PathProgramCache]: Analyzing trace with hash -881107250, now seen corresponding path program 56 times [2019-09-03 20:54:36,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:36,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:36,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:36,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:36,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:37,202 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 246 proven. 67 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:54:37,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:37,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:37,202 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:37,203 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:54:37,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:37,203 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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:37,225 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:37,225 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:37,298 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-03 20:54:37,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:37,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:54:37,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:38,472 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 246 proven. 67 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:54:38,472 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:39,092 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 246 proven. 67 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:54:39,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:39,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 57 [2019-09-03 20:54:39,099 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:39,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-03 20:54:39,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-03 20:54:39,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=2570, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 20:54:39,101 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 57 states. [2019-09-03 20:54:40,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:40,766 INFO L93 Difference]: Finished difference Result 280 states and 334 transitions. [2019-09-03 20:54:40,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 20:54:40,767 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2019-09-03 20:54:40,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:40,768 INFO L225 Difference]: With dead ends: 280 [2019-09-03 20:54:40,768 INFO L226 Difference]: Without dead ends: 242 [2019-09-03 20:54:40,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 171 SyntacticMatches, 28 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4134 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1711, Invalid=7601, Unknown=0, NotChecked=0, Total=9312 [2019-09-03 20:54:40,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-03 20:54:40,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 140. [2019-09-03 20:54:40,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-03 20:54:40,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-03 20:54:40,771 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-03 20:54:40,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:40,771 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-03 20:54:40,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-03 20:54:40,772 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-03 20:54:40,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 20:54:40,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:40,772 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:40,772 INFO L418 AbstractCegarLoop]: === Iteration 93 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:40,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:40,773 INFO L82 PathProgramCache]: Analyzing trace with hash 2123656047, now seen corresponding path program 57 times [2019-09-03 20:54:40,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:40,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:40,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:40,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:40,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:41,107 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 246 proven. 58 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:54:41,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:41,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:41,108 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:41,108 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:54:41,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:41,108 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 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:41,118 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:41,118 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:41,150 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:41,150 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:41,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:54:41,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:41,734 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 246 proven. 58 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:54:41,734 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:42,040 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 246 proven. 58 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:54:42,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:42,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 56 [2019-09-03 20:54:42,043 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:42,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-03 20:54:42,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-03 20:54:42,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=587, Invalid=2493, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 20:54:42,044 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 56 states. [2019-09-03 20:54:43,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:43,115 INFO L93 Difference]: Finished difference Result 330 states and 398 transitions. [2019-09-03 20:54:43,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 20:54:43,115 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 112 [2019-09-03 20:54:43,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:43,117 INFO L225 Difference]: With dead ends: 330 [2019-09-03 20:54:43,117 INFO L226 Difference]: Without dead ends: 292 [2019-09-03 20:54:43,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 172 SyntacticMatches, 28 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4737 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2008, Invalid=9122, Unknown=0, NotChecked=0, Total=11130 [2019-09-03 20:54:43,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-09-03 20:54:43,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 140. [2019-09-03 20:54:43,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-03 20:54:43,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-03 20:54:43,122 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-03 20:54:43,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:43,122 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-03 20:54:43,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-03 20:54:43,122 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-03 20:54:43,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 20:54:43,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:43,123 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:43,123 INFO L418 AbstractCegarLoop]: === Iteration 94 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:43,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:43,123 INFO L82 PathProgramCache]: Analyzing trace with hash 835110574, now seen corresponding path program 58 times [2019-09-03 20:54:43,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:43,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:43,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:43,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:43,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:43,494 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 246 proven. 51 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:54:43,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:43,495 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:43,495 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:43,495 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:54:43,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:43,495 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 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:43,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:43,506 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:43,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:54:43,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:44,168 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 246 proven. 51 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:54:44,169 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:44,445 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 246 proven. 51 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:54:44,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:44,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 55 [2019-09-03 20:54:44,448 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:44,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 20:54:44,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 20:54:44,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=2414, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 20:54:44,449 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 55 states. [2019-09-03 20:54:45,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:45,776 INFO L93 Difference]: Finished difference Result 379 states and 461 transitions. [2019-09-03 20:54:45,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-03 20:54:45,776 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 112 [2019-09-03 20:54:45,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:45,778 INFO L225 Difference]: With dead ends: 379 [2019-09-03 20:54:45,779 INFO L226 Difference]: Without dead ends: 341 [2019-09-03 20:54:45,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 173 SyntacticMatches, 28 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5259 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2267, Invalid=10389, Unknown=0, NotChecked=0, Total=12656 [2019-09-03 20:54:45,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-09-03 20:54:45,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 140. [2019-09-03 20:54:45,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-03 20:54:45,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-03 20:54:45,784 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-03 20:54:45,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:45,784 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-03 20:54:45,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 20:54:45,784 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-03 20:54:45,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 20:54:45,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:45,785 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:45,785 INFO L418 AbstractCegarLoop]: === Iteration 95 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:45,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:45,785 INFO L82 PathProgramCache]: Analyzing trace with hash 793544591, now seen corresponding path program 59 times [2019-09-03 20:54:45,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:45,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:45,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:45,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:45,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:46,135 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 246 proven. 46 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:54:46,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:46,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:46,135 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:46,135 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:54:46,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:46,136 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 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:46,145 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:46,145 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:46,185 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-03 20:54:46,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:46,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:54:46,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:46,726 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 246 proven. 46 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:54:46,726 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:47,034 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 246 proven. 46 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:54:47,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:47,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 54 [2019-09-03 20:54:47,037 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:47,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-03 20:54:47,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-03 20:54:47,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=529, Invalid=2333, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 20:54:47,039 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 54 states. [2019-09-03 20:54:48,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:48,745 INFO L93 Difference]: Finished difference Result 427 states and 523 transitions. [2019-09-03 20:54:48,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 20:54:48,746 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 112 [2019-09-03 20:54:48,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:48,748 INFO L225 Difference]: With dead ends: 427 [2019-09-03 20:54:48,748 INFO L226 Difference]: Without dead ends: 389 [2019-09-03 20:54:48,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 174 SyntacticMatches, 28 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5656 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2467, Invalid=11339, Unknown=0, NotChecked=0, Total=13806 [2019-09-03 20:54:48,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-09-03 20:54:48,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 140. [2019-09-03 20:54:48,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-03 20:54:48,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-03 20:54:48,752 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-03 20:54:48,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:48,753 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-03 20:54:48,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-03 20:54:48,753 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-03 20:54:48,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 20:54:48,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:48,753 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:48,754 INFO L418 AbstractCegarLoop]: === Iteration 96 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:48,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:48,754 INFO L82 PathProgramCache]: Analyzing trace with hash 2039129742, now seen corresponding path program 60 times [2019-09-03 20:54:48,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:48,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:48,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:48,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:48,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:49,059 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 246 proven. 43 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:54:49,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:49,059 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:49,059 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:49,059 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:54:49,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:49,059 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 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:49,069 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:49,069 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:49,104 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:49,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:49,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:54:49,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:49,672 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 246 proven. 43 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:54:49,672 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:49,946 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 246 proven. 43 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:54:49,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:49,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 53 [2019-09-03 20:54:49,949 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:49,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-03 20:54:49,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-03 20:54:49,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=2250, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 20:54:49,950 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 53 states. [2019-09-03 20:54:51,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:51,738 INFO L93 Difference]: Finished difference Result 474 states and 584 transitions. [2019-09-03 20:54:51,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-03 20:54:51,738 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 112 [2019-09-03 20:54:51,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:51,741 INFO L225 Difference]: With dead ends: 474 [2019-09-03 20:54:51,741 INFO L226 Difference]: Without dead ends: 436 [2019-09-03 20:54:51,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 175 SyntacticMatches, 28 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5896 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2593, Invalid=11927, Unknown=0, NotChecked=0, Total=14520 [2019-09-03 20:54:51,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-09-03 20:54:51,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 140. [2019-09-03 20:54:51,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-03 20:54:51,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-03 20:54:51,746 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-03 20:54:51,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:51,746 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-03 20:54:51,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-03 20:54:51,746 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-03 20:54:51,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 20:54:51,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:51,747 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:51,748 INFO L418 AbstractCegarLoop]: === Iteration 97 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:51,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:51,748 INFO L82 PathProgramCache]: Analyzing trace with hash 832383919, now seen corresponding path program 61 times [2019-09-03 20:54:51,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:51,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:51,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:51,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:51,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:52,090 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 246 proven. 42 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:54:52,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:52,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:52,091 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:52,091 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:54:52,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:52,091 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 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:52,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:52,101 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:52,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:54:52,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 246 proven. 42 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:54:52,671 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:52,956 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 246 proven. 42 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:54:52,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:52,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 52 [2019-09-03 20:54:52,959 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:52,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 20:54:52,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 20:54:52,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=2165, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:54:52,961 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 52 states. [2019-09-03 20:54:54,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:54,526 INFO L93 Difference]: Finished difference Result 520 states and 644 transitions. [2019-09-03 20:54:54,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-03 20:54:54,527 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 112 [2019-09-03 20:54:54,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:54,530 INFO L225 Difference]: With dead ends: 520 [2019-09-03 20:54:54,530 INFO L226 Difference]: Without dead ends: 482 [2019-09-03 20:54:54,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 176 SyntacticMatches, 28 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5959 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2636, Invalid=12126, Unknown=0, NotChecked=0, Total=14762 [2019-09-03 20:54:54,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-09-03 20:54:54,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 140. [2019-09-03 20:54:54,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-03 20:54:54,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-03 20:54:54,535 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-03 20:54:54,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:54,535 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-03 20:54:54,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 20:54:54,536 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-03 20:54:54,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 20:54:54,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:54,536 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:54,537 INFO L418 AbstractCegarLoop]: === Iteration 98 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:54,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:54,537 INFO L82 PathProgramCache]: Analyzing trace with hash 377814638, now seen corresponding path program 62 times [2019-09-03 20:54:54,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:54,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:54,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:54,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:54,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:54,842 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 246 proven. 43 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:54:54,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:54,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:54,842 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:54,842 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:54:54,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:54,842 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 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:54,852 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:54,852 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:54,903 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-03 20:54:54,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:54,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:54:54,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:55,408 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 246 proven. 43 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:54:55,408 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:55,679 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 246 proven. 43 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:54:55,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:55,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 51 [2019-09-03 20:54:55,682 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:55,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 20:54:55,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 20:54:55,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=2078, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 20:54:55,683 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 51 states. [2019-09-03 20:54:57,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:57,309 INFO L93 Difference]: Finished difference Result 565 states and 703 transitions. [2019-09-03 20:54:57,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-03 20:54:57,309 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 112 [2019-09-03 20:54:57,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:57,311 INFO L225 Difference]: With dead ends: 565 [2019-09-03 20:54:57,311 INFO L226 Difference]: Without dead ends: 527 [2019-09-03 20:54:57,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 177 SyntacticMatches, 28 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5836 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2593, Invalid=11927, Unknown=0, NotChecked=0, Total=14520 [2019-09-03 20:54:57,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-09-03 20:54:57,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 140. [2019-09-03 20:54:57,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-03 20:54:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-03 20:54:57,317 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-03 20:54:57,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:57,317 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-03 20:54:57,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 20:54:57,317 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-03 20:54:57,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 20:54:57,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:57,318 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:57,318 INFO L418 AbstractCegarLoop]: === Iteration 99 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:57,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:57,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1576511537, now seen corresponding path program 63 times [2019-09-03 20:54:57,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:57,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:57,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:57,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:57,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:57,625 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 246 proven. 46 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:54:57,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:57,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:57,625 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:57,626 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:54:57,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:57,626 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 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:57,637 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:57,637 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:57,667 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:57,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:57,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:54:57,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:58,143 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 246 proven. 46 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:54:58,144 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:58,418 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 246 proven. 46 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:54:58,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:58,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 50 [2019-09-03 20:54:58,421 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:58,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-03 20:54:58,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-03 20:54:58,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1989, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 20:54:58,422 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 50 states. [2019-09-03 20:55:00,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:00,084 INFO L93 Difference]: Finished difference Result 609 states and 761 transitions. [2019-09-03 20:55:00,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-03 20:55:00,084 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 112 [2019-09-03 20:55:00,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:00,087 INFO L225 Difference]: With dead ends: 609 [2019-09-03 20:55:00,087 INFO L226 Difference]: Without dead ends: 571 [2019-09-03 20:55:00,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 178 SyntacticMatches, 28 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5524 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2467, Invalid=11339, Unknown=0, NotChecked=0, Total=13806 [2019-09-03 20:55:00,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-09-03 20:55:00,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 140. [2019-09-03 20:55:00,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-03 20:55:00,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-03 20:55:00,094 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-03 20:55:00,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:00,094 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-03 20:55:00,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-03 20:55:00,095 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-03 20:55:00,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 20:55:00,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:00,095 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:00,096 INFO L418 AbstractCegarLoop]: === Iteration 100 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:00,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:00,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1408486990, now seen corresponding path program 64 times [2019-09-03 20:55:00,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:00,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:00,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:00,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:00,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:00,424 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 246 proven. 51 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:55:00,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:00,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:00,425 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:00,425 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:55:00,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:00,425 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 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:00,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:00,435 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:55:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:00,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:55:00,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:00,928 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 246 proven. 51 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:55:00,929 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:01,196 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 246 proven. 51 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:55:01,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:01,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 49 [2019-09-03 20:55:01,199 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:01,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 20:55:01,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 20:55:01,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=454, Invalid=1898, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 20:55:01,200 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 49 states. [2019-09-03 20:55:02,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:02,745 INFO L93 Difference]: Finished difference Result 652 states and 818 transitions. [2019-09-03 20:55:02,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-03 20:55:02,745 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 112 [2019-09-03 20:55:02,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:02,748 INFO L225 Difference]: With dead ends: 652 [2019-09-03 20:55:02,749 INFO L226 Difference]: Without dead ends: 614 [2019-09-03 20:55:02,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 179 SyntacticMatches, 28 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5031 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2267, Invalid=10389, Unknown=0, NotChecked=0, Total=12656 [2019-09-03 20:55:02,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-09-03 20:55:02,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 140. [2019-09-03 20:55:02,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-03 20:55:02,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-03 20:55:02,756 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-03 20:55:02,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:02,756 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-03 20:55:02,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 20:55:02,756 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-03 20:55:02,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 20:55:02,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:02,757 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:02,757 INFO L418 AbstractCegarLoop]: === Iteration 101 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:02,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:02,758 INFO L82 PathProgramCache]: Analyzing trace with hash -711980049, now seen corresponding path program 65 times [2019-09-03 20:55:02,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:02,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:02,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:02,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:02,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:03,108 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 246 proven. 58 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:55:03,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:03,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:03,109 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:03,109 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:55:03,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:03,109 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 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:03,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:55:03,119 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:55:03,160 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-03 20:55:03,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:03,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:55:03,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:03,602 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 246 proven. 58 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:55:03,602 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:03,890 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 246 proven. 58 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:55:03,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:03,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 48 [2019-09-03 20:55:03,893 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:03,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-03 20:55:03,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-03 20:55:03,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=1805, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 20:55:03,894 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 48 states. [2019-09-03 20:55:05,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:05,266 INFO L93 Difference]: Finished difference Result 694 states and 874 transitions. [2019-09-03 20:55:05,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 20:55:05,267 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 112 [2019-09-03 20:55:05,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:05,270 INFO L225 Difference]: With dead ends: 694 [2019-09-03 20:55:05,270 INFO L226 Difference]: Without dead ends: 656 [2019-09-03 20:55:05,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 180 SyntacticMatches, 28 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4377 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2008, Invalid=9122, Unknown=0, NotChecked=0, Total=11130 [2019-09-03 20:55:05,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2019-09-03 20:55:05,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 140. [2019-09-03 20:55:05,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-03 20:55:05,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-03 20:55:05,281 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-03 20:55:05,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:05,281 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-03 20:55:05,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-03 20:55:05,281 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-03 20:55:05,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 20:55:05,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:05,282 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:05,282 INFO L418 AbstractCegarLoop]: === Iteration 102 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:05,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:05,283 INFO L82 PathProgramCache]: Analyzing trace with hash 882185774, now seen corresponding path program 66 times [2019-09-03 20:55:05,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:05,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:05,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:05,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:05,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:05,600 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 246 proven. 67 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:55:05,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:05,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:05,600 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:05,600 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:55:05,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:05,600 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 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:05,610 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:05,610 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:05,645 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:05,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:05,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:55:05,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:06,082 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 246 proven. 67 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:55:06,082 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:06,360 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 246 proven. 67 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:55:06,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:06,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 47 [2019-09-03 20:55:06,362 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:06,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 20:55:06,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 20:55:06,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=452, Invalid=1710, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 20:55:06,364 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 47 states. [2019-09-03 20:55:07,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:07,578 INFO L93 Difference]: Finished difference Result 735 states and 929 transitions. [2019-09-03 20:55:07,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-03 20:55:07,578 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 112 [2019-09-03 20:55:07,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:07,582 INFO L225 Difference]: With dead ends: 735 [2019-09-03 20:55:07,582 INFO L226 Difference]: Without dead ends: 697 [2019-09-03 20:55:07,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 181 SyntacticMatches, 28 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3594 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1711, Invalid=7601, Unknown=0, NotChecked=0, Total=9312 [2019-09-03 20:55:07,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-09-03 20:55:07,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 140. [2019-09-03 20:55:07,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-03 20:55:07,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-03 20:55:07,592 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-03 20:55:07,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:07,592 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-03 20:55:07,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 20:55:07,592 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-03 20:55:07,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 20:55:07,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:07,593 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:07,593 INFO L418 AbstractCegarLoop]: === Iteration 103 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:07,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:07,593 INFO L82 PathProgramCache]: Analyzing trace with hash 2041989135, now seen corresponding path program 12 times [2019-09-03 20:55:07,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:07,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:07,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:07,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:07,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:07,906 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 246 proven. 78 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:55:07,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:07,906 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:07,906 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:07,907 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:55:07,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:07,907 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 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:07,916 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:07,916 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:07,948 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:07,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:07,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:55:07,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:08,364 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 246 proven. 78 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:55:08,364 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:08,678 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 246 proven. 78 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:55:08,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:08,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 46 [2019-09-03 20:55:08,681 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:08,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 20:55:08,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 20:55:08,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=1613, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 20:55:08,683 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 46 states. [2019-09-03 20:55:09,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:09,682 INFO L93 Difference]: Finished difference Result 778 states and 987 transitions. [2019-09-03 20:55:09,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 20:55:09,682 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 112 [2019-09-03 20:55:09,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:09,685 INFO L225 Difference]: With dead ends: 778 [2019-09-03 20:55:09,685 INFO L226 Difference]: Without dead ends: 740 [2019-09-03 20:55:09,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 182 SyntacticMatches, 28 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2726 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1403, Invalid=5907, Unknown=0, NotChecked=0, Total=7310 [2019-09-03 20:55:09,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2019-09-03 20:55:09,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 142. [2019-09-03 20:55:09,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-09-03 20:55:09,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 157 transitions. [2019-09-03 20:55:09,693 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 157 transitions. Word has length 112 [2019-09-03 20:55:09,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:09,693 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 157 transitions. [2019-09-03 20:55:09,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 20:55:09,694 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 157 transitions. [2019-09-03 20:55:09,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-03 20:55:09,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:09,694 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:09,694 INFO L418 AbstractCegarLoop]: === Iteration 104 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:09,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:09,695 INFO L82 PathProgramCache]: Analyzing trace with hash -139002137, now seen corresponding path program 24 times [2019-09-03 20:55:09,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:09,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:09,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:09,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:09,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:09,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:09,815 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 115 proven. 222 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:55:09,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:09,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:09,816 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:09,816 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:55:09,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:09,816 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 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:09,825 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:09,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:09,869 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:09,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:09,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 20:55:09,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:09,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:09,899 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 115 proven. 222 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:55:09,900 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:10,067 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 115 proven. 222 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:55:10,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:10,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 20 [2019-09-03 20:55:10,070 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:10,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 20:55:10,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 20:55:10,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:55:10,070 INFO L87 Difference]: Start difference. First operand 142 states and 157 transitions. Second operand 20 states. [2019-09-03 20:55:10,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:10,319 INFO L93 Difference]: Finished difference Result 153 states and 169 transitions. [2019-09-03 20:55:10,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 20:55:10,320 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 113 [2019-09-03 20:55:10,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:10,320 INFO L225 Difference]: With dead ends: 153 [2019-09-03 20:55:10,321 INFO L226 Difference]: Without dead ends: 153 [2019-09-03 20:55:10,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 211 SyntacticMatches, 26 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:55:10,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-09-03 20:55:10,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2019-09-03 20:55:10,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-03 20:55:10,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 164 transitions. [2019-09-03 20:55:10,325 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 164 transitions. Word has length 113 [2019-09-03 20:55:10,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:10,325 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 164 transitions. [2019-09-03 20:55:10,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 20:55:10,325 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 164 transitions. [2019-09-03 20:55:10,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 20:55:10,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:10,326 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:10,326 INFO L418 AbstractCegarLoop]: === Iteration 105 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:10,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:10,326 INFO L82 PathProgramCache]: Analyzing trace with hash -264047376, now seen corresponding path program 25 times [2019-09-03 20:55:10,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:10,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:10,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:10,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:10,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:10,708 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 286 proven. 91 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:10,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:10,709 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:10,709 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:10,709 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:55:10,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:10,709 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 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:10,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:10,719 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:55:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:10,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 20:55:10,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:11,451 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 286 proven. 91 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:11,451 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:11,793 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 286 proven. 91 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:11,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:11,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 62 [2019-09-03 20:55:11,796 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:11,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-03 20:55:11,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-03 20:55:11,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=753, Invalid=3029, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 20:55:11,797 INFO L87 Difference]: Start difference. First operand 149 states and 164 transitions. Second operand 62 states. [2019-09-03 20:55:12,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:12,693 INFO L93 Difference]: Finished difference Result 246 states and 289 transitions. [2019-09-03 20:55:12,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 20:55:12,693 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2019-09-03 20:55:12,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:12,694 INFO L225 Difference]: With dead ends: 246 [2019-09-03 20:55:12,694 INFO L226 Difference]: Without dead ends: 205 [2019-09-03 20:55:12,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 182 SyntacticMatches, 30 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4063 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1593, Invalid=6779, Unknown=0, NotChecked=0, Total=8372 [2019-09-03 20:55:12,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-03 20:55:12,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 150. [2019-09-03 20:55:12,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 20:55:12,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-03 20:55:12,698 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-03 20:55:12,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:12,698 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-03 20:55:12,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-03 20:55:12,698 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-03 20:55:12,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 20:55:12,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:12,699 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:12,699 INFO L418 AbstractCegarLoop]: === Iteration 106 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:12,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:12,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1127772817, now seen corresponding path program 67 times [2019-09-03 20:55:12,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:12,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:12,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:12,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:12,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:13,061 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 286 proven. 79 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:13,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:13,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:13,061 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:13,061 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:55:13,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:13,061 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 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:13,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:13,071 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:55:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:13,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 20:55:13,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:13,791 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 286 proven. 79 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:13,791 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:14,126 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 286 proven. 79 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:14,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:14,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 61 [2019-09-03 20:55:14,129 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:14,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-03 20:55:14,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-03 20:55:14,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=711, Invalid=2949, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 20:55:14,130 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 61 states. [2019-09-03 20:55:15,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:15,632 INFO L93 Difference]: Finished difference Result 301 states and 359 transitions. [2019-09-03 20:55:15,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 20:55:15,632 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2019-09-03 20:55:15,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:15,633 INFO L225 Difference]: With dead ends: 301 [2019-09-03 20:55:15,633 INFO L226 Difference]: Without dead ends: 260 [2019-09-03 20:55:15,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 183 SyntacticMatches, 30 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4809 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1953, Invalid=8759, Unknown=0, NotChecked=0, Total=10712 [2019-09-03 20:55:15,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-09-03 20:55:15,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 150. [2019-09-03 20:55:15,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 20:55:15,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-03 20:55:15,636 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-03 20:55:15,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:15,637 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-03 20:55:15,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-03 20:55:15,637 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-03 20:55:15,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 20:55:15,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:15,637 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:15,638 INFO L418 AbstractCegarLoop]: === Iteration 107 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:15,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:15,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1155634928, now seen corresponding path program 68 times [2019-09-03 20:55:15,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:15,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:15,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:15,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:15,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:16,023 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 286 proven. 69 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:16,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:16,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:16,023 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:16,024 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:55:16,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:16,024 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 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:16,034 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:55:16,034 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:55:16,082 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-03 20:55:16,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:16,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 20:55:16,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:16,736 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 286 proven. 69 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:16,736 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:17,081 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 286 proven. 69 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:17,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:17,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 60 [2019-09-03 20:55:17,085 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:17,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-03 20:55:17,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-03 20:55:17,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=2867, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 20:55:17,086 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 60 states. [2019-09-03 20:55:18,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:18,432 INFO L93 Difference]: Finished difference Result 355 states and 428 transitions. [2019-09-03 20:55:18,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 20:55:18,432 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 120 [2019-09-03 20:55:18,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:18,434 INFO L225 Difference]: With dead ends: 355 [2019-09-03 20:55:18,434 INFO L226 Difference]: Without dead ends: 314 [2019-09-03 20:55:18,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 184 SyntacticMatches, 30 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5541 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2308, Invalid=10574, Unknown=0, NotChecked=0, Total=12882 [2019-09-03 20:55:18,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-03 20:55:18,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 150. [2019-09-03 20:55:18,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 20:55:18,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-03 20:55:18,438 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-03 20:55:18,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:18,439 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-03 20:55:18,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-03 20:55:18,439 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-03 20:55:18,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 20:55:18,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:18,440 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:18,440 INFO L418 AbstractCegarLoop]: === Iteration 108 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:18,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:18,440 INFO L82 PathProgramCache]: Analyzing trace with hash -325249713, now seen corresponding path program 69 times [2019-09-03 20:55:18,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:18,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:18,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:18,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:18,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:18,814 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 286 proven. 61 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:18,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:18,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:18,815 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:18,815 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:55:18,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:18,815 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 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:18,824 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:18,824 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:18,860 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:18,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:18,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 20:55:18,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:19,496 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 286 proven. 61 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:19,496 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:19,821 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 286 proven. 61 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:19,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:19,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 59 [2019-09-03 20:55:19,824 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:19,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-03 20:55:19,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-03 20:55:19,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=639, Invalid=2783, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 20:55:19,825 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 59 states. [2019-09-03 20:55:21,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:21,183 INFO L93 Difference]: Finished difference Result 408 states and 496 transitions. [2019-09-03 20:55:21,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-03 20:55:21,183 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 120 [2019-09-03 20:55:21,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:21,185 INFO L225 Difference]: With dead ends: 408 [2019-09-03 20:55:21,185 INFO L226 Difference]: Without dead ends: 367 [2019-09-03 20:55:21,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 185 SyntacticMatches, 30 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6197 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2628, Invalid=12134, Unknown=0, NotChecked=0, Total=14762 [2019-09-03 20:55:21,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-09-03 20:55:21,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 150. [2019-09-03 20:55:21,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 20:55:21,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-03 20:55:21,189 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-03 20:55:21,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:21,189 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-03 20:55:21,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-03 20:55:21,190 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-03 20:55:21,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 20:55:21,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:21,190 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 9, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:21,190 INFO L418 AbstractCegarLoop]: === Iteration 109 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:21,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:21,191 INFO L82 PathProgramCache]: Analyzing trace with hash 948462896, now seen corresponding path program 70 times [2019-09-03 20:55:21,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:21,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:21,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:21,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:21,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:21,562 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 286 proven. 55 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:21,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:21,562 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:21,562 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:21,563 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:55:21,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:21,563 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 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:21,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:21,573 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:55:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:21,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 20:55:21,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:22,295 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 286 proven. 55 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:22,296 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:22,611 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 286 proven. 55 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:22,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:22,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 58 [2019-09-03 20:55:22,614 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:22,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-03 20:55:22,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-03 20:55:22,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=609, Invalid=2697, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 20:55:22,615 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 58 states. [2019-09-03 20:55:24,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:24,408 INFO L93 Difference]: Finished difference Result 460 states and 563 transitions. [2019-09-03 20:55:24,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-03 20:55:24,409 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 120 [2019-09-03 20:55:24,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:24,410 INFO L225 Difference]: With dead ends: 460 [2019-09-03 20:55:24,410 INFO L226 Difference]: Without dead ends: 419 [2019-09-03 20:55:24,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 186 SyntacticMatches, 30 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6727 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2889, Invalid=13367, Unknown=0, NotChecked=0, Total=16256 [2019-09-03 20:55:24,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-09-03 20:55:24,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 150. [2019-09-03 20:55:24,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 20:55:24,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-03 20:55:24,414 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-03 20:55:24,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:24,414 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-03 20:55:24,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-03 20:55:24,415 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-03 20:55:24,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 20:55:24,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:24,415 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:24,415 INFO L418 AbstractCegarLoop]: === Iteration 110 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:24,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:24,416 INFO L82 PathProgramCache]: Analyzing trace with hash 435361071, now seen corresponding path program 71 times [2019-09-03 20:55:24,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:24,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:24,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:24,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:24,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:24,776 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 286 proven. 51 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:24,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:24,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:24,777 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:24,777 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:55:24,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:24,777 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 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:24,788 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:55:24,788 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:55:24,830 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-03 20:55:24,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:24,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 20:55:24,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:25,425 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 286 proven. 51 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:25,425 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:25,747 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 286 proven. 51 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:25,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:25,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 57 [2019-09-03 20:55:25,750 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:25,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-03 20:55:25,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-03 20:55:25,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=583, Invalid=2609, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 20:55:25,751 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 57 states. [2019-09-03 20:55:27,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:27,538 INFO L93 Difference]: Finished difference Result 511 states and 629 transitions. [2019-09-03 20:55:27,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-03 20:55:27,539 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 120 [2019-09-03 20:55:27,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:27,540 INFO L225 Difference]: With dead ends: 511 [2019-09-03 20:55:27,540 INFO L226 Difference]: Without dead ends: 470 [2019-09-03 20:55:27,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 187 SyntacticMatches, 30 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7093 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3073, Invalid=14219, Unknown=0, NotChecked=0, Total=17292 [2019-09-03 20:55:27,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-03 20:55:27,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 150. [2019-09-03 20:55:27,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 20:55:27,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-03 20:55:27,545 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-03 20:55:27,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:27,545 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-03 20:55:27,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-03 20:55:27,545 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-03 20:55:27,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 20:55:27,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:27,546 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:27,546 INFO L418 AbstractCegarLoop]: === Iteration 111 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:27,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:27,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1250093392, now seen corresponding path program 72 times [2019-09-03 20:55:27,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:27,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:27,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:27,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:27,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:27,942 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 286 proven. 49 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:27,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:27,942 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:27,942 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:27,942 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:55:27,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:27,943 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 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:27,952 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:27,952 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:27,987 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:27,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:27,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 20:55:27,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:28,559 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 286 proven. 49 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:28,559 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:28,893 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 286 proven. 49 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:28,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:28,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 56 [2019-09-03 20:55:28,897 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:28,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-03 20:55:28,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-03 20:55:28,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=2519, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 20:55:28,898 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 56 states. [2019-09-03 20:55:30,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:30,963 INFO L93 Difference]: Finished difference Result 561 states and 694 transitions. [2019-09-03 20:55:30,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-03 20:55:30,963 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 120 [2019-09-03 20:55:30,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:30,965 INFO L225 Difference]: With dead ends: 561 [2019-09-03 20:55:30,965 INFO L226 Difference]: Without dead ends: 520 [2019-09-03 20:55:30,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 188 SyntacticMatches, 30 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7269 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3168, Invalid=14654, Unknown=0, NotChecked=0, Total=17822 [2019-09-03 20:55:30,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-09-03 20:55:30,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 150. [2019-09-03 20:55:30,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 20:55:30,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-03 20:55:30,974 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-03 20:55:30,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:30,974 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-03 20:55:30,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-03 20:55:30,974 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-03 20:55:30,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 20:55:30,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:30,978 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:30,978 INFO L418 AbstractCegarLoop]: === Iteration 112 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:30,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:30,979 INFO L82 PathProgramCache]: Analyzing trace with hash 445091087, now seen corresponding path program 73 times [2019-09-03 20:55:30,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:30,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:30,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:30,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:30,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:30,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:31,328 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 286 proven. 49 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:31,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:31,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:31,328 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:31,328 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:55:31,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:31,329 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 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:31,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:31,338 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:55:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:31,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 20:55:31,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:31,935 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 286 proven. 49 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:31,936 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:32,243 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 286 proven. 49 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:32,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:32,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 55 [2019-09-03 20:55:32,247 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:32,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 20:55:32,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 20:55:32,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=543, Invalid=2427, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 20:55:32,248 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 55 states. [2019-09-03 20:55:34,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:34,343 INFO L93 Difference]: Finished difference Result 610 states and 758 transitions. [2019-09-03 20:55:34,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-03 20:55:34,343 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 120 [2019-09-03 20:55:34,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:34,345 INFO L225 Difference]: With dead ends: 610 [2019-09-03 20:55:34,345 INFO L226 Difference]: Without dead ends: 569 [2019-09-03 20:55:34,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 189 SyntacticMatches, 30 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7241 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3168, Invalid=14654, Unknown=0, NotChecked=0, Total=17822 [2019-09-03 20:55:34,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-09-03 20:55:34,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 150. [2019-09-03 20:55:34,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 20:55:34,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-03 20:55:34,350 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-03 20:55:34,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:34,350 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-03 20:55:34,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 20:55:34,351 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-03 20:55:34,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 20:55:34,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:34,351 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:34,351 INFO L418 AbstractCegarLoop]: === Iteration 113 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:34,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:34,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1804596592, now seen corresponding path program 74 times [2019-09-03 20:55:34,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:34,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:34,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:34,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:34,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:34,731 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 286 proven. 51 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:34,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:34,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:34,732 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:34,732 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:55:34,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:34,732 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 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:34,741 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:55:34,742 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:55:34,783 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-03 20:55:34,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:34,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 20:55:34,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:35,319 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 286 proven. 51 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:35,319 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:35,626 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 286 proven. 51 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:35,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:35,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 54 [2019-09-03 20:55:35,629 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:35,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-03 20:55:35,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-03 20:55:35,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=529, Invalid=2333, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 20:55:35,631 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 54 states. [2019-09-03 20:55:37,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:37,681 INFO L93 Difference]: Finished difference Result 658 states and 821 transitions. [2019-09-03 20:55:37,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-03 20:55:37,682 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 120 [2019-09-03 20:55:37,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:37,683 INFO L225 Difference]: With dead ends: 658 [2019-09-03 20:55:37,683 INFO L226 Difference]: Without dead ends: 617 [2019-09-03 20:55:37,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 190 SyntacticMatches, 30 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7003 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3073, Invalid=14219, Unknown=0, NotChecked=0, Total=17292 [2019-09-03 20:55:37,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-03 20:55:37,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 150. [2019-09-03 20:55:37,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 20:55:37,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-03 20:55:37,690 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-03 20:55:37,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:37,690 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-03 20:55:37,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-03 20:55:37,690 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-03 20:55:37,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 20:55:37,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:37,691 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 9, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:37,691 INFO L418 AbstractCegarLoop]: === Iteration 114 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:37,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:37,691 INFO L82 PathProgramCache]: Analyzing trace with hash 462978287, now seen corresponding path program 75 times [2019-09-03 20:55:37,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:37,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:37,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:37,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:37,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:38,026 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 286 proven. 55 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:38,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:38,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:38,027 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:38,027 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:55:38,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:38,027 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 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:38,036 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:38,036 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:38,070 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:38,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:38,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 20:55:38,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:38,592 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 286 proven. 55 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:38,592 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:38,923 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 286 proven. 55 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:38,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:38,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 53 [2019-09-03 20:55:38,927 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:38,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-03 20:55:38,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-03 20:55:38,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=2237, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 20:55:38,928 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 53 states. [2019-09-03 20:55:40,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:40,707 INFO L93 Difference]: Finished difference Result 705 states and 883 transitions. [2019-09-03 20:55:40,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-03 20:55:40,707 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 120 [2019-09-03 20:55:40,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:40,709 INFO L225 Difference]: With dead ends: 705 [2019-09-03 20:55:40,709 INFO L226 Difference]: Without dead ends: 664 [2019-09-03 20:55:40,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 191 SyntacticMatches, 30 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6557 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2889, Invalid=13367, Unknown=0, NotChecked=0, Total=16256 [2019-09-03 20:55:40,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2019-09-03 20:55:40,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 150. [2019-09-03 20:55:40,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 20:55:40,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-03 20:55:40,716 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-03 20:55:40,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:40,716 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-03 20:55:40,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-03 20:55:40,716 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-03 20:55:40,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 20:55:40,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:40,717 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:40,717 INFO L418 AbstractCegarLoop]: === Iteration 115 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:40,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:40,717 INFO L82 PathProgramCache]: Analyzing trace with hash -827225712, now seen corresponding path program 76 times [2019-09-03 20:55:40,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:40,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:40,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:40,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:40,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:41,085 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 286 proven. 61 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:41,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:41,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:41,085 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:41,085 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:55:41,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:41,085 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 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:41,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:41,095 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:55:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:41,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 20:55:41,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:41,648 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 286 proven. 61 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:41,648 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:41,960 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 286 proven. 61 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:41,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:41,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 52 [2019-09-03 20:55:41,963 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:41,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 20:55:41,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 20:55:41,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=2139, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:55:41,964 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 52 states. [2019-09-03 20:55:43,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:43,602 INFO L93 Difference]: Finished difference Result 751 states and 944 transitions. [2019-09-03 20:55:43,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-03 20:55:43,602 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 120 [2019-09-03 20:55:43,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:43,604 INFO L225 Difference]: With dead ends: 751 [2019-09-03 20:55:43,604 INFO L226 Difference]: Without dead ends: 710 [2019-09-03 20:55:43,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 192 SyntacticMatches, 30 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5917 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2628, Invalid=12134, Unknown=0, NotChecked=0, Total=14762 [2019-09-03 20:55:43,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-09-03 20:55:43,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 150. [2019-09-03 20:55:43,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 20:55:43,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-03 20:55:43,612 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-03 20:55:43,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:43,612 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-03 20:55:43,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 20:55:43,612 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-03 20:55:43,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 20:55:43,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:43,612 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:43,613 INFO L418 AbstractCegarLoop]: === Iteration 116 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:43,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:43,613 INFO L82 PathProgramCache]: Analyzing trace with hash -2115771185, now seen corresponding path program 77 times [2019-09-03 20:55:43,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:43,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:43,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:43,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:43,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:43,970 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 286 proven. 69 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:43,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:43,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:43,970 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:43,970 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:55:43,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:43,971 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 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:43,980 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:55:43,980 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:55:44,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-03 20:55:44,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:44,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 20:55:44,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:44,509 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 286 proven. 69 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:44,509 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:44,824 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 286 proven. 69 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:44,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:44,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 51 [2019-09-03 20:55:44,827 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:44,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 20:55:44,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 20:55:44,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=511, Invalid=2039, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 20:55:44,828 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 51 states. [2019-09-03 20:55:46,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:46,375 INFO L93 Difference]: Finished difference Result 796 states and 1004 transitions. [2019-09-03 20:55:46,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-03 20:55:46,376 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 120 [2019-09-03 20:55:46,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:46,378 INFO L225 Difference]: With dead ends: 796 [2019-09-03 20:55:46,378 INFO L226 Difference]: Without dead ends: 755 [2019-09-03 20:55:46,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 193 SyntacticMatches, 30 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5109 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2308, Invalid=10574, Unknown=0, NotChecked=0, Total=12882 [2019-09-03 20:55:46,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-09-03 20:55:46,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 150. [2019-09-03 20:55:46,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 20:55:46,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-03 20:55:46,386 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-03 20:55:46,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:46,386 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-03 20:55:46,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 20:55:46,386 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-03 20:55:46,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 20:55:46,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:46,387 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:46,387 INFO L418 AbstractCegarLoop]: === Iteration 117 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:46,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:46,387 INFO L82 PathProgramCache]: Analyzing trace with hash 2137630128, now seen corresponding path program 78 times [2019-09-03 20:55:46,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:46,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:46,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:46,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:46,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:46,741 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 286 proven. 79 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:46,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:46,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:46,742 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:46,742 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:55:46,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:46,742 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 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:46,752 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:46,752 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:46,787 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:46,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:46,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 20:55:46,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:47,251 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 286 proven. 79 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:47,251 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:47,565 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 286 proven. 79 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:47,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:47,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 50 [2019-09-03 20:55:47,568 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:47,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-03 20:55:47,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-03 20:55:47,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=1937, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 20:55:47,569 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 50 states. [2019-09-03 20:55:48,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:48,891 INFO L93 Difference]: Finished difference Result 840 states and 1063 transitions. [2019-09-03 20:55:48,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-03 20:55:48,891 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 120 [2019-09-03 20:55:48,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:48,894 INFO L225 Difference]: With dead ends: 840 [2019-09-03 20:55:48,894 INFO L226 Difference]: Without dead ends: 799 [2019-09-03 20:55:48,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 194 SyntacticMatches, 30 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4171 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1953, Invalid=8759, Unknown=0, NotChecked=0, Total=10712 [2019-09-03 20:55:48,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-09-03 20:55:48,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 150. [2019-09-03 20:55:48,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 20:55:48,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-03 20:55:48,908 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-03 20:55:48,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:48,909 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-03 20:55:48,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-03 20:55:48,909 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-03 20:55:48,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 20:55:48,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:48,910 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:48,910 INFO L418 AbstractCegarLoop]: === Iteration 118 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:48,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:48,911 INFO L82 PathProgramCache]: Analyzing trace with hash -911752017, now seen corresponding path program 13 times [2019-09-03 20:55:48,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:48,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:48,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:48,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:48,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:49,370 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 286 proven. 91 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:49,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:49,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:49,370 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:49,370 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:55:49,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:49,371 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 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:55:49,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:49,383 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:49,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 20:55:49,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:49,896 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 286 proven. 91 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:49,896 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:50,216 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 286 proven. 91 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:50,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:50,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 49 [2019-09-03 20:55:50,219 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:50,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 20:55:50,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 20:55:50,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=1833, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 20:55:50,220 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 49 states. [2019-09-03 20:55:51,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:51,403 INFO L93 Difference]: Finished difference Result 886 states and 1125 transitions. [2019-09-03 20:55:51,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 20:55:51,404 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 120 [2019-09-03 20:55:51,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:51,407 INFO L225 Difference]: With dead ends: 886 [2019-09-03 20:55:51,407 INFO L226 Difference]: Without dead ends: 845 [2019-09-03 20:55:51,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 195 SyntacticMatches, 30 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3153 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1593, Invalid=6779, Unknown=0, NotChecked=0, Total=8372 [2019-09-03 20:55:51,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2019-09-03 20:55:51,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 152. [2019-09-03 20:55:51,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-03 20:55:51,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 168 transitions. [2019-09-03 20:55:51,420 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 168 transitions. Word has length 120 [2019-09-03 20:55:51,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:51,420 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 168 transitions. [2019-09-03 20:55:51,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 20:55:51,420 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 168 transitions. [2019-09-03 20:55:51,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-03 20:55:51,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:51,421 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:51,421 INFO L418 AbstractCegarLoop]: === Iteration 119 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:51,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:51,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1106115448, now seen corresponding path program 26 times [2019-09-03 20:55:51,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:51,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:51,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:51,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:51,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:51,596 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 131 proven. 260 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:51,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:51,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:51,597 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:51,597 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:55:51,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:51,597 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 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:55:51,613 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:55:51,614 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:51,661 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-03 20:55:51,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:51,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 20:55:51,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:51,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:51,691 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 131 proven. 260 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:51,691 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:51,898 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 131 proven. 260 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:55:51,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:51,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 21 [2019-09-03 20:55:51,901 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:51,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 20:55:51,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 20:55:51,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:55:51,902 INFO L87 Difference]: Start difference. First operand 152 states and 168 transitions. Second operand 21 states. [2019-09-03 20:55:52,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:52,112 INFO L93 Difference]: Finished difference Result 163 states and 180 transitions. [2019-09-03 20:55:52,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 20:55:52,112 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 121 [2019-09-03 20:55:52,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:52,113 INFO L225 Difference]: With dead ends: 163 [2019-09-03 20:55:52,114 INFO L226 Difference]: Without dead ends: 163 [2019-09-03 20:55:52,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 226 SyntacticMatches, 28 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=310, Unknown=0, NotChecked=0, Total=462 [2019-09-03 20:55:52,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-03 20:55:52,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2019-09-03 20:55:52,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-03 20:55:52,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 175 transitions. [2019-09-03 20:55:52,117 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 175 transitions. Word has length 121 [2019-09-03 20:55:52,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:52,118 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 175 transitions. [2019-09-03 20:55:52,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 20:55:52,118 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 175 transitions. [2019-09-03 20:55:52,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 20:55:52,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:52,119 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:52,119 INFO L418 AbstractCegarLoop]: === Iteration 120 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:52,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:52,119 INFO L82 PathProgramCache]: Analyzing trace with hash 403015727, now seen corresponding path program 27 times [2019-09-03 20:55:52,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:52,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:52,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:52,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:52,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:52,605 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 329 proven. 105 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:55:52,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:52,605 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:52,605 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:52,605 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:55:52,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:52,605 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 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:52,616 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:52,616 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:52,656 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:52,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:52,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 20:55:52,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:53,439 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 329 proven. 105 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:55:53,440 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:53,816 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 329 proven. 105 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:55:53,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:53,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 66 [2019-09-03 20:55:53,819 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:53,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-03 20:55:53,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-03 20:55:53,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=851, Invalid=3439, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 20:55:53,820 INFO L87 Difference]: Start difference. First operand 159 states and 175 transitions. Second operand 66 states. [2019-09-03 20:55:54,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:54,933 INFO L93 Difference]: Finished difference Result 263 states and 309 transitions. [2019-09-03 20:55:54,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 20:55:54,934 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2019-09-03 20:55:54,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:54,935 INFO L225 Difference]: With dead ends: 263 [2019-09-03 20:55:54,935 INFO L226 Difference]: Without dead ends: 219 [2019-09-03 20:55:54,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 194 SyntacticMatches, 32 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4661 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1795, Invalid=7711, Unknown=0, NotChecked=0, Total=9506 [2019-09-03 20:55:54,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-03 20:55:54,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 160. [2019-09-03 20:55:54,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 20:55:54,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-03 20:55:54,939 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-03 20:55:54,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:54,940 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-03 20:55:54,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-03 20:55:54,940 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-03 20:55:54,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 20:55:54,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:54,941 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:54,941 INFO L418 AbstractCegarLoop]: === Iteration 121 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:54,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:54,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1348809134, now seen corresponding path program 79 times [2019-09-03 20:55:54,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:54,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:54,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:54,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:54,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:55,373 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 329 proven. 92 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:55:55,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:55,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:55,373 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:55,373 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:55:55,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:55,373 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 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:55,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:55,383 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:55:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:55,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 20:55:55,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:56,166 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 329 proven. 92 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:55:56,167 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:56,545 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 329 proven. 92 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:55:56,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:56,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 65 [2019-09-03 20:55:56,548 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:56,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-03 20:55:56,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-03 20:55:56,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=806, Invalid=3354, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 20:55:56,549 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 65 states. [2019-09-03 20:55:58,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:58,227 INFO L93 Difference]: Finished difference Result 322 states and 384 transitions. [2019-09-03 20:55:58,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-03 20:55:58,227 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2019-09-03 20:55:58,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:58,228 INFO L225 Difference]: With dead ends: 322 [2019-09-03 20:55:58,228 INFO L226 Difference]: Without dead ends: 278 [2019-09-03 20:55:58,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 195 SyntacticMatches, 32 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5535 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2211, Invalid=9999, Unknown=0, NotChecked=0, Total=12210 [2019-09-03 20:55:58,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-03 20:55:58,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 160. [2019-09-03 20:55:58,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 20:55:58,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-03 20:55:58,232 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-03 20:55:58,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:58,232 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-03 20:55:58,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-03 20:55:58,232 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-03 20:55:58,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 20:55:58,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:58,233 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:58,233 INFO L418 AbstractCegarLoop]: === Iteration 122 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:58,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:58,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1656413263, now seen corresponding path program 80 times [2019-09-03 20:55:58,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:58,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:58,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:58,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:58,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:58,642 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 329 proven. 81 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:55:58,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:58,642 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:58,642 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:58,642 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:55:58,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:58,642 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 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:58,651 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:55:58,652 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:55:58,698 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-03 20:55:58,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:58,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 20:55:58,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:59,452 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 329 proven. 81 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:55:59,452 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:59,817 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 329 proven. 81 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:55:59,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:59,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 64 [2019-09-03 20:55:59,820 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:59,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-03 20:55:59,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-03 20:55:59,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=765, Invalid=3267, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 20:55:59,822 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 64 states. [2019-09-03 20:56:01,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:01,748 INFO L93 Difference]: Finished difference Result 380 states and 458 transitions. [2019-09-03 20:56:01,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-03 20:56:01,749 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 128 [2019-09-03 20:56:01,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:01,750 INFO L225 Difference]: With dead ends: 380 [2019-09-03 20:56:01,750 INFO L226 Difference]: Without dead ends: 336 [2019-09-03 20:56:01,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 196 SyntacticMatches, 32 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6408 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2629, Invalid=12133, Unknown=0, NotChecked=0, Total=14762 [2019-09-03 20:56:01,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-09-03 20:56:01,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 160. [2019-09-03 20:56:01,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 20:56:01,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-03 20:56:01,755 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-03 20:56:01,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:01,755 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-03 20:56:01,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-03 20:56:01,755 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-03 20:56:01,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 20:56:01,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:01,756 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:01,756 INFO L418 AbstractCegarLoop]: === Iteration 123 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:01,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:01,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1381705330, now seen corresponding path program 81 times [2019-09-03 20:56:01,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:01,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:01,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:01,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:01,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:02,145 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 329 proven. 72 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:02,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:02,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:02,145 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:02,145 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:56:02,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:02,145 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 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:02,164 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:56:02,164 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:56:02,203 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:56:02,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:02,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 20:56:02,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:02,927 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 329 proven. 72 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:02,927 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:03,287 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 329 proven. 72 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:03,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:03,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 63 [2019-09-03 20:56:03,290 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:03,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-03 20:56:03,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-03 20:56:03,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=3178, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 20:56:03,292 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 63 states. [2019-09-03 20:56:05,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:05,012 INFO L93 Difference]: Finished difference Result 437 states and 531 transitions. [2019-09-03 20:56:05,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-03 20:56:05,013 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 128 [2019-09-03 20:56:05,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:05,014 INFO L225 Difference]: With dead ends: 437 [2019-09-03 20:56:05,014 INFO L226 Difference]: Without dead ends: 393 [2019-09-03 20:56:05,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 197 SyntacticMatches, 32 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7212 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3016, Invalid=14014, Unknown=0, NotChecked=0, Total=17030 [2019-09-03 20:56:05,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-09-03 20:56:05,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 160. [2019-09-03 20:56:05,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 20:56:05,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-03 20:56:05,019 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-03 20:56:05,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:05,020 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-03 20:56:05,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-03 20:56:05,020 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-03 20:56:05,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 20:56:05,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:05,021 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:05,021 INFO L418 AbstractCegarLoop]: === Iteration 124 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:05,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:05,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1291237487, now seen corresponding path program 82 times [2019-09-03 20:56:05,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:05,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:05,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:05,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:05,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:05,421 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 329 proven. 65 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:05,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:05,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:05,421 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:05,421 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:56:05,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:05,422 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 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:05,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:05,431 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:56:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:05,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 20:56:05,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:06,162 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 329 proven. 65 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:06,163 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:06,523 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 329 proven. 65 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:06,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:06,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 62 [2019-09-03 20:56:06,526 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:06,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-03 20:56:06,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-03 20:56:06,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=3087, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 20:56:06,527 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 62 states. [2019-09-03 20:56:08,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:08,623 INFO L93 Difference]: Finished difference Result 493 states and 603 transitions. [2019-09-03 20:56:08,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-03 20:56:08,624 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 128 [2019-09-03 20:56:08,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:08,625 INFO L225 Difference]: With dead ends: 493 [2019-09-03 20:56:08,626 INFO L226 Difference]: Without dead ends: 449 [2019-09-03 20:56:08,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 198 SyntacticMatches, 32 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7891 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3345, Invalid=15561, Unknown=0, NotChecked=0, Total=18906 [2019-09-03 20:56:08,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-09-03 20:56:08,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 160. [2019-09-03 20:56:08,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 20:56:08,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-03 20:56:08,632 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-03 20:56:08,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:08,633 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-03 20:56:08,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-03 20:56:08,633 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-03 20:56:08,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 20:56:08,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:08,634 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 9, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:08,634 INFO L418 AbstractCegarLoop]: === Iteration 125 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:08,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:08,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1670579858, now seen corresponding path program 83 times [2019-09-03 20:56:08,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:08,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:08,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:08,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:08,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:09,102 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 329 proven. 60 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:09,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:09,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:09,103 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:09,103 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:56:09,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:09,103 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 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:09,113 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:09,113 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:56:09,161 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-03 20:56:09,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:09,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 20:56:09,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:09,832 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 329 proven. 60 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:09,833 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:10,205 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 329 proven. 60 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:10,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:10,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 61 [2019-09-03 20:56:10,208 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:10,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-03 20:56:10,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-03 20:56:10,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=2994, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 20:56:10,209 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 61 states. [2019-09-03 20:56:12,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:12,239 INFO L93 Difference]: Finished difference Result 548 states and 674 transitions. [2019-09-03 20:56:12,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-03 20:56:12,239 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 128 [2019-09-03 20:56:12,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:12,241 INFO L225 Difference]: With dead ends: 548 [2019-09-03 20:56:12,241 INFO L226 Difference]: Without dead ends: 504 [2019-09-03 20:56:12,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 199 SyntacticMatches, 32 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8401 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3595, Invalid=16711, Unknown=0, NotChecked=0, Total=20306 [2019-09-03 20:56:12,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-03 20:56:12,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 160. [2019-09-03 20:56:12,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 20:56:12,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-03 20:56:12,247 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-03 20:56:12,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:12,247 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-03 20:56:12,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-03 20:56:12,247 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-03 20:56:12,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 20:56:12,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:12,248 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:12,248 INFO L418 AbstractCegarLoop]: === Iteration 126 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:12,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:12,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1766122353, now seen corresponding path program 84 times [2019-09-03 20:56:12,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:12,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:12,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:12,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:12,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:12,636 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 329 proven. 57 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:12,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:12,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:12,636 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:12,636 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:56:12,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:12,637 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 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:12,647 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:56:12,647 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:56:12,685 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:56:12,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:12,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 20:56:12,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:13,348 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 329 proven. 57 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:13,349 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:13,717 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 329 proven. 57 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:13,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:13,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 60 [2019-09-03 20:56:13,720 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:13,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-03 20:56:13,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-03 20:56:13,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=641, Invalid=2899, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 20:56:13,721 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 60 states. [2019-09-03 20:56:16,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:16,035 INFO L93 Difference]: Finished difference Result 602 states and 744 transitions. [2019-09-03 20:56:16,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-03 20:56:16,035 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 128 [2019-09-03 20:56:16,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:16,037 INFO L225 Difference]: With dead ends: 602 [2019-09-03 20:56:16,037 INFO L226 Difference]: Without dead ends: 558 [2019-09-03 20:56:16,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 200 SyntacticMatches, 32 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8710 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3751, Invalid=17419, Unknown=0, NotChecked=0, Total=21170 [2019-09-03 20:56:16,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-09-03 20:56:16,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 160. [2019-09-03 20:56:16,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 20:56:16,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-03 20:56:16,043 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-03 20:56:16,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:16,043 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-03 20:56:16,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-03 20:56:16,043 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-03 20:56:16,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 20:56:16,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:16,044 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:16,044 INFO L418 AbstractCegarLoop]: === Iteration 127 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:16,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:16,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1417384270, now seen corresponding path program 85 times [2019-09-03 20:56:16,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:16,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:16,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:16,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:16,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:16,559 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 329 proven. 56 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:16,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:16,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:16,560 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:16,560 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:56:16,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:16,560 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 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:16,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:16,571 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:56:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:16,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 20:56:16,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:17,269 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 329 proven. 56 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:17,270 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:17,624 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 329 proven. 56 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:17,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:17,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 59 [2019-09-03 20:56:17,626 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:17,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-03 20:56:17,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-03 20:56:17,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=620, Invalid=2802, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 20:56:17,628 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 59 states. [2019-09-03 20:56:19,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:19,872 INFO L93 Difference]: Finished difference Result 655 states and 813 transitions. [2019-09-03 20:56:19,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-03 20:56:19,873 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 128 [2019-09-03 20:56:19,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:19,874 INFO L225 Difference]: With dead ends: 655 [2019-09-03 20:56:19,874 INFO L226 Difference]: Without dead ends: 611 [2019-09-03 20:56:19,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 201 SyntacticMatches, 32 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8798 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3804, Invalid=17658, Unknown=0, NotChecked=0, Total=21462 [2019-09-03 20:56:19,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-09-03 20:56:19,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 160. [2019-09-03 20:56:19,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 20:56:19,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-03 20:56:19,881 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-03 20:56:19,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:19,881 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-03 20:56:19,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-03 20:56:19,882 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-03 20:56:19,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 20:56:19,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:19,882 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:19,883 INFO L418 AbstractCegarLoop]: === Iteration 128 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:19,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:19,883 INFO L82 PathProgramCache]: Analyzing trace with hash 411699375, now seen corresponding path program 86 times [2019-09-03 20:56:19,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:19,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:19,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:19,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:19,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:20,274 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 329 proven. 57 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:20,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:20,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:20,274 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:20,274 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:56:20,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:20,275 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 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:20,285 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:20,285 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:56:20,331 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-03 20:56:20,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:20,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 20:56:20,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:20,972 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 329 proven. 57 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:20,972 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:21,333 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 329 proven. 57 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:21,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:21,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 58 [2019-09-03 20:56:21,337 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:21,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-03 20:56:21,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-03 20:56:21,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=603, Invalid=2703, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 20:56:21,338 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 58 states. [2019-09-03 20:56:23,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:23,617 INFO L93 Difference]: Finished difference Result 707 states and 881 transitions. [2019-09-03 20:56:23,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-03 20:56:23,618 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 128 [2019-09-03 20:56:23,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:23,619 INFO L225 Difference]: With dead ends: 707 [2019-09-03 20:56:23,620 INFO L226 Difference]: Without dead ends: 663 [2019-09-03 20:56:23,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 202 SyntacticMatches, 32 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8656 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3751, Invalid=17419, Unknown=0, NotChecked=0, Total=21170 [2019-09-03 20:56:23,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-09-03 20:56:23,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 160. [2019-09-03 20:56:23,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 20:56:23,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-03 20:56:23,628 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-03 20:56:23,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:23,628 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-03 20:56:23,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-03 20:56:23,628 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-03 20:56:23,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 20:56:23,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:23,629 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 9, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:23,629 INFO L418 AbstractCegarLoop]: === Iteration 129 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:23,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:23,629 INFO L82 PathProgramCache]: Analyzing trace with hash -452026066, now seen corresponding path program 87 times [2019-09-03 20:56:23,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:23,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:23,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:23,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:23,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:24,029 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 329 proven. 60 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:24,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:24,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:24,029 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:24,030 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:56:24,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:24,030 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 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:24,043 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:56:24,043 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:56:24,080 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:56:24,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:24,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 20:56:24,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:24,769 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 329 proven. 60 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:24,770 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:25,116 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 329 proven. 60 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:25,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:25,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 57 [2019-09-03 20:56:25,120 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:25,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-03 20:56:25,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-03 20:56:25,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=590, Invalid=2602, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 20:56:25,121 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 57 states. [2019-09-03 20:56:27,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:27,480 INFO L93 Difference]: Finished difference Result 758 states and 948 transitions. [2019-09-03 20:56:27,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-03 20:56:27,481 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 128 [2019-09-03 20:56:27,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:27,482 INFO L225 Difference]: With dead ends: 758 [2019-09-03 20:56:27,483 INFO L226 Difference]: Without dead ends: 714 [2019-09-03 20:56:27,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 203 SyntacticMatches, 32 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8281 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3595, Invalid=16711, Unknown=0, NotChecked=0, Total=20306 [2019-09-03 20:56:27,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-09-03 20:56:27,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 160. [2019-09-03 20:56:27,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 20:56:27,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-03 20:56:27,490 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-03 20:56:27,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:27,490 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-03 20:56:27,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-03 20:56:27,490 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-03 20:56:27,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 20:56:27,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:27,491 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:27,491 INFO L418 AbstractCegarLoop]: === Iteration 130 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:27,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:27,491 INFO L82 PathProgramCache]: Analyzing trace with hash -479888177, now seen corresponding path program 88 times [2019-09-03 20:56:27,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:27,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:27,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:27,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:27,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:27,893 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 329 proven. 65 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:27,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:27,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:27,894 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:27,894 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:56:27,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:27,894 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 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:27,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:27,909 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:56:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:27,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 20:56:27,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:28,529 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 329 proven. 65 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:28,529 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:28,896 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 329 proven. 65 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:28,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:28,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 56 [2019-09-03 20:56:28,900 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:28,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-03 20:56:28,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-03 20:56:28,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=581, Invalid=2499, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 20:56:28,901 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 56 states. [2019-09-03 20:56:31,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:31,124 INFO L93 Difference]: Finished difference Result 808 states and 1014 transitions. [2019-09-03 20:56:31,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-03 20:56:31,125 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 128 [2019-09-03 20:56:31,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:31,126 INFO L225 Difference]: With dead ends: 808 [2019-09-03 20:56:31,126 INFO L226 Difference]: Without dead ends: 764 [2019-09-03 20:56:31,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 204 SyntacticMatches, 32 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7681 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3345, Invalid=15561, Unknown=0, NotChecked=0, Total=18906 [2019-09-03 20:56:31,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-09-03 20:56:31,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 160. [2019-09-03 20:56:31,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 20:56:31,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-03 20:56:31,134 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-03 20:56:31,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:31,134 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-03 20:56:31,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-03 20:56:31,134 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-03 20:56:31,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 20:56:31,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:31,135 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:31,135 INFO L418 AbstractCegarLoop]: === Iteration 131 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:31,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:31,135 INFO L82 PathProgramCache]: Analyzing trace with hash 350497038, now seen corresponding path program 89 times [2019-09-03 20:56:31,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:31,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:31,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:31,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:31,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:31,503 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 329 proven. 72 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:31,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:31,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:31,503 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:31,503 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:56:31,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:31,504 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 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:31,514 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:31,514 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:56:31,563 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-03 20:56:31,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:31,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 20:56:31,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:32,117 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 329 proven. 72 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:32,118 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:32,463 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 329 proven. 72 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:32,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:32,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 55 [2019-09-03 20:56:32,468 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:32,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 20:56:32,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 20:56:32,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=576, Invalid=2394, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 20:56:32,469 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 55 states. [2019-09-03 20:56:34,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:34,305 INFO L93 Difference]: Finished difference Result 857 states and 1079 transitions. [2019-09-03 20:56:34,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-03 20:56:34,305 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 128 [2019-09-03 20:56:34,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:34,307 INFO L225 Difference]: With dead ends: 857 [2019-09-03 20:56:34,307 INFO L226 Difference]: Without dead ends: 813 [2019-09-03 20:56:34,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 205 SyntacticMatches, 32 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6876 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3016, Invalid=14014, Unknown=0, NotChecked=0, Total=17030 [2019-09-03 20:56:34,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2019-09-03 20:56:34,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 160. [2019-09-03 20:56:34,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 20:56:34,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-03 20:56:34,315 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-03 20:56:34,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:34,315 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-03 20:56:34,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 20:56:34,315 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-03 20:56:34,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 20:56:34,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:34,316 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:34,316 INFO L418 AbstractCegarLoop]: === Iteration 132 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:34,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:34,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1624209647, now seen corresponding path program 90 times [2019-09-03 20:56:34,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:34,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:34,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:34,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:34,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:34,703 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 329 proven. 81 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:34,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:34,704 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:34,704 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:34,704 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:56:34,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:34,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 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:34,715 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:56:34,716 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:56:34,756 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:56:34,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:34,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 20:56:34,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:35,317 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 329 proven. 81 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:35,317 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:35,670 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 329 proven. 81 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:35,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:35,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 54 [2019-09-03 20:56:35,673 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:35,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-03 20:56:35,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-03 20:56:35,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=2287, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 20:56:35,674 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 54 states. [2019-09-03 20:56:37,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:37,510 INFO L93 Difference]: Finished difference Result 905 states and 1143 transitions. [2019-09-03 20:56:37,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-03 20:56:37,511 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 128 [2019-09-03 20:56:37,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:37,512 INFO L225 Difference]: With dead ends: 905 [2019-09-03 20:56:37,512 INFO L226 Difference]: Without dead ends: 861 [2019-09-03 20:56:37,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 206 SyntacticMatches, 32 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5898 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2629, Invalid=12133, Unknown=0, NotChecked=0, Total=14762 [2019-09-03 20:56:37,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-09-03 20:56:37,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 160. [2019-09-03 20:56:37,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 20:56:37,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-03 20:56:37,523 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-03 20:56:37,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:37,523 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-03 20:56:37,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-03 20:56:37,524 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-03 20:56:37,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 20:56:37,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:37,524 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:37,524 INFO L418 AbstractCegarLoop]: === Iteration 133 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:37,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:37,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1111107822, now seen corresponding path program 91 times [2019-09-03 20:56:37,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:37,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:37,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:37,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:37,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:38,006 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 329 proven. 92 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:38,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:38,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:38,006 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:38,007 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:56:38,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:38,007 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 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:38,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:38,017 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:56:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:38,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 20:56:38,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:38,580 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 329 proven. 92 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:38,580 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:38,936 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 329 proven. 92 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:38,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:38,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 53 [2019-09-03 20:56:38,940 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:38,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-03 20:56:38,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-03 20:56:38,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=578, Invalid=2178, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 20:56:38,941 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 53 states. [2019-09-03 20:56:40,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:40,519 INFO L93 Difference]: Finished difference Result 952 states and 1206 transitions. [2019-09-03 20:56:40,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-03 20:56:40,520 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 128 [2019-09-03 20:56:40,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:40,522 INFO L225 Difference]: With dead ends: 952 [2019-09-03 20:56:40,522 INFO L226 Difference]: Without dead ends: 908 [2019-09-03 20:56:40,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 207 SyntacticMatches, 32 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4791 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2211, Invalid=9999, Unknown=0, NotChecked=0, Total=12210 [2019-09-03 20:56:40,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2019-09-03 20:56:40,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 160. [2019-09-03 20:56:40,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 20:56:40,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-03 20:56:40,531 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-03 20:56:40,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:40,531 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-03 20:56:40,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-03 20:56:40,531 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-03 20:56:40,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 20:56:40,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:40,532 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:40,532 INFO L418 AbstractCegarLoop]: === Iteration 134 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:40,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:40,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1925840143, now seen corresponding path program 14 times [2019-09-03 20:56:40,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:40,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:40,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:40,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:40,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:40,921 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 329 proven. 105 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:40,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:40,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:40,921 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:40,922 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:56:40,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:40,922 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 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:40,931 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:40,932 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:56:40,987 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-03 20:56:40,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:40,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 20:56:40,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:41,496 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 329 proven. 105 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:41,496 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:41,876 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 329 proven. 105 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:41,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:41,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 52 [2019-09-03 20:56:41,879 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:41,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 20:56:41,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 20:56:41,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=585, Invalid=2067, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:56:41,880 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 52 states. [2019-09-03 20:56:43,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:43,139 INFO L93 Difference]: Finished difference Result 1001 states and 1272 transitions. [2019-09-03 20:56:43,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-03 20:56:43,139 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 128 [2019-09-03 20:56:43,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:43,141 INFO L225 Difference]: With dead ends: 1001 [2019-09-03 20:56:43,141 INFO L226 Difference]: Without dead ends: 957 [2019-09-03 20:56:43,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 208 SyntacticMatches, 32 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3611 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1795, Invalid=7711, Unknown=0, NotChecked=0, Total=9506 [2019-09-03 20:56:43,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2019-09-03 20:56:43,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 162. [2019-09-03 20:56:43,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-03 20:56:43,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 179 transitions. [2019-09-03 20:56:43,151 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 179 transitions. Word has length 128 [2019-09-03 20:56:43,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:43,151 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 179 transitions. [2019-09-03 20:56:43,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 20:56:43,151 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 179 transitions. [2019-09-03 20:56:43,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-03 20:56:43,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:43,152 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:43,152 INFO L418 AbstractCegarLoop]: === Iteration 135 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:43,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:43,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1309179961, now seen corresponding path program 28 times [2019-09-03 20:56:43,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:43,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:43,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:43,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:43,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:43,310 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 148 proven. 301 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:43,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:43,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:43,311 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:43,311 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:56:43,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:43,311 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 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:43,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:43,321 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:56:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:43,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:56:43,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:43,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:43,393 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 148 proven. 301 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:43,393 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:43,623 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 148 proven. 301 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:56:43,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:43,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 22 [2019-09-03 20:56:43,626 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:43,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 20:56:43,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 20:56:43,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=299, Unknown=0, NotChecked=0, Total=462 [2019-09-03 20:56:43,627 INFO L87 Difference]: Start difference. First operand 162 states and 179 transitions. Second operand 22 states. [2019-09-03 20:56:43,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:43,903 INFO L93 Difference]: Finished difference Result 173 states and 191 transitions. [2019-09-03 20:56:43,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 20:56:43,903 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 129 [2019-09-03 20:56:43,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:43,904 INFO L225 Difference]: With dead ends: 173 [2019-09-03 20:56:43,904 INFO L226 Difference]: Without dead ends: 173 [2019-09-03 20:56:43,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 241 SyntacticMatches, 30 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:56:43,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-03 20:56:43,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 169. [2019-09-03 20:56:43,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-03 20:56:43,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 186 transitions. [2019-09-03 20:56:43,907 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 186 transitions. Word has length 129 [2019-09-03 20:56:43,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:43,907 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 186 transitions. [2019-09-03 20:56:43,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 20:56:43,907 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 186 transitions. [2019-09-03 20:56:43,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 20:56:43,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:43,908 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:43,908 INFO L418 AbstractCegarLoop]: === Iteration 136 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:43,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:43,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1451640816, now seen corresponding path program 29 times [2019-09-03 20:56:43,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:43,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:43,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:43,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:43,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:44,353 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 375 proven. 120 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:56:44,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:44,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:44,354 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:44,354 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:56:44,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:44,354 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 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:44,364 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:44,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:56:44,416 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-03 20:56:44,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:44,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:56:44,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:45,284 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 375 proven. 120 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:56:45,284 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:45,734 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 375 proven. 120 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:56:45,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:45,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 70 [2019-09-03 20:56:45,737 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:45,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-03 20:56:45,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-03 20:56:45,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=3875, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 20:56:45,741 INFO L87 Difference]: Start difference. First operand 169 states and 186 transitions. Second operand 70 states. [2019-09-03 20:56:47,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:47,191 INFO L93 Difference]: Finished difference Result 280 states and 329 transitions. [2019-09-03 20:56:47,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 20:56:47,192 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2019-09-03 20:56:47,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:47,193 INFO L225 Difference]: With dead ends: 280 [2019-09-03 20:56:47,193 INFO L226 Difference]: Without dead ends: 233 [2019-09-03 20:56:47,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 206 SyntacticMatches, 34 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5300 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2009, Invalid=8703, Unknown=0, NotChecked=0, Total=10712 [2019-09-03 20:56:47,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-09-03 20:56:47,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 170. [2019-09-03 20:56:47,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 20:56:47,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-03 20:56:47,198 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-03 20:56:47,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:47,198 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-03 20:56:47,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-03 20:56:47,198 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-03 20:56:47,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 20:56:47,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:47,199 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:47,199 INFO L418 AbstractCegarLoop]: === Iteration 137 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:47,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:47,199 INFO L82 PathProgramCache]: Analyzing trace with hash -837586289, now seen corresponding path program 92 times [2019-09-03 20:56:47,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:47,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:47,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:47,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:47,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:47,661 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 375 proven. 106 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:56:47,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:47,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:47,662 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:47,662 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:56:47,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:47,662 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 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:47,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:47,672 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:56:47,723 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-03 20:56:47,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:47,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:56:47,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:48,580 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 375 proven. 106 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:56:48,580 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:49,002 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 375 proven. 106 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:56:49,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:49,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 69 [2019-09-03 20:56:49,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:49,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-03 20:56:49,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-03 20:56:49,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=907, Invalid=3785, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 20:56:49,007 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 69 states. [2019-09-03 20:56:50,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:50,714 INFO L93 Difference]: Finished difference Result 343 states and 409 transitions. [2019-09-03 20:56:50,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 20:56:50,714 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2019-09-03 20:56:50,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:50,715 INFO L225 Difference]: With dead ends: 343 [2019-09-03 20:56:50,715 INFO L226 Difference]: Without dead ends: 296 [2019-09-03 20:56:50,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 207 SyntacticMatches, 34 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6312 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2485, Invalid=11321, Unknown=0, NotChecked=0, Total=13806 [2019-09-03 20:56:50,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-03 20:56:50,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 170. [2019-09-03 20:56:50,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 20:56:50,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-03 20:56:50,718 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-03 20:56:50,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:50,718 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-03 20:56:50,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-03 20:56:50,718 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-03 20:56:50,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 20:56:50,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:50,718 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:50,719 INFO L418 AbstractCegarLoop]: === Iteration 138 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:50,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:50,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1814621232, now seen corresponding path program 93 times [2019-09-03 20:56:50,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:50,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:50,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:50,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:50,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:51,171 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 375 proven. 94 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:56:51,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:51,172 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:51,172 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:51,172 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:56:51,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:51,172 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 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:51,182 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:56:51,182 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:56:51,224 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:56:51,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:51,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:56:51,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:52,043 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 375 proven. 94 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:56:52,043 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:52,448 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 375 proven. 94 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:56:52,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:52,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 68 [2019-09-03 20:56:52,451 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:52,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-03 20:56:52,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-03 20:56:52,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=3693, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 20:56:52,452 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 68 states. [2019-09-03 20:56:54,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:54,122 INFO L93 Difference]: Finished difference Result 405 states and 488 transitions. [2019-09-03 20:56:54,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-03 20:56:54,123 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 136 [2019-09-03 20:56:54,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:54,123 INFO L225 Difference]: With dead ends: 405 [2019-09-03 20:56:54,124 INFO L226 Difference]: Without dead ends: 358 [2019-09-03 20:56:54,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 208 SyntacticMatches, 34 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7338 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2971, Invalid=13799, Unknown=0, NotChecked=0, Total=16770 [2019-09-03 20:56:54,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-09-03 20:56:54,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 170. [2019-09-03 20:56:54,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 20:56:54,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-03 20:56:54,128 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-03 20:56:54,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:54,128 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-03 20:56:54,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-03 20:56:54,128 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-03 20:56:54,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 20:56:54,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:54,129 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:54,129 INFO L418 AbstractCegarLoop]: === Iteration 139 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:54,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:54,129 INFO L82 PathProgramCache]: Analyzing trace with hash -593675665, now seen corresponding path program 94 times [2019-09-03 20:56:54,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:54,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:54,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:54,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:54,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:54,568 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 375 proven. 84 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:56:54,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:54,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:54,568 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:54,568 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:56:54,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:54,568 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 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:54,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:54,578 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:56:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:54,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:56:54,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:55,444 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 375 proven. 84 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:56:55,445 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:55,893 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 375 proven. 84 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:56:55,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:55,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 67 [2019-09-03 20:56:55,896 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:55,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-03 20:56:55,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-03 20:56:55,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=3599, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 20:56:55,897 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 67 states. [2019-09-03 20:56:58,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:58,107 INFO L93 Difference]: Finished difference Result 466 states and 566 transitions. [2019-09-03 20:56:58,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-03 20:56:58,107 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 136 [2019-09-03 20:56:58,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:58,108 INFO L225 Difference]: With dead ends: 466 [2019-09-03 20:56:58,108 INFO L226 Difference]: Without dead ends: 419 [2019-09-03 20:56:58,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 209 SyntacticMatches, 34 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8304 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3431, Invalid=16029, Unknown=0, NotChecked=0, Total=19460 [2019-09-03 20:56:58,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-09-03 20:56:58,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 170. [2019-09-03 20:56:58,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 20:56:58,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-03 20:56:58,114 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-03 20:56:58,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:58,114 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-03 20:56:58,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-03 20:56:58,114 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-03 20:56:58,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 20:56:58,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:58,115 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:58,115 INFO L418 AbstractCegarLoop]: === Iteration 140 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:58,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:58,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1129752656, now seen corresponding path program 95 times [2019-09-03 20:56:58,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:58,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:58,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:58,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:58,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:58,677 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 375 proven. 76 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:56:58,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:58,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:58,677 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:58,677 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:56:58,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:58,677 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 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:58,688 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:58,688 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:56:58,739 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-03 20:56:58,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:58,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:56:58,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:59,523 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 375 proven. 76 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:56:59,523 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:59,929 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 375 proven. 76 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:56:59,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:59,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 66 [2019-09-03 20:56:59,949 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:59,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-03 20:56:59,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-03 20:56:59,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=3503, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 20:56:59,950 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 66 states. [2019-09-03 20:57:02,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:02,360 INFO L93 Difference]: Finished difference Result 526 states and 643 transitions. [2019-09-03 20:57:02,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-03 20:57:02,361 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 136 [2019-09-03 20:57:02,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:02,362 INFO L225 Difference]: With dead ends: 526 [2019-09-03 20:57:02,362 INFO L226 Difference]: Without dead ends: 479 [2019-09-03 20:57:02,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 210 SyntacticMatches, 34 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9148 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3835, Invalid=17921, Unknown=0, NotChecked=0, Total=21756 [2019-09-03 20:57:02,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-09-03 20:57:02,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 170. [2019-09-03 20:57:02,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 20:57:02,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-03 20:57:02,367 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-03 20:57:02,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:02,367 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-03 20:57:02,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-03 20:57:02,367 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-03 20:57:02,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 20:57:02,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:02,367 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:02,368 INFO L418 AbstractCegarLoop]: === Iteration 141 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:02,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:02,368 INFO L82 PathProgramCache]: Analyzing trace with hash -2001241521, now seen corresponding path program 96 times [2019-09-03 20:57:02,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:02,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:02,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:02,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:02,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:02,815 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 375 proven. 70 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:02,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:02,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:02,816 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:02,816 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:57:02,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:02,816 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 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:02,825 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:02,825 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:57:02,867 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:02,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:02,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:57:02,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:03,623 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 375 proven. 70 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:03,623 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:04,024 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 375 proven. 70 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:04,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:04,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 65 [2019-09-03 20:57:04,027 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:04,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-03 20:57:04,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-03 20:57:04,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=755, Invalid=3405, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 20:57:04,028 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 65 states. [2019-09-03 20:57:06,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:06,128 INFO L93 Difference]: Finished difference Result 585 states and 719 transitions. [2019-09-03 20:57:06,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-03 20:57:06,129 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 136 [2019-09-03 20:57:06,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:06,130 INFO L225 Difference]: With dead ends: 585 [2019-09-03 20:57:06,130 INFO L226 Difference]: Without dead ends: 538 [2019-09-03 20:57:06,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 211 SyntacticMatches, 34 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9820 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4159, Invalid=19403, Unknown=0, NotChecked=0, Total=23562 [2019-09-03 20:57:06,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-09-03 20:57:06,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 170. [2019-09-03 20:57:06,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 20:57:06,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-03 20:57:06,136 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-03 20:57:06,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:06,136 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-03 20:57:06,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-03 20:57:06,136 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-03 20:57:06,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 20:57:06,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:06,137 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:06,137 INFO L418 AbstractCegarLoop]: === Iteration 142 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:06,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:06,137 INFO L82 PathProgramCache]: Analyzing trace with hash -855315344, now seen corresponding path program 97 times [2019-09-03 20:57:06,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:06,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:06,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:06,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:06,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:06,581 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 375 proven. 66 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:06,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:06,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:06,581 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:06,581 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:57:06,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:06,581 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 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:06,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:06,591 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:06,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:57:06,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:07,386 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 375 proven. 66 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:07,386 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:07,805 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 375 proven. 66 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:07,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:07,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 64 [2019-09-03 20:57:07,808 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:07,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-03 20:57:07,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-03 20:57:07,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=727, Invalid=3305, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 20:57:07,809 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 64 states. [2019-09-03 20:57:10,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:10,221 INFO L93 Difference]: Finished difference Result 643 states and 794 transitions. [2019-09-03 20:57:10,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-03 20:57:10,221 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 136 [2019-09-03 20:57:10,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:10,222 INFO L225 Difference]: With dead ends: 643 [2019-09-03 20:57:10,222 INFO L226 Difference]: Without dead ends: 596 [2019-09-03 20:57:10,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 212 SyntacticMatches, 34 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10282 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4385, Invalid=20421, Unknown=0, NotChecked=0, Total=24806 [2019-09-03 20:57:10,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-09-03 20:57:10,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 170. [2019-09-03 20:57:10,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 20:57:10,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-03 20:57:10,227 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-03 20:57:10,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:10,227 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-03 20:57:10,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-03 20:57:10,228 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-03 20:57:10,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 20:57:10,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:10,228 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:10,228 INFO L418 AbstractCegarLoop]: === Iteration 143 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:10,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:10,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1814049327, now seen corresponding path program 98 times [2019-09-03 20:57:10,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:10,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:10,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:10,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:10,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:10,662 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 375 proven. 64 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:10,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:10,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:10,662 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:10,662 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:57:10,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:10,662 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 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:10,674 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:10,674 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:57:10,725 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-03 20:57:10,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:10,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:57:10,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:11,441 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 375 proven. 64 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:11,441 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:11,855 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 375 proven. 64 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:11,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:11,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 63 [2019-09-03 20:57:11,859 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:11,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-03 20:57:11,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-03 20:57:11,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=3203, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 20:57:11,859 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 63 states. [2019-09-03 20:57:14,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:14,661 INFO L93 Difference]: Finished difference Result 700 states and 868 transitions. [2019-09-03 20:57:14,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-03 20:57:14,662 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 136 [2019-09-03 20:57:14,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:14,663 INFO L225 Difference]: With dead ends: 700 [2019-09-03 20:57:14,663 INFO L226 Difference]: Without dead ends: 653 [2019-09-03 20:57:14,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 213 SyntacticMatches, 34 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10508 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4501, Invalid=20939, Unknown=0, NotChecked=0, Total=25440 [2019-09-03 20:57:14,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-09-03 20:57:14,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 170. [2019-09-03 20:57:14,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 20:57:14,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-03 20:57:14,669 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-03 20:57:14,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:14,669 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-03 20:57:14,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-03 20:57:14,669 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-03 20:57:14,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 20:57:14,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:14,670 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:14,670 INFO L418 AbstractCegarLoop]: === Iteration 144 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:14,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:14,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1068873872, now seen corresponding path program 99 times [2019-09-03 20:57:14,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:14,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:14,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:14,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:14,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:15,112 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 375 proven. 64 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:15,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:15,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:15,113 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:15,113 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:57:15,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:15,113 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 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:15,123 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:15,123 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:57:15,165 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:15,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:15,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:57:15,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:15,854 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 375 proven. 64 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:15,854 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:16,269 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 375 proven. 64 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:16,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:16,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 62 [2019-09-03 20:57:16,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:16,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-03 20:57:16,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-03 20:57:16,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=3099, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 20:57:16,273 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 62 states. [2019-09-03 20:57:18,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:18,590 INFO L93 Difference]: Finished difference Result 756 states and 941 transitions. [2019-09-03 20:57:18,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-09-03 20:57:18,591 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 136 [2019-09-03 20:57:18,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:18,592 INFO L225 Difference]: With dead ends: 756 [2019-09-03 20:57:18,592 INFO L226 Difference]: Without dead ends: 709 [2019-09-03 20:57:18,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 214 SyntacticMatches, 34 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10484 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4501, Invalid=20939, Unknown=0, NotChecked=0, Total=25440 [2019-09-03 20:57:18,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2019-09-03 20:57:18,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 170. [2019-09-03 20:57:18,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 20:57:18,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-03 20:57:18,599 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-03 20:57:18,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:18,599 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-03 20:57:18,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-03 20:57:18,599 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-03 20:57:18,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 20:57:18,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:18,600 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:18,600 INFO L418 AbstractCegarLoop]: === Iteration 145 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:18,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:18,600 INFO L82 PathProgramCache]: Analyzing trace with hash 2014667279, now seen corresponding path program 100 times [2019-09-03 20:57:18,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:18,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:18,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:18,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:18,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:19,054 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 375 proven. 66 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:19,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:19,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:19,055 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:19,055 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:57:19,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:19,055 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 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:19,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:19,066 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:19,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:57:19,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:19,812 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 375 proven. 66 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:19,812 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:20,216 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 375 proven. 66 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:20,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:20,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 61 [2019-09-03 20:57:20,219 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:20,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-03 20:57:20,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-03 20:57:20,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=667, Invalid=2993, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 20:57:20,220 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 61 states. [2019-09-03 20:57:23,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:23,021 INFO L93 Difference]: Finished difference Result 811 states and 1013 transitions. [2019-09-03 20:57:23,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-09-03 20:57:23,022 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 136 [2019-09-03 20:57:23,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:23,023 INFO L225 Difference]: With dead ends: 811 [2019-09-03 20:57:23,023 INFO L226 Difference]: Without dead ends: 764 [2019-09-03 20:57:23,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 215 SyntacticMatches, 34 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10204 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4385, Invalid=20421, Unknown=0, NotChecked=0, Total=24806 [2019-09-03 20:57:23,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-09-03 20:57:23,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 170. [2019-09-03 20:57:23,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 20:57:23,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-03 20:57:23,035 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-03 20:57:23,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:23,035 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-03 20:57:23,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-03 20:57:23,035 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-03 20:57:23,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 20:57:23,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:23,036 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:23,036 INFO L418 AbstractCegarLoop]: === Iteration 146 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:23,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:23,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1972695888, now seen corresponding path program 101 times [2019-09-03 20:57:23,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:23,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:23,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:23,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:23,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:23,514 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 375 proven. 70 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:23,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:23,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:23,514 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:23,514 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:57:23,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:23,514 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 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:23,524 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:23,525 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:57:23,572 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-03 20:57:23,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:23,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:57:23,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:24,241 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 375 proven. 70 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:24,241 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:24,685 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 375 proven. 70 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:24,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:24,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 60 [2019-09-03 20:57:24,688 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:24,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-03 20:57:24,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-03 20:57:24,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=655, Invalid=2885, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 20:57:24,689 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 60 states. [2019-09-03 20:57:27,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:27,336 INFO L93 Difference]: Finished difference Result 865 states and 1084 transitions. [2019-09-03 20:57:27,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-03 20:57:27,337 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 136 [2019-09-03 20:57:27,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:27,339 INFO L225 Difference]: With dead ends: 865 [2019-09-03 20:57:27,339 INFO L226 Difference]: Without dead ends: 818 [2019-09-03 20:57:27,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 216 SyntacticMatches, 34 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9670 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4159, Invalid=19403, Unknown=0, NotChecked=0, Total=23562 [2019-09-03 20:57:27,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-09-03 20:57:27,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 170. [2019-09-03 20:57:27,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 20:57:27,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-03 20:57:27,347 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-03 20:57:27,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:27,347 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-03 20:57:27,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-03 20:57:27,347 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-03 20:57:27,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 20:57:27,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:27,347 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:27,348 INFO L418 AbstractCegarLoop]: === Iteration 147 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:27,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:27,348 INFO L82 PathProgramCache]: Analyzing trace with hash -715847185, now seen corresponding path program 102 times [2019-09-03 20:57:27,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:27,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:27,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:27,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:27,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:27,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:27,775 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 375 proven. 76 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:27,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:27,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:27,775 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:27,775 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:57:27,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:27,776 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 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:27,785 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:27,786 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:57:27,828 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:27,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:27,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:57:27,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:28,483 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 375 proven. 76 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:28,483 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:28,896 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 375 proven. 76 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:28,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:28,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 59 [2019-09-03 20:57:28,899 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:28,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-03 20:57:28,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-03 20:57:28,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=647, Invalid=2775, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 20:57:28,900 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 59 states. [2019-09-03 20:57:31,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:31,311 INFO L93 Difference]: Finished difference Result 918 states and 1154 transitions. [2019-09-03 20:57:31,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-03 20:57:31,311 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 136 [2019-09-03 20:57:31,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:31,314 INFO L225 Difference]: With dead ends: 918 [2019-09-03 20:57:31,314 INFO L226 Difference]: Without dead ends: 871 [2019-09-03 20:57:31,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 217 SyntacticMatches, 34 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8896 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3835, Invalid=17921, Unknown=0, NotChecked=0, Total=21756 [2019-09-03 20:57:31,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2019-09-03 20:57:31,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 170. [2019-09-03 20:57:31,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 20:57:31,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-03 20:57:31,324 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-03 20:57:31,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:31,324 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-03 20:57:31,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-03 20:57:31,324 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-03 20:57:31,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 20:57:31,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:31,325 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:31,325 INFO L418 AbstractCegarLoop]: === Iteration 148 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:31,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:31,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1957095632, now seen corresponding path program 103 times [2019-09-03 20:57:31,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:31,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:31,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:31,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:31,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:31,773 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 375 proven. 84 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:31,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:31,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:31,774 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:31,774 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:57:31,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:31,774 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 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:31,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:31,785 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:31,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:57:31,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:32,461 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 375 proven. 84 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:32,461 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:32,849 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 375 proven. 84 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:32,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:32,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 58 [2019-09-03 20:57:32,852 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:32,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-03 20:57:32,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-03 20:57:32,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=643, Invalid=2663, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 20:57:32,853 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 58 states. [2019-09-03 20:57:35,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:35,096 INFO L93 Difference]: Finished difference Result 970 states and 1223 transitions. [2019-09-03 20:57:35,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-03 20:57:35,096 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 136 [2019-09-03 20:57:35,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:35,098 INFO L225 Difference]: With dead ends: 970 [2019-09-03 20:57:35,098 INFO L226 Difference]: Without dead ends: 923 [2019-09-03 20:57:35,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 218 SyntacticMatches, 34 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7908 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3431, Invalid=16029, Unknown=0, NotChecked=0, Total=19460 [2019-09-03 20:57:35,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-09-03 20:57:35,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 170. [2019-09-03 20:57:35,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 20:57:35,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-03 20:57:35,106 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-03 20:57:35,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:35,106 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-03 20:57:35,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-03 20:57:35,106 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-03 20:57:35,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 20:57:35,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:35,107 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:35,107 INFO L418 AbstractCegarLoop]: === Iteration 149 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:35,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:35,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1004721713, now seen corresponding path program 104 times [2019-09-03 20:57:35,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:35,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:35,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:35,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:35,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:35,542 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 375 proven. 94 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:35,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:35,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:35,543 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:35,543 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:57:35,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:35,543 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 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:35,553 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:35,553 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:57:35,600 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-03 20:57:35,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:35,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:57:35,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:36,210 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 375 proven. 94 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:36,211 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:36,600 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 375 proven. 94 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:36,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:36,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 57 [2019-09-03 20:57:36,603 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:36,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-03 20:57:36,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-03 20:57:36,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=643, Invalid=2549, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 20:57:36,604 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 57 states. [2019-09-03 20:57:38,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:38,588 INFO L93 Difference]: Finished difference Result 1021 states and 1291 transitions. [2019-09-03 20:57:38,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-03 20:57:38,589 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 136 [2019-09-03 20:57:38,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:38,590 INFO L225 Difference]: With dead ends: 1021 [2019-09-03 20:57:38,591 INFO L226 Difference]: Without dead ends: 974 [2019-09-03 20:57:38,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 219 SyntacticMatches, 34 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6744 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2971, Invalid=13799, Unknown=0, NotChecked=0, Total=16770 [2019-09-03 20:57:38,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-09-03 20:57:38,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 170. [2019-09-03 20:57:38,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 20:57:38,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-03 20:57:38,602 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-03 20:57:38,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:38,602 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-03 20:57:38,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-03 20:57:38,602 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-03 20:57:38,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 20:57:38,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:38,603 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:38,603 INFO L418 AbstractCegarLoop]: === Iteration 150 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:38,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:38,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1100264208, now seen corresponding path program 105 times [2019-09-03 20:57:38,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:38,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:38,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:38,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:38,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:39,048 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 375 proven. 106 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:39,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:39,049 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:39,049 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:39,049 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:57:39,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:39,049 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 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:39,058 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:39,058 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:57:39,098 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:39,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:39,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:57:39,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:39,684 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 375 proven. 106 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:39,684 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:40,087 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 375 proven. 106 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:40,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:40,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 56 [2019-09-03 20:57:40,090 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:40,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-03 20:57:40,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-03 20:57:40,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=647, Invalid=2433, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 20:57:40,091 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 56 states. [2019-09-03 20:57:41,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:41,839 INFO L93 Difference]: Finished difference Result 1071 states and 1358 transitions. [2019-09-03 20:57:41,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-03 20:57:41,839 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 136 [2019-09-03 20:57:41,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:41,841 INFO L225 Difference]: With dead ends: 1071 [2019-09-03 20:57:41,841 INFO L226 Difference]: Without dead ends: 1024 [2019-09-03 20:57:41,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 220 SyntacticMatches, 34 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5454 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2485, Invalid=11321, Unknown=0, NotChecked=0, Total=13806 [2019-09-03 20:57:41,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2019-09-03 20:57:41,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 170. [2019-09-03 20:57:41,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 20:57:41,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-03 20:57:41,850 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-03 20:57:41,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:41,850 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-03 20:57:41,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-03 20:57:41,850 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-03 20:57:41,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 20:57:41,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:41,851 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:41,851 INFO L418 AbstractCegarLoop]: === Iteration 151 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:41,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:41,851 INFO L82 PathProgramCache]: Analyzing trace with hash 2083242415, now seen corresponding path program 15 times [2019-09-03 20:57:41,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:41,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:41,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:41,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:41,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:42,328 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 375 proven. 120 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:42,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:42,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:42,328 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:42,329 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:57:42,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:42,329 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 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:42,339 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:42,339 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:57:42,380 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:42,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:42,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:57:42,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:42,962 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 375 proven. 120 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:42,963 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:43,368 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 375 proven. 120 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:43,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:43,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 55 [2019-09-03 20:57:43,371 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:43,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 20:57:43,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 20:57:43,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=655, Invalid=2315, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 20:57:43,372 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 55 states. [2019-09-03 20:57:44,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:44,726 INFO L93 Difference]: Finished difference Result 1123 states and 1428 transitions. [2019-09-03 20:57:44,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-03 20:57:44,726 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 136 [2019-09-03 20:57:44,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:44,728 INFO L225 Difference]: With dead ends: 1123 [2019-09-03 20:57:44,729 INFO L226 Difference]: Without dead ends: 1076 [2019-09-03 20:57:44,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 221 SyntacticMatches, 34 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4100 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2009, Invalid=8703, Unknown=0, NotChecked=0, Total=10712 [2019-09-03 20:57:44,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2019-09-03 20:57:44,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 172. [2019-09-03 20:57:44,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-03 20:57:44,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 190 transitions. [2019-09-03 20:57:44,741 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 190 transitions. Word has length 136 [2019-09-03 20:57:44,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:44,741 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 190 transitions. [2019-09-03 20:57:44,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 20:57:44,741 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 190 transitions. [2019-09-03 20:57:44,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-03 20:57:44,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:44,742 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:44,742 INFO L418 AbstractCegarLoop]: === Iteration 152 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:44,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:44,742 INFO L82 PathProgramCache]: Analyzing trace with hash -769222744, now seen corresponding path program 30 times [2019-09-03 20:57:44,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:44,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:44,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:44,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:44,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:44,913 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 166 proven. 345 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:44,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:44,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:44,913 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:44,913 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:57:44,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:44,913 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 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:44,923 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:44,923 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:57:44,966 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:44,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:44,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:57:44,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:44,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:45,009 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 166 proven. 345 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:45,010 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:45,246 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 166 proven. 345 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:57:45,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:45,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 23 [2019-09-03 20:57:45,249 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:45,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 20:57:45,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 20:57:45,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=325, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:57:45,250 INFO L87 Difference]: Start difference. First operand 172 states and 190 transitions. Second operand 23 states. [2019-09-03 20:57:45,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:45,512 INFO L93 Difference]: Finished difference Result 183 states and 202 transitions. [2019-09-03 20:57:45,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 20:57:45,512 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 137 [2019-09-03 20:57:45,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:45,513 INFO L225 Difference]: With dead ends: 183 [2019-09-03 20:57:45,513 INFO L226 Difference]: Without dead ends: 183 [2019-09-03 20:57:45,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 256 SyntacticMatches, 32 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=365, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:57:45,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-03 20:57:45,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2019-09-03 20:57:45,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-09-03 20:57:45,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 197 transitions. [2019-09-03 20:57:45,516 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 197 transitions. Word has length 137 [2019-09-03 20:57:45,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:45,516 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 197 transitions. [2019-09-03 20:57:45,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 20:57:45,517 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 197 transitions. [2019-09-03 20:57:45,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 20:57:45,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:45,517 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:45,517 INFO L418 AbstractCegarLoop]: === Iteration 153 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:45,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:45,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1314599183, now seen corresponding path program 31 times [2019-09-03 20:57:45,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:45,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:45,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:45,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:45,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:46,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 424 proven. 136 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:57:46,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:46,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:46,014 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:46,014 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:57:46,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:46,014 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 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:46,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:46,025 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:46,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:57:46,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:47,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 424 proven. 136 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:57:47,008 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:47,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 424 proven. 136 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:57:47,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:47,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 74 [2019-09-03 20:57:47,479 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:47,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-03 20:57:47,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-03 20:57:47,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1065, Invalid=4337, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 20:57:47,480 INFO L87 Difference]: Start difference. First operand 179 states and 197 transitions. Second operand 74 states. [2019-09-03 20:57:49,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:49,040 INFO L93 Difference]: Finished difference Result 297 states and 349 transitions. [2019-09-03 20:57:49,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 20:57:49,041 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2019-09-03 20:57:49,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:49,041 INFO L225 Difference]: With dead ends: 297 [2019-09-03 20:57:49,041 INFO L226 Difference]: Without dead ends: 247 [2019-09-03 20:57:49,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 218 SyntacticMatches, 36 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5980 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2235, Invalid=9755, Unknown=0, NotChecked=0, Total=11990 [2019-09-03 20:57:49,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-09-03 20:57:49,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 180. [2019-09-03 20:57:49,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 20:57:49,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-03 20:57:49,046 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-03 20:57:49,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:49,046 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-03 20:57:49,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-03 20:57:49,046 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-03 20:57:49,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 20:57:49,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:49,047 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:49,047 INFO L418 AbstractCegarLoop]: === Iteration 154 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:49,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:49,047 INFO L82 PathProgramCache]: Analyzing trace with hash 277740686, now seen corresponding path program 106 times [2019-09-03 20:57:49,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:49,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:49,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:49,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:49,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:49,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 424 proven. 121 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:57:49,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:49,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:49,564 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:49,564 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:57:49,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:49,564 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 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:49,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:49,574 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:49,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:57:49,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:50,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 424 proven. 121 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:57:50,563 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:51,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 424 proven. 121 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:57:51,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:51,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 73 [2019-09-03 20:57:51,037 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:51,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-03 20:57:51,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-03 20:57:51,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1014, Invalid=4242, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 20:57:51,038 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 73 states. [2019-09-03 20:57:52,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:52,432 INFO L93 Difference]: Finished difference Result 364 states and 434 transitions. [2019-09-03 20:57:52,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-03 20:57:52,433 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2019-09-03 20:57:52,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:52,434 INFO L225 Difference]: With dead ends: 364 [2019-09-03 20:57:52,434 INFO L226 Difference]: Without dead ends: 314 [2019-09-03 20:57:52,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 219 SyntacticMatches, 36 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7140 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2775, Invalid=12725, Unknown=0, NotChecked=0, Total=15500 [2019-09-03 20:57:52,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-03 20:57:52,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 180. [2019-09-03 20:57:52,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 20:57:52,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-03 20:57:52,437 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-03 20:57:52,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:52,438 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-03 20:57:52,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-03 20:57:52,438 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-03 20:57:52,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 20:57:52,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:52,438 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:52,438 INFO L418 AbstractCegarLoop]: === Iteration 155 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:52,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:52,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1629766959, now seen corresponding path program 107 times [2019-09-03 20:57:52,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:52,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:52,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:52,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:52,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 424 proven. 108 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:57:52,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:52,958 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:52,958 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:52,958 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:57:52,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:52,958 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 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:52,968 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:52,968 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:57:53,020 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-03 20:57:53,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:53,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:57:53,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:53,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 424 proven. 108 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:57:53,949 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:54,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 424 proven. 108 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:57:54,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:54,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 72 [2019-09-03 20:57:54,422 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:54,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-03 20:57:54,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-03 20:57:54,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=967, Invalid=4145, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 20:57:54,423 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 72 states. [2019-09-03 20:57:56,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:56,504 INFO L93 Difference]: Finished difference Result 430 states and 518 transitions. [2019-09-03 20:57:56,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 20:57:56,505 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 144 [2019-09-03 20:57:56,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:56,506 INFO L225 Difference]: With dead ends: 430 [2019-09-03 20:57:56,506 INFO L226 Difference]: Without dead ends: 380 [2019-09-03 20:57:56,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 220 SyntacticMatches, 36 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8331 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3334, Invalid=15572, Unknown=0, NotChecked=0, Total=18906 [2019-09-03 20:57:56,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-09-03 20:57:56,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 180. [2019-09-03 20:57:56,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 20:57:56,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-03 20:57:56,510 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-03 20:57:56,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:56,511 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-03 20:57:56,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-03 20:57:56,511 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-03 20:57:56,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 20:57:56,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:56,511 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 13, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:56,511 INFO L418 AbstractCegarLoop]: === Iteration 156 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:56,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:56,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1950475374, now seen corresponding path program 108 times [2019-09-03 20:57:56,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:56,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:56,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:56,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:56,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:56,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 424 proven. 97 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:57:56,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:56,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:56,990 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:56,990 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:57:56,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:56,990 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 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:57,000 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:57,000 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:57:57,045 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:57,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:57,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:57:57,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:57,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 424 proven. 97 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:57:57,944 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:58,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 424 proven. 97 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:57:58,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:58,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 71 [2019-09-03 20:57:58,410 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:58,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-03 20:57:58,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-03 20:57:58,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=924, Invalid=4046, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 20:57:58,412 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 71 states. [2019-09-03 20:58:00,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:00,929 INFO L93 Difference]: Finished difference Result 495 states and 601 transitions. [2019-09-03 20:58:00,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-03 20:58:00,930 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 144 [2019-09-03 20:58:00,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:00,931 INFO L225 Difference]: With dead ends: 495 [2019-09-03 20:58:00,931 INFO L226 Difference]: Without dead ends: 445 [2019-09-03 20:58:00,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 221 SyntacticMatches, 36 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9473 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3873, Invalid=18179, Unknown=0, NotChecked=0, Total=22052 [2019-09-03 20:58:00,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-09-03 20:58:00,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 180. [2019-09-03 20:58:00,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 20:58:00,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-03 20:58:00,935 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-03 20:58:00,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:00,936 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-03 20:58:00,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-03 20:58:00,936 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-03 20:58:00,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 20:58:00,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:00,936 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:00,936 INFO L418 AbstractCegarLoop]: === Iteration 157 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:00,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:00,937 INFO L82 PathProgramCache]: Analyzing trace with hash -2057051825, now seen corresponding path program 109 times [2019-09-03 20:58:00,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:00,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:00,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:00,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:00,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:01,441 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 424 proven. 88 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:01,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:01,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:01,442 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:01,442 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:58:01,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:01,442 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 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:01,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:01,452 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:58:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:01,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:58:01,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:02,380 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 424 proven. 88 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:02,380 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:02,820 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 424 proven. 88 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:02,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:02,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 70 [2019-09-03 20:58:02,823 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:02,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-03 20:58:02,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-03 20:58:02,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=885, Invalid=3945, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 20:58:02,824 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 70 states. [2019-09-03 20:58:05,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:05,278 INFO L93 Difference]: Finished difference Result 559 states and 683 transitions. [2019-09-03 20:58:05,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-03 20:58:05,279 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 144 [2019-09-03 20:58:05,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:05,280 INFO L225 Difference]: With dead ends: 559 [2019-09-03 20:58:05,280 INFO L226 Difference]: Without dead ends: 509 [2019-09-03 20:58:05,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 222 SyntacticMatches, 36 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10498 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4359, Invalid=20447, Unknown=0, NotChecked=0, Total=24806 [2019-09-03 20:58:05,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2019-09-03 20:58:05,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 180. [2019-09-03 20:58:05,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 20:58:05,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-03 20:58:05,285 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-03 20:58:05,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:05,285 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-03 20:58:05,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-03 20:58:05,285 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-03 20:58:05,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 20:58:05,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:05,285 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 11, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:05,286 INFO L418 AbstractCegarLoop]: === Iteration 158 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:05,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:05,286 INFO L82 PathProgramCache]: Analyzing trace with hash -108116914, now seen corresponding path program 110 times [2019-09-03 20:58:05,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:05,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:05,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:05,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:05,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:05,767 INFO L134 CoverageAnalysis]: Checked inductivity of 985 backedges. 424 proven. 81 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:05,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:05,767 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:05,768 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:05,768 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:58:05,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:05,768 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 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:05,778 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:58:05,778 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:58:05,830 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-03 20:58:05,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:05,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:58:05,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:06,698 INFO L134 CoverageAnalysis]: Checked inductivity of 985 backedges. 424 proven. 81 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:06,699 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:07,147 INFO L134 CoverageAnalysis]: Checked inductivity of 985 backedges. 424 proven. 81 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:07,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:07,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 69 [2019-09-03 20:58:07,150 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:07,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-03 20:58:07,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-03 20:58:07,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=850, Invalid=3842, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 20:58:07,152 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 69 states. [2019-09-03 20:58:10,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:10,157 INFO L93 Difference]: Finished difference Result 622 states and 764 transitions. [2019-09-03 20:58:10,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-09-03 20:58:10,157 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 144 [2019-09-03 20:58:10,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:10,159 INFO L225 Difference]: With dead ends: 622 [2019-09-03 20:58:10,159 INFO L226 Difference]: Without dead ends: 572 [2019-09-03 20:58:10,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 223 SyntacticMatches, 36 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11350 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4765, Invalid=22295, Unknown=0, NotChecked=0, Total=27060 [2019-09-03 20:58:10,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-09-03 20:58:10,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 180. [2019-09-03 20:58:10,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 20:58:10,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-03 20:58:10,164 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-03 20:58:10,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:10,164 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-03 20:58:10,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-03 20:58:10,164 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-03 20:58:10,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 20:58:10,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:10,165 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:10,165 INFO L418 AbstractCegarLoop]: === Iteration 159 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:10,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:10,165 INFO L82 PathProgramCache]: Analyzing trace with hash 924583279, now seen corresponding path program 111 times [2019-09-03 20:58:10,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:10,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:10,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:10,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:10,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:10,658 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 424 proven. 76 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:10,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:10,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:10,658 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:10,658 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:58:10,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:10,658 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 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:10,667 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:58:10,668 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:58:10,708 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:58:10,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:10,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:58:10,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:11,537 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 424 proven. 76 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:11,538 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:11,980 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 424 proven. 76 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:11,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:11,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 68 [2019-09-03 20:58:11,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:11,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-03 20:58:11,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-03 20:58:11,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=819, Invalid=3737, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 20:58:11,985 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 68 states. [2019-09-03 20:58:15,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:15,105 INFO L93 Difference]: Finished difference Result 684 states and 844 transitions. [2019-09-03 20:58:15,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-03 20:58:15,106 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 144 [2019-09-03 20:58:15,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:15,107 INFO L225 Difference]: With dead ends: 684 [2019-09-03 20:58:15,107 INFO L226 Difference]: Without dead ends: 634 [2019-09-03 20:58:15,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 224 SyntacticMatches, 36 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11985 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5070, Invalid=23660, Unknown=0, NotChecked=0, Total=28730 [2019-09-03 20:58:15,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-09-03 20:58:15,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 180. [2019-09-03 20:58:15,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 20:58:15,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-03 20:58:15,113 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-03 20:58:15,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:15,113 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-03 20:58:15,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-03 20:58:15,114 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-03 20:58:15,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 20:58:15,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:15,114 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:15,114 INFO L418 AbstractCegarLoop]: === Iteration 160 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:15,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:15,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1674503122, now seen corresponding path program 112 times [2019-09-03 20:58:15,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:15,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:15,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:15,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:15,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:15,588 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 424 proven. 73 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:15,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:15,589 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:15,589 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:15,589 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:58:15,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:15,589 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 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:15,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:15,599 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:58:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:15,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:58:15,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:16,462 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 424 proven. 73 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:16,462 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:16,902 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 424 proven. 73 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:16,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:16,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 67 [2019-09-03 20:58:16,905 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:16,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-03 20:58:16,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-03 20:58:16,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=792, Invalid=3630, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 20:58:16,907 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 67 states. [2019-09-03 20:58:19,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:19,917 INFO L93 Difference]: Finished difference Result 745 states and 923 transitions. [2019-09-03 20:58:19,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-09-03 20:58:19,918 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 144 [2019-09-03 20:58:19,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:19,919 INFO L225 Difference]: With dead ends: 745 [2019-09-03 20:58:19,919 INFO L226 Difference]: Without dead ends: 695 [2019-09-03 20:58:19,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 225 SyntacticMatches, 36 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12371 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5259, Invalid=24497, Unknown=0, NotChecked=0, Total=29756 [2019-09-03 20:58:19,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2019-09-03 20:58:19,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 180. [2019-09-03 20:58:19,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 20:58:19,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-03 20:58:19,925 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-03 20:58:19,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:19,926 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-03 20:58:19,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-03 20:58:19,926 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-03 20:58:19,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 20:58:19,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:19,926 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:19,926 INFO L418 AbstractCegarLoop]: === Iteration 161 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:19,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:19,927 INFO L82 PathProgramCache]: Analyzing trace with hash 181318031, now seen corresponding path program 113 times [2019-09-03 20:58:19,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:19,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:19,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:19,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:19,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:20,405 INFO L134 CoverageAnalysis]: Checked inductivity of 976 backedges. 424 proven. 72 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:20,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:20,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:20,405 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:20,405 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:58:20,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:20,406 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 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:20,414 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:58:20,415 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:58:20,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-03 20:58:20,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:20,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:58:20,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:21,237 INFO L134 CoverageAnalysis]: Checked inductivity of 976 backedges. 424 proven. 72 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:21,238 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:21,698 INFO L134 CoverageAnalysis]: Checked inductivity of 976 backedges. 424 proven. 72 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:21,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:21,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 66 [2019-09-03 20:58:21,701 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:21,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-03 20:58:21,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-03 20:58:21,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=769, Invalid=3521, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 20:58:21,702 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 66 states. [2019-09-03 20:58:24,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:24,870 INFO L93 Difference]: Finished difference Result 805 states and 1001 transitions. [2019-09-03 20:58:24,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-03 20:58:24,871 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 144 [2019-09-03 20:58:24,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:24,872 INFO L225 Difference]: With dead ends: 805 [2019-09-03 20:58:24,872 INFO L226 Difference]: Without dead ends: 755 [2019-09-03 20:58:24,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 226 SyntacticMatches, 36 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12488 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5323, Invalid=24779, Unknown=0, NotChecked=0, Total=30102 [2019-09-03 20:58:24,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-09-03 20:58:24,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 180. [2019-09-03 20:58:24,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 20:58:24,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-03 20:58:24,879 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-03 20:58:24,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:24,880 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-03 20:58:24,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-03 20:58:24,880 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-03 20:58:24,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 20:58:24,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:24,880 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:24,880 INFO L418 AbstractCegarLoop]: === Iteration 162 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:24,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:24,881 INFO L82 PathProgramCache]: Analyzing trace with hash 795372558, now seen corresponding path program 114 times [2019-09-03 20:58:24,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:24,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:24,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:24,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:24,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:25,369 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 424 proven. 73 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:25,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:25,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:25,370 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:25,370 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:58:25,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:25,370 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 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:25,379 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:58:25,379 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:58:25,423 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:58:25,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:25,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:58:25,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:26,188 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 424 proven. 73 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:26,188 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:26,653 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 424 proven. 73 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:26,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:26,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 65 [2019-09-03 20:58:26,656 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:26,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-03 20:58:26,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-03 20:58:26,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=750, Invalid=3410, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 20:58:26,657 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 65 states. [2019-09-03 20:58:29,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:29,493 INFO L93 Difference]: Finished difference Result 864 states and 1078 transitions. [2019-09-03 20:58:29,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-09-03 20:58:29,493 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 144 [2019-09-03 20:58:29,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:29,495 INFO L225 Difference]: With dead ends: 864 [2019-09-03 20:58:29,495 INFO L226 Difference]: Without dead ends: 814 [2019-09-03 20:58:29,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 227 SyntacticMatches, 36 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12327 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5259, Invalid=24497, Unknown=0, NotChecked=0, Total=29756 [2019-09-03 20:58:29,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2019-09-03 20:58:29,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 180. [2019-09-03 20:58:29,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 20:58:29,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-03 20:58:29,501 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-03 20:58:29,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:29,501 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-03 20:58:29,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-03 20:58:29,502 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-03 20:58:29,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 20:58:29,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:29,502 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:29,502 INFO L418 AbstractCegarLoop]: === Iteration 163 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:29,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:29,502 INFO L82 PathProgramCache]: Analyzing trace with hash -847387217, now seen corresponding path program 115 times [2019-09-03 20:58:29,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:29,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:29,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:29,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:29,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:29,984 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 424 proven. 76 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:29,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:29,984 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:29,984 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:29,985 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:58:29,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:29,985 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 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:29,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:29,995 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:58:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:30,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:58:30,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:30,807 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 424 proven. 76 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:30,807 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:31,236 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 424 proven. 76 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:31,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:31,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 64 [2019-09-03 20:58:31,239 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:31,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-03 20:58:31,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-03 20:58:31,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=735, Invalid=3297, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 20:58:31,240 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 64 states. [2019-09-03 20:58:33,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:33,990 INFO L93 Difference]: Finished difference Result 922 states and 1154 transitions. [2019-09-03 20:58:33,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-03 20:58:33,991 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 144 [2019-09-03 20:58:33,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:33,992 INFO L225 Difference]: With dead ends: 922 [2019-09-03 20:58:33,992 INFO L226 Difference]: Without dead ends: 872 [2019-09-03 20:58:33,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 228 SyntacticMatches, 36 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11885 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5070, Invalid=23660, Unknown=0, NotChecked=0, Total=28730 [2019-09-03 20:58:33,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2019-09-03 20:58:34,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 180. [2019-09-03 20:58:34,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 20:58:34,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-03 20:58:34,000 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-03 20:58:34,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:34,000 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-03 20:58:34,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-03 20:58:34,001 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-03 20:58:34,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 20:58:34,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:34,001 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 11, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:34,001 INFO L418 AbstractCegarLoop]: === Iteration 164 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:34,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:34,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1039283182, now seen corresponding path program 116 times [2019-09-03 20:58:34,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:34,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:34,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:34,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:34,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:34,509 INFO L134 CoverageAnalysis]: Checked inductivity of 985 backedges. 424 proven. 81 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:34,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:34,510 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:34,510 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:34,510 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:58:34,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:34,510 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 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:34,521 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:58:34,521 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:58:34,572 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-03 20:58:34,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:34,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:58:34,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:35,283 INFO L134 CoverageAnalysis]: Checked inductivity of 985 backedges. 424 proven. 81 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:35,283 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:35,715 INFO L134 CoverageAnalysis]: Checked inductivity of 985 backedges. 424 proven. 81 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:35,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:35,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 63 [2019-09-03 20:58:35,718 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:35,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-03 20:58:35,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-03 20:58:35,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=724, Invalid=3182, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 20:58:35,719 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 63 states. [2019-09-03 20:58:38,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:38,639 INFO L93 Difference]: Finished difference Result 979 states and 1229 transitions. [2019-09-03 20:58:38,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-09-03 20:58:38,639 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 144 [2019-09-03 20:58:38,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:38,641 INFO L225 Difference]: With dead ends: 979 [2019-09-03 20:58:38,641 INFO L226 Difference]: Without dead ends: 929 [2019-09-03 20:58:38,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 229 SyntacticMatches, 36 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11170 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4765, Invalid=22295, Unknown=0, NotChecked=0, Total=27060 [2019-09-03 20:58:38,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-09-03 20:58:38,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 180. [2019-09-03 20:58:38,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 20:58:38,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-03 20:58:38,649 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-03 20:58:38,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:38,649 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-03 20:58:38,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-03 20:58:38,649 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-03 20:58:38,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 20:58:38,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:38,650 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:38,650 INFO L418 AbstractCegarLoop]: === Iteration 165 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:38,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:38,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1532255793, now seen corresponding path program 117 times [2019-09-03 20:58:38,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:38,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:38,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:38,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:38,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:39,118 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 424 proven. 88 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:39,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:39,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:39,118 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:39,119 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:58:39,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:39,119 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 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:39,129 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:58:39,130 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:58:39,171 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:58:39,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:39,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:58:39,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:39,873 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 424 proven. 88 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:39,873 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:40,335 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 424 proven. 88 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:40,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:40,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 62 [2019-09-03 20:58:40,338 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:40,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-03 20:58:40,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-03 20:58:40,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=717, Invalid=3065, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 20:58:40,339 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 62 states. [2019-09-03 20:58:43,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:43,001 INFO L93 Difference]: Finished difference Result 1035 states and 1303 transitions. [2019-09-03 20:58:43,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-03 20:58:43,002 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 144 [2019-09-03 20:58:43,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:43,004 INFO L225 Difference]: With dead ends: 1035 [2019-09-03 20:58:43,004 INFO L226 Difference]: Without dead ends: 985 [2019-09-03 20:58:43,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 230 SyntacticMatches, 36 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10202 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4359, Invalid=20447, Unknown=0, NotChecked=0, Total=24806 [2019-09-03 20:58:43,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2019-09-03 20:58:43,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 180. [2019-09-03 20:58:43,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 20:58:43,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-03 20:58:43,012 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-03 20:58:43,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:43,012 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-03 20:58:43,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-03 20:58:43,013 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-03 20:58:43,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 20:58:43,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:43,013 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 13, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:43,013 INFO L418 AbstractCegarLoop]: === Iteration 166 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:43,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:43,013 INFO L82 PathProgramCache]: Analyzing trace with hash -368282674, now seen corresponding path program 118 times [2019-09-03 20:58:43,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:43,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:43,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:43,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:43,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:43,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 424 proven. 97 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:43,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:43,478 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:43,478 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:43,478 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:58:43,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:43,478 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 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:43,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:43,489 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:58:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:43,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:58:43,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:44,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 424 proven. 97 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:44,208 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:44,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 424 proven. 97 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:44,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:44,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 61 [2019-09-03 20:58:44,657 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:44,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-03 20:58:44,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-03 20:58:44,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=714, Invalid=2946, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 20:58:44,658 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 61 states. [2019-09-03 20:58:47,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:47,024 INFO L93 Difference]: Finished difference Result 1090 states and 1376 transitions. [2019-09-03 20:58:47,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-09-03 20:58:47,025 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 144 [2019-09-03 20:58:47,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:47,026 INFO L225 Difference]: With dead ends: 1090 [2019-09-03 20:58:47,027 INFO L226 Difference]: Without dead ends: 1040 [2019-09-03 20:58:47,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 231 SyntacticMatches, 36 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9013 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3873, Invalid=18179, Unknown=0, NotChecked=0, Total=22052 [2019-09-03 20:58:47,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2019-09-03 20:58:47,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 180. [2019-09-03 20:58:47,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 20:58:47,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-03 20:58:47,039 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-03 20:58:47,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:47,040 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-03 20:58:47,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-03 20:58:47,040 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-03 20:58:47,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 20:58:47,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:47,040 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:47,040 INFO L418 AbstractCegarLoop]: === Iteration 167 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:47,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:47,041 INFO L82 PathProgramCache]: Analyzing trace with hash 777643503, now seen corresponding path program 119 times [2019-09-03 20:58:47,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:47,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:47,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:47,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:47,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:47,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 424 proven. 108 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:47,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:47,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:47,507 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:47,507 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:58:47,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:47,507 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 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:47,517 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:58:47,517 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:58:47,568 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-03 20:58:47,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:47,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:58:47,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:48,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 424 proven. 108 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:48,250 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:48,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 424 proven. 108 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:48,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:48,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 60 [2019-09-03 20:58:48,703 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:48,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-03 20:58:48,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-03 20:58:48,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=715, Invalid=2825, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 20:58:48,705 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 60 states. [2019-09-03 20:58:50,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:50,700 INFO L93 Difference]: Finished difference Result 1144 states and 1448 transitions. [2019-09-03 20:58:50,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-03 20:58:50,700 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 144 [2019-09-03 20:58:50,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:50,702 INFO L225 Difference]: With dead ends: 1144 [2019-09-03 20:58:50,703 INFO L226 Difference]: Without dead ends: 1094 [2019-09-03 20:58:50,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 232 SyntacticMatches, 36 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7647 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3334, Invalid=15572, Unknown=0, NotChecked=0, Total=18906 [2019-09-03 20:58:50,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2019-09-03 20:58:50,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 180. [2019-09-03 20:58:50,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 20:58:50,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-03 20:58:50,714 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-03 20:58:50,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:50,714 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-03 20:58:50,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-03 20:58:50,714 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-03 20:58:50,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 20:58:50,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:50,715 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:50,715 INFO L418 AbstractCegarLoop]: === Iteration 168 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:50,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:50,715 INFO L82 PathProgramCache]: Analyzing trace with hash -847959122, now seen corresponding path program 120 times [2019-09-03 20:58:50,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:50,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:50,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:50,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:50,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:51,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 424 proven. 121 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:51,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:51,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:51,198 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:51,199 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:58:51,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:51,199 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 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:51,208 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:58:51,209 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:58:51,253 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:58:51,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:51,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:58:51,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:51,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 424 proven. 121 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:51,886 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:52,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 424 proven. 121 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:52,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:52,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 59 [2019-09-03 20:58:52,332 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:52,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-03 20:58:52,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-03 20:58:52,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=720, Invalid=2702, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 20:58:52,333 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 59 states. [2019-09-03 20:58:54,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:54,087 INFO L93 Difference]: Finished difference Result 1197 states and 1519 transitions. [2019-09-03 20:58:54,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-03 20:58:54,087 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 144 [2019-09-03 20:58:54,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:54,089 INFO L225 Difference]: With dead ends: 1197 [2019-09-03 20:58:54,089 INFO L226 Difference]: Without dead ends: 1147 [2019-09-03 20:58:54,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 233 SyntacticMatches, 36 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6160 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2775, Invalid=12725, Unknown=0, NotChecked=0, Total=15500 [2019-09-03 20:58:54,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2019-09-03 20:58:54,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 180. [2019-09-03 20:58:54,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 20:58:54,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-03 20:58:54,104 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-03 20:58:54,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:54,105 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-03 20:58:54,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-03 20:58:54,105 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-03 20:58:54,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 20:58:54,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:54,106 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:54,106 INFO L418 AbstractCegarLoop]: === Iteration 169 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:54,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:54,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1593134577, now seen corresponding path program 16 times [2019-09-03 20:58:54,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:54,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:54,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:54,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:54,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:54,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 424 proven. 136 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:54,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:54,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:54,585 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:54,585 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:58:54,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:54,585 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 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:54,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:54,595 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:58:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:54,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:58:54,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:55,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 424 proven. 136 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:55,264 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:55,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 424 proven. 136 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:55,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:55,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 58 [2019-09-03 20:58:55,707 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:55,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-03 20:58:55,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-03 20:58:55,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=729, Invalid=2577, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 20:58:55,708 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 58 states. [2019-09-03 20:58:57,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:57,200 INFO L93 Difference]: Finished difference Result 1252 states and 1593 transitions. [2019-09-03 20:58:57,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 20:58:57,201 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 144 [2019-09-03 20:58:57,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:57,203 INFO L225 Difference]: With dead ends: 1252 [2019-09-03 20:58:57,203 INFO L226 Difference]: Without dead ends: 1202 [2019-09-03 20:58:57,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 234 SyntacticMatches, 36 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4620 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2235, Invalid=9755, Unknown=0, NotChecked=0, Total=11990 [2019-09-03 20:58:57,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2019-09-03 20:58:57,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 182. [2019-09-03 20:58:57,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-03 20:58:57,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 201 transitions. [2019-09-03 20:58:57,214 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 201 transitions. Word has length 144 [2019-09-03 20:58:57,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:57,214 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 201 transitions. [2019-09-03 20:58:57,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-03 20:58:57,215 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 201 transitions. [2019-09-03 20:58:57,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-03 20:58:57,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:57,215 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:57,215 INFO L418 AbstractCegarLoop]: === Iteration 170 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:57,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:57,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1336215385, now seen corresponding path program 32 times [2019-09-03 20:58:57,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:57,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:57,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:57,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:57,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:57,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 185 proven. 392 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:57,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:57,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:57,395 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:57,395 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:58:57,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:57,395 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 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:57,405 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:58:57,405 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:58:57,460 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-03 20:58:57,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:57,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:58:57,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:57,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:57,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 185 proven. 392 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:57,498 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:57,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 185 proven. 392 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:58:57,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:57,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 24 [2019-09-03 20:58:57,770 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:57,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 20:58:57,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 20:58:57,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:58:57,771 INFO L87 Difference]: Start difference. First operand 182 states and 201 transitions. Second operand 24 states. [2019-09-03 20:58:58,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:58,107 INFO L93 Difference]: Finished difference Result 193 states and 213 transitions. [2019-09-03 20:58:58,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 20:58:58,107 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 145 [2019-09-03 20:58:58,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:58,108 INFO L225 Difference]: With dead ends: 193 [2019-09-03 20:58:58,108 INFO L226 Difference]: Without dead ends: 193 [2019-09-03 20:58:58,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 271 SyntacticMatches, 34 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=206, Invalid=394, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:58:58,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-03 20:58:58,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 189. [2019-09-03 20:58:58,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-03 20:58:58,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 208 transitions. [2019-09-03 20:58:58,111 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 208 transitions. Word has length 145 [2019-09-03 20:58:58,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:58,111 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 208 transitions. [2019-09-03 20:58:58,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 20:58:58,112 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 208 transitions. [2019-09-03 20:58:58,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 20:58:58,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:58,112 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:58,112 INFO L418 AbstractCegarLoop]: === Iteration 171 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:58,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:58,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1211727056, now seen corresponding path program 33 times [2019-09-03 20:58:58,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:58,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:58,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:58,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:58,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:58,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 476 proven. 153 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:58:58,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:58,684 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:58,684 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:58,685 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:58:58,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:58,685 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 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:58:58,697 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:58:58,698 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:58,745 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:58:58,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:58,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:58:58,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:59,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 476 proven. 153 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:58:59,796 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:00,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 476 proven. 153 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:00,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:00,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 78 [2019-09-03 20:59:00,314 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:00,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-03 20:59:00,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-03 20:59:00,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1181, Invalid=4825, Unknown=0, NotChecked=0, Total=6006 [2019-09-03 20:59:00,315 INFO L87 Difference]: Start difference. First operand 189 states and 208 transitions. Second operand 78 states. [2019-09-03 20:59:01,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:01,545 INFO L93 Difference]: Finished difference Result 314 states and 369 transitions. [2019-09-03 20:59:01,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 20:59:01,545 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2019-09-03 20:59:01,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:01,546 INFO L225 Difference]: With dead ends: 314 [2019-09-03 20:59:01,546 INFO L226 Difference]: Without dead ends: 261 [2019-09-03 20:59:01,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 230 SyntacticMatches, 38 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6701 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2473, Invalid=10867, Unknown=0, NotChecked=0, Total=13340 [2019-09-03 20:59:01,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-09-03 20:59:01,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 190. [2019-09-03 20:59:01,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 20:59:01,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 20:59:01,551 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 20:59:01,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:01,551 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 20:59:01,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-03 20:59:01,551 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 20:59:01,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 20:59:01,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:01,552 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:01,552 INFO L418 AbstractCegarLoop]: === Iteration 172 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:01,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:01,552 INFO L82 PathProgramCache]: Analyzing trace with hash -101621841, now seen corresponding path program 121 times [2019-09-03 20:59:01,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:01,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:01,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:01,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:01,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:02,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 476 proven. 137 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:02,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:02,111 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:02,112 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:02,112 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:02,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:02,112 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 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:02,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:02,122 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:59:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:02,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:59:02,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:03,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 476 proven. 137 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:03,188 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:03,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 476 proven. 137 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:03,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:03,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 77 [2019-09-03 20:59:03,711 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:03,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-03 20:59:03,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-03 20:59:03,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1127, Invalid=4725, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 20:59:03,713 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 77 states. [2019-09-03 20:59:05,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:05,587 INFO L93 Difference]: Finished difference Result 385 states and 459 transitions. [2019-09-03 20:59:05,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 20:59:05,587 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2019-09-03 20:59:05,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:05,588 INFO L225 Difference]: With dead ends: 385 [2019-09-03 20:59:05,588 INFO L226 Difference]: Without dead ends: 332 [2019-09-03 20:59:05,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 231 SyntacticMatches, 38 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8019 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3081, Invalid=14211, Unknown=0, NotChecked=0, Total=17292 [2019-09-03 20:59:05,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-03 20:59:05,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 190. [2019-09-03 20:59:05,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 20:59:05,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 20:59:05,592 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 20:59:05,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:05,592 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 20:59:05,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-03 20:59:05,592 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 20:59:05,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 20:59:05,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:05,592 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:05,593 INFO L418 AbstractCegarLoop]: === Iteration 173 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:05,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:05,593 INFO L82 PathProgramCache]: Analyzing trace with hash -758548656, now seen corresponding path program 122 times [2019-09-03 20:59:05,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:05,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:05,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:05,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:05,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:06,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 476 proven. 123 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:06,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:06,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:06,138 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:06,138 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:06,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:06,138 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 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:06,148 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:59:06,148 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:59:06,204 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-03 20:59:06,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:06,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:59:06,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:07,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 476 proven. 123 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:07,198 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:07,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 476 proven. 123 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:07,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:07,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 76 [2019-09-03 20:59:07,706 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:07,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-03 20:59:07,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-03 20:59:07,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1077, Invalid=4623, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 20:59:07,708 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 76 states. [2019-09-03 20:59:09,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:09,979 INFO L93 Difference]: Finished difference Result 455 states and 548 transitions. [2019-09-03 20:59:09,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-03 20:59:09,980 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 152 [2019-09-03 20:59:09,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:09,980 INFO L225 Difference]: With dead ends: 455 [2019-09-03 20:59:09,981 INFO L226 Difference]: Without dead ends: 402 [2019-09-03 20:59:09,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 232 SyntacticMatches, 38 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9387 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3718, Invalid=17452, Unknown=0, NotChecked=0, Total=21170 [2019-09-03 20:59:09,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-09-03 20:59:09,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 190. [2019-09-03 20:59:09,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 20:59:09,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 20:59:09,985 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 20:59:09,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:09,985 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 20:59:09,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-03 20:59:09,986 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 20:59:09,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 20:59:09,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:09,986 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 14, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:09,986 INFO L418 AbstractCegarLoop]: === Iteration 174 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:09,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:09,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1991206799, now seen corresponding path program 123 times [2019-09-03 20:59:09,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:09,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:09,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:09,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:09,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:10,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 476 proven. 111 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:10,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:10,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:10,578 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:10,578 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:10,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:10,578 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 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:10,587 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:59:10,587 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:59:10,632 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:59:10,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:10,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:59:10,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:11,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 476 proven. 111 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:11,637 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:12,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 476 proven. 111 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:12,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:12,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 75 [2019-09-03 20:59:12,148 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:12,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-03 20:59:12,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-03 20:59:12,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1031, Invalid=4519, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 20:59:12,150 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 75 states. [2019-09-03 20:59:14,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:14,521 INFO L93 Difference]: Finished difference Result 524 states and 636 transitions. [2019-09-03 20:59:14,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-03 20:59:14,521 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 152 [2019-09-03 20:59:14,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:14,522 INFO L225 Difference]: With dead ends: 524 [2019-09-03 20:59:14,522 INFO L226 Difference]: Without dead ends: 471 [2019-09-03 20:59:14,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 233 SyntacticMatches, 38 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10719 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4342, Invalid=20464, Unknown=0, NotChecked=0, Total=24806 [2019-09-03 20:59:14,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-09-03 20:59:14,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 190. [2019-09-03 20:59:14,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 20:59:14,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 20:59:14,527 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 20:59:14,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:14,527 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 20:59:14,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-03 20:59:14,527 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 20:59:14,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 20:59:14,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:14,528 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 13, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:14,528 INFO L418 AbstractCegarLoop]: === Iteration 175 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:14,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:14,528 INFO L82 PathProgramCache]: Analyzing trace with hash -2076511376, now seen corresponding path program 124 times [2019-09-03 20:59:14,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:14,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:14,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:14,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:14,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:15,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1121 backedges. 476 proven. 101 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:15,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:15,062 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:15,062 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:15,063 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:15,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:15,063 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 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:15,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:15,073 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:59:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:15,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:59:15,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:16,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1121 backedges. 476 proven. 101 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:16,082 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:16,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1121 backedges. 476 proven. 101 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:16,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:16,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 74 [2019-09-03 20:59:16,584 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:16,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-03 20:59:16,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-03 20:59:16,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=989, Invalid=4413, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 20:59:16,585 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 74 states. [2019-09-03 20:59:19,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:19,621 INFO L93 Difference]: Finished difference Result 592 states and 723 transitions. [2019-09-03 20:59:19,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-03 20:59:19,622 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 152 [2019-09-03 20:59:19,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:19,623 INFO L225 Difference]: With dead ends: 592 [2019-09-03 20:59:19,623 INFO L226 Difference]: Without dead ends: 539 [2019-09-03 20:59:19,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 234 SyntacticMatches, 38 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11941 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4917, Invalid=23139, Unknown=0, NotChecked=0, Total=28056 [2019-09-03 20:59:19,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2019-09-03 20:59:19,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 190. [2019-09-03 20:59:19,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 20:59:19,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 20:59:19,628 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 20:59:19,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:19,628 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 20:59:19,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-03 20:59:19,628 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 20:59:19,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 20:59:19,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:19,629 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 12, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:19,629 INFO L418 AbstractCegarLoop]: === Iteration 176 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:19,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:19,629 INFO L82 PathProgramCache]: Analyzing trace with hash 286123887, now seen corresponding path program 125 times [2019-09-03 20:59:19,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:19,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:19,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:19,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:19,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:20,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 476 proven. 93 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:20,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:20,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:20,163 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:20,163 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:20,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:20,163 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 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:20,172 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:59:20,173 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:59:20,230 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-03 20:59:20,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:20,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:59:20,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:21,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 476 proven. 93 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:21,182 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:21,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 476 proven. 93 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:21,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:21,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 73 [2019-09-03 20:59:21,684 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:21,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-03 20:59:21,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-03 20:59:21,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=951, Invalid=4305, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 20:59:21,685 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 73 states. [2019-09-03 20:59:24,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:24,398 INFO L93 Difference]: Finished difference Result 659 states and 809 transitions. [2019-09-03 20:59:24,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-03 20:59:24,399 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 152 [2019-09-03 20:59:24,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:24,400 INFO L225 Difference]: With dead ends: 659 [2019-09-03 20:59:24,400 INFO L226 Difference]: Without dead ends: 606 [2019-09-03 20:59:24,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 235 SyntacticMatches, 38 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12991 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5413, Invalid=25387, Unknown=0, NotChecked=0, Total=30800 [2019-09-03 20:59:24,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-09-03 20:59:24,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 190. [2019-09-03 20:59:24,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 20:59:24,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 20:59:24,406 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 20:59:24,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:24,406 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 20:59:24,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-03 20:59:24,406 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 20:59:24,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 20:59:24,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:24,407 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 11, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:24,407 INFO L418 AbstractCegarLoop]: === Iteration 177 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:24,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:24,407 INFO L82 PathProgramCache]: Analyzing trace with hash 639432592, now seen corresponding path program 126 times [2019-09-03 20:59:24,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:24,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:24,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:24,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:24,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:24,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 476 proven. 87 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:24,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:24,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:24,979 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:24,979 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:24,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:24,979 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 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:24,989 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:59:24,989 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:59:25,036 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:59:25,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:25,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:59:25,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:25,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 476 proven. 87 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:25,966 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:26,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 476 proven. 87 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:26,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:26,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 72 [2019-09-03 20:59:26,455 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:26,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-03 20:59:26,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-03 20:59:26,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=917, Invalid=4195, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 20:59:26,456 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 72 states. [2019-09-03 20:59:29,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:29,667 INFO L93 Difference]: Finished difference Result 725 states and 894 transitions. [2019-09-03 20:59:29,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-03 20:59:29,667 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 152 [2019-09-03 20:59:29,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:29,668 INFO L225 Difference]: With dead ends: 725 [2019-09-03 20:59:29,669 INFO L226 Difference]: Without dead ends: 672 [2019-09-03 20:59:29,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 236 SyntacticMatches, 38 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13819 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5806, Invalid=27136, Unknown=0, NotChecked=0, Total=32942 [2019-09-03 20:59:29,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-09-03 20:59:29,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 190. [2019-09-03 20:59:29,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 20:59:29,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 20:59:29,675 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 20:59:29,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:29,675 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 20:59:29,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-03 20:59:29,675 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 20:59:29,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 20:59:29,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:29,676 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 10, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:29,676 INFO L418 AbstractCegarLoop]: === Iteration 178 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:29,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:29,676 INFO L82 PathProgramCache]: Analyzing trace with hash 650829647, now seen corresponding path program 127 times [2019-09-03 20:59:29,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:29,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:29,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:29,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:29,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:29,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:30,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 476 proven. 83 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:30,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:30,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:30,210 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:30,210 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:30,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:30,210 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 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:30,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:30,221 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:59:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:30,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:59:30,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:31,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 476 proven. 83 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:31,176 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:31,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 476 proven. 83 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:31,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:31,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 71 [2019-09-03 20:59:31,672 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:31,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-03 20:59:31,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-03 20:59:31,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=887, Invalid=4083, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 20:59:31,673 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 71 states. [2019-09-03 20:59:35,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:35,177 INFO L93 Difference]: Finished difference Result 790 states and 978 transitions. [2019-09-03 20:59:35,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-03 20:59:35,178 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 152 [2019-09-03 20:59:35,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:35,179 INFO L225 Difference]: With dead ends: 790 [2019-09-03 20:59:35,179 INFO L226 Difference]: Without dead ends: 737 [2019-09-03 20:59:35,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 237 SyntacticMatches, 38 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14387 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6078, Invalid=28332, Unknown=0, NotChecked=0, Total=34410 [2019-09-03 20:59:35,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-09-03 20:59:35,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 190. [2019-09-03 20:59:35,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 20:59:35,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 20:59:35,186 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 20:59:35,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:35,186 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 20:59:35,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-03 20:59:35,186 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 20:59:35,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 20:59:35,187 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:35,187 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:35,187 INFO L418 AbstractCegarLoop]: === Iteration 179 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:35,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:35,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1427012688, now seen corresponding path program 128 times [2019-09-03 20:59:35,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:35,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:35,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:35,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:35,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:35,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:35,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1101 backedges. 476 proven. 81 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:35,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:35,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:35,705 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:35,705 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:35,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:35,705 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 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:35,715 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:59:35,715 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:59:35,772 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-03 20:59:35,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:35,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:59:35,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:36,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1101 backedges. 476 proven. 81 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:36,658 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:37,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1101 backedges. 476 proven. 81 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:37,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:37,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 70 [2019-09-03 20:59:37,153 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:37,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-03 20:59:37,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-03 20:59:37,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=3969, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 20:59:37,154 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 70 states. [2019-09-03 20:59:40,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:40,755 INFO L93 Difference]: Finished difference Result 854 states and 1061 transitions. [2019-09-03 20:59:40,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-09-03 20:59:40,756 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 152 [2019-09-03 20:59:40,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:40,757 INFO L225 Difference]: With dead ends: 854 [2019-09-03 20:59:40,757 INFO L226 Difference]: Without dead ends: 801 [2019-09-03 20:59:40,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 238 SyntacticMatches, 38 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14669 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6217, Invalid=28939, Unknown=0, NotChecked=0, Total=35156 [2019-09-03 20:59:40,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2019-09-03 20:59:40,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 190. [2019-09-03 20:59:40,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 20:59:40,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 20:59:40,764 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 20:59:40,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:40,764 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 20:59:40,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-03 20:59:40,765 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 20:59:40,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 20:59:40,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:40,765 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:40,765 INFO L418 AbstractCegarLoop]: === Iteration 180 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:40,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:40,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1831096111, now seen corresponding path program 129 times [2019-09-03 20:59:40,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:40,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:40,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:40,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:40,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:41,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1101 backedges. 476 proven. 81 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:41,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:41,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:41,282 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:41,282 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:41,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:41,282 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 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:41,300 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:59:41,301 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:59:41,346 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:59:41,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:41,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:59:41,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:42,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1101 backedges. 476 proven. 81 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:42,196 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:42,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1101 backedges. 476 proven. 81 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:42,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:42,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 69 [2019-09-03 20:59:42,696 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:42,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-03 20:59:42,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-03 20:59:42,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=839, Invalid=3853, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 20:59:42,697 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 69 states. [2019-09-03 20:59:46,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:46,039 INFO L93 Difference]: Finished difference Result 917 states and 1143 transitions. [2019-09-03 20:59:46,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-03 20:59:46,039 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 152 [2019-09-03 20:59:46,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:46,041 INFO L225 Difference]: With dead ends: 917 [2019-09-03 20:59:46,041 INFO L226 Difference]: Without dead ends: 864 [2019-09-03 20:59:46,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 239 SyntacticMatches, 38 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14651 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6217, Invalid=28939, Unknown=0, NotChecked=0, Total=35156 [2019-09-03 20:59:46,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2019-09-03 20:59:46,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 190. [2019-09-03 20:59:46,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 20:59:46,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 20:59:46,049 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 20:59:46,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:46,049 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 20:59:46,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-03 20:59:46,049 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 20:59:46,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 20:59:46,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:46,049 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 10, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:46,050 INFO L418 AbstractCegarLoop]: === Iteration 181 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:46,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:46,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1111844912, now seen corresponding path program 130 times [2019-09-03 20:59:46,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:46,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:46,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:46,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:46,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:46,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 476 proven. 83 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:46,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:46,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:46,602 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:46,602 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:46,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:46,602 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 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:46,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:46,612 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:59:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:46,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:59:46,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:47,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 476 proven. 83 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:47,472 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:47,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 476 proven. 83 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:47,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:47,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 68 [2019-09-03 20:59:47,972 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:47,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-03 20:59:47,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-03 20:59:47,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=821, Invalid=3735, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 20:59:47,973 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 68 states. [2019-09-03 20:59:51,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:51,446 INFO L93 Difference]: Finished difference Result 979 states and 1224 transitions. [2019-09-03 20:59:51,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-03 20:59:51,446 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 152 [2019-09-03 20:59:51,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:51,448 INFO L225 Difference]: With dead ends: 979 [2019-09-03 20:59:51,448 INFO L226 Difference]: Without dead ends: 926 [2019-09-03 20:59:51,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 240 SyntacticMatches, 38 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14327 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6078, Invalid=28332, Unknown=0, NotChecked=0, Total=34410 [2019-09-03 20:59:51,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-09-03 20:59:51,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 190. [2019-09-03 20:59:51,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 20:59:51,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 20:59:51,459 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 20:59:51,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:51,459 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 20:59:51,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-03 20:59:51,460 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 20:59:51,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 20:59:51,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:51,460 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 11, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:51,461 INFO L418 AbstractCegarLoop]: === Iteration 182 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:51,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:51,461 INFO L82 PathProgramCache]: Analyzing trace with hash -791136497, now seen corresponding path program 131 times [2019-09-03 20:59:51,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:51,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:51,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:51,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:51,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:51,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 476 proven. 87 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:51,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:51,980 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:51,981 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:51,981 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,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:51,981 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 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:51,991 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:59:51,991 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:59:52,049 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-03 20:59:52,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:52,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:59:52,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:52,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 476 proven. 87 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:52,869 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:53,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 476 proven. 87 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:53,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:53,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 67 [2019-09-03 20:59:53,350 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:53,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-03 20:59:53,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-03 20:59:53,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=807, Invalid=3615, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 20:59:53,351 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 67 states. [2019-09-03 20:59:56,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:56,410 INFO L93 Difference]: Finished difference Result 1040 states and 1304 transitions. [2019-09-03 20:59:56,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-09-03 20:59:56,410 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 152 [2019-09-03 20:59:56,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:56,412 INFO L225 Difference]: With dead ends: 1040 [2019-09-03 20:59:56,412 INFO L226 Difference]: Without dead ends: 987 [2019-09-03 20:59:56,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 241 SyntacticMatches, 38 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13699 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5806, Invalid=27136, Unknown=0, NotChecked=0, Total=32942 [2019-09-03 20:59:56,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2019-09-03 20:59:56,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 190. [2019-09-03 20:59:56,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 20:59:56,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 20:59:56,422 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 20:59:56,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:56,422 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 20:59:56,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-03 20:59:56,423 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 20:59:56,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 20:59:56,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:56,423 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 12, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:56,423 INFO L418 AbstractCegarLoop]: === Iteration 183 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:56,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:56,424 INFO L82 PathProgramCache]: Analyzing trace with hash -503696400, now seen corresponding path program 132 times [2019-09-03 20:59:56,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:56,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:56,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:56,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:56,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:56,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 476 proven. 93 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:56,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:56,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:56,943 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:56,943 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:56,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:56,943 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 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:56,952 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:59:56,952 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:59:57,000 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:59:57,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:57,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:59:57,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:58,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 476 proven. 93 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:58,010 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:58,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 476 proven. 93 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:59:58,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:58,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 66 [2019-09-03 20:59:58,497 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:58,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-03 20:59:58,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-03 20:59:58,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=797, Invalid=3493, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 20:59:58,498 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 66 states. [2019-09-03 21:00:01,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:01,472 INFO L93 Difference]: Finished difference Result 1100 states and 1383 transitions. [2019-09-03 21:00:01,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-03 21:00:01,472 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 152 [2019-09-03 21:00:01,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:01,474 INFO L225 Difference]: With dead ends: 1100 [2019-09-03 21:00:01,474 INFO L226 Difference]: Without dead ends: 1047 [2019-09-03 21:00:01,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 242 SyntacticMatches, 38 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12781 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5413, Invalid=25387, Unknown=0, NotChecked=0, Total=30800 [2019-09-03 21:00:01,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2019-09-03 21:00:01,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 190. [2019-09-03 21:00:01,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 21:00:01,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 21:00:01,484 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 21:00:01,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:01,484 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 21:00:01,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-03 21:00:01,485 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 21:00:01,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 21:00:01,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:01,485 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 13, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:01,485 INFO L418 AbstractCegarLoop]: === Iteration 184 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:01,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:01,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1445238511, now seen corresponding path program 133 times [2019-09-03 21:00:01,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:01,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:01,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:01,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:01,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:02,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1121 backedges. 476 proven. 101 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 21:00:02,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:02,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:02,027 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:02,027 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,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:02,027 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 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:02,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:02,037 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:00:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:02,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 21:00:02,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:02,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1121 backedges. 476 proven. 101 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 21:00:02,878 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:03,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1121 backedges. 476 proven. 101 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 21:00:03,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:03,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 65 [2019-09-03 21:00:03,352 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:03,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-03 21:00:03,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-03 21:00:03,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=791, Invalid=3369, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 21:00:03,353 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 65 states. [2019-09-03 21:00:06,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:06,256 INFO L93 Difference]: Finished difference Result 1159 states and 1461 transitions. [2019-09-03 21:00:06,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-03 21:00:06,257 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 152 [2019-09-03 21:00:06,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:06,259 INFO L225 Difference]: With dead ends: 1159 [2019-09-03 21:00:06,259 INFO L226 Difference]: Without dead ends: 1106 [2019-09-03 21:00:06,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 243 SyntacticMatches, 38 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11599 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4917, Invalid=23139, Unknown=0, NotChecked=0, Total=28056 [2019-09-03 21:00:06,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-03 21:00:06,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 190. [2019-09-03 21:00:06,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 21:00:06,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 21:00:06,269 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 21:00:06,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:06,269 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 21:00:06,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-03 21:00:06,269 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 21:00:06,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 21:00:06,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:06,270 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 14, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:06,270 INFO L418 AbstractCegarLoop]: === Iteration 185 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:06,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:06,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1817028592, now seen corresponding path program 134 times [2019-09-03 21:00:06,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:06,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:06,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:06,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:06,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:06,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 476 proven. 111 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 21:00:06,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:06,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:06,811 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:06,811 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:06,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:06,811 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 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:06,821 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:00:06,822 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:00:06,878 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-03 21:00:06,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:06,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 21:00:06,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:07,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 476 proven. 111 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 21:00:07,653 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:08,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 476 proven. 111 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 21:00:08,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:08,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 64 [2019-09-03 21:00:08,118 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:08,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-03 21:00:08,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-03 21:00:08,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=789, Invalid=3243, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 21:00:08,120 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 64 states. [2019-09-03 21:00:10,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:10,654 INFO L93 Difference]: Finished difference Result 1217 states and 1538 transitions. [2019-09-03 21:00:10,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-03 21:00:10,655 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 152 [2019-09-03 21:00:10,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:10,656 INFO L225 Difference]: With dead ends: 1217 [2019-09-03 21:00:10,656 INFO L226 Difference]: Without dead ends: 1164 [2019-09-03 21:00:10,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 244 SyntacticMatches, 38 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10191 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4342, Invalid=20464, Unknown=0, NotChecked=0, Total=24806 [2019-09-03 21:00:10,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2019-09-03 21:00:10,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 190. [2019-09-03 21:00:10,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 21:00:10,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 21:00:10,668 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 21:00:10,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:10,668 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 21:00:10,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-03 21:00:10,669 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 21:00:10,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 21:00:10,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:10,670 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:10,670 INFO L418 AbstractCegarLoop]: === Iteration 186 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:10,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:10,670 INFO L82 PathProgramCache]: Analyzing trace with hash -121147697, now seen corresponding path program 135 times [2019-09-03 21:00:10,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:10,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:10,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:10,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:10,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:11,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 476 proven. 123 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 21:00:11,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:11,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:11,182 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:11,183 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:11,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:11,183 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 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:11,192 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:00:11,192 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:00:11,238 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:00:11,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:11,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 21:00:11,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:11,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 476 proven. 123 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 21:00:11,974 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:12,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 476 proven. 123 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 21:00:12,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:12,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 63 [2019-09-03 21:00:12,455 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:12,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-03 21:00:12,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-03 21:00:12,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=791, Invalid=3115, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 21:00:12,456 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 63 states. [2019-09-03 21:00:14,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:14,736 INFO L93 Difference]: Finished difference Result 1274 states and 1614 transitions. [2019-09-03 21:00:14,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-03 21:00:14,737 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 152 [2019-09-03 21:00:14,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:14,739 INFO L225 Difference]: With dead ends: 1274 [2019-09-03 21:00:14,739 INFO L226 Difference]: Without dead ends: 1221 [2019-09-03 21:00:14,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 245 SyntacticMatches, 38 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8607 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3718, Invalid=17452, Unknown=0, NotChecked=0, Total=21170 [2019-09-03 21:00:14,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2019-09-03 21:00:14,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 190. [2019-09-03 21:00:14,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 21:00:14,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 21:00:14,751 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 21:00:14,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:14,752 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 21:00:14,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-03 21:00:14,752 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 21:00:14,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 21:00:14,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:14,752 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:14,752 INFO L418 AbstractCegarLoop]: === Iteration 187 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:14,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:14,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1734673456, now seen corresponding path program 136 times [2019-09-03 21:00:14,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:14,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:14,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:14,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:14,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:15,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 476 proven. 137 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 21:00:15,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:15,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:15,305 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:15,305 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:15,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:15,305 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 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:15,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:15,315 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:00:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:15,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 21:00:15,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:16,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 476 proven. 137 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 21:00:16,063 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:16,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 476 proven. 137 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 21:00:16,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:16,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 62 [2019-09-03 21:00:16,566 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:16,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-03 21:00:16,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-03 21:00:16,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=797, Invalid=2985, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 21:00:16,567 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 62 states. [2019-09-03 21:00:18,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:18,607 INFO L93 Difference]: Finished difference Result 1330 states and 1689 transitions. [2019-09-03 21:00:18,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-03 21:00:18,608 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 152 [2019-09-03 21:00:18,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:18,610 INFO L225 Difference]: With dead ends: 1330 [2019-09-03 21:00:18,610 INFO L226 Difference]: Without dead ends: 1277 [2019-09-03 21:00:18,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 246 SyntacticMatches, 38 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6909 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3081, Invalid=14211, Unknown=0, NotChecked=0, Total=17292 [2019-09-03 21:00:18,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2019-09-03 21:00:18,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 190. [2019-09-03 21:00:18,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 21:00:18,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 21:00:18,623 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 21:00:18,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:18,623 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 21:00:18,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-03 21:00:18,623 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 21:00:18,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 21:00:18,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:18,624 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:18,624 INFO L418 AbstractCegarLoop]: === Iteration 188 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:18,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:18,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1946239313, now seen corresponding path program 17 times [2019-09-03 21:00:18,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:18,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:18,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:18,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:18,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:19,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 476 proven. 153 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 21:00:19,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:19,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:19,154 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:19,154 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:19,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:19,154 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 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:19,164 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:00:19,164 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:00:19,221 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-03 21:00:19,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:19,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 21:00:19,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:19,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 476 proven. 153 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 21:00:19,902 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:20,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 476 proven. 153 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 21:00:20,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:20,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 61 [2019-09-03 21:00:20,404 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:20,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-03 21:00:20,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-03 21:00:20,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=807, Invalid=2853, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 21:00:20,405 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 61 states. [2019-09-03 21:00:21,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:21,938 INFO L93 Difference]: Finished difference Result 1388 states and 1767 transitions. [2019-09-03 21:00:21,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-03 21:00:21,939 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 152 [2019-09-03 21:00:21,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:21,941 INFO L225 Difference]: With dead ends: 1388 [2019-09-03 21:00:21,941 INFO L226 Difference]: Without dead ends: 1335 [2019-09-03 21:00:21,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 247 SyntacticMatches, 38 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5171 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2473, Invalid=10867, Unknown=0, NotChecked=0, Total=13340 [2019-09-03 21:00:21,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-09-03 21:00:21,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 192. [2019-09-03 21:00:21,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-03 21:00:21,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 212 transitions. [2019-09-03 21:00:21,955 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 212 transitions. Word has length 152 [2019-09-03 21:00:21,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:21,955 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 212 transitions. [2019-09-03 21:00:21,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-03 21:00:21,955 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 212 transitions. [2019-09-03 21:00:21,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-03 21:00:21,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:21,956 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:21,956 INFO L418 AbstractCegarLoop]: === Iteration 189 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:21,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:21,956 INFO L82 PathProgramCache]: Analyzing trace with hash -441371960, now seen corresponding path program 34 times [2019-09-03 21:00:21,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:21,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:21,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:21,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:21,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:22,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 205 proven. 442 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 21:00:22,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:22,174 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:22,174 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:22,175 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:22,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:22,175 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 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:22,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:22,185 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:00:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:22,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 21:00:22,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:22,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:22,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 205 proven. 442 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 21:00:22,267 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:22,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 205 proven. 442 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (188)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 21:00:22,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:22,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 25 [2019-09-03 21:00:22,562 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:22,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 21:00:22,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 21:00:22,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=380, Unknown=0, NotChecked=0, Total=600 [2019-09-03 21:00:22,563 INFO L87 Difference]: Start difference. First operand 192 states and 212 transitions. Second operand 25 states. [2019-09-03 21:00:22,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:22,917 INFO L93 Difference]: Finished difference Result 203 states and 224 transitions. [2019-09-03 21:00:22,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 21:00:22,917 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 153 [2019-09-03 21:00:22,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:22,918 INFO L225 Difference]: With dead ends: 203 [2019-09-03 21:00:22,918 INFO L226 Difference]: Without dead ends: 203 [2019-09-03 21:00:22,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 286 SyntacticMatches, 36 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=226, Invalid=424, Unknown=0, NotChecked=0, Total=650 [2019-09-03 21:00:22,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-03 21:00:22,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2019-09-03 21:00:22,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-03 21:00:22,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 219 transitions. [2019-09-03 21:00:22,921 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 219 transitions. Word has length 153 [2019-09-03 21:00:22,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:22,921 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 219 transitions. [2019-09-03 21:00:22,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 21:00:22,922 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 219 transitions. [2019-09-03 21:00:22,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 21:00:22,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:22,922 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:22,922 INFO L418 AbstractCegarLoop]: === Iteration 190 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:22,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:22,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1575080431, now seen corresponding path program 35 times [2019-09-03 21:00:22,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:22,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:22,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:22,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:22,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:23,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1314 backedges. 531 proven. 171 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:00:23,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:23,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:23,540 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:23,540 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:23,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:23,540 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 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:23,550 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:00:23,550 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:00:23,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-09-03 21:00:23,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:23,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 21:00:23,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:24,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1314 backedges. 531 proven. 171 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:00:24,755 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:25,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1314 backedges. 531 proven. 171 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:00:25,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:25,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 82 [2019-09-03 21:00:25,350 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:25,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-03 21:00:25,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-03 21:00:25,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1303, Invalid=5339, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 21:00:25,351 INFO L87 Difference]: Start difference. First operand 199 states and 219 transitions. Second operand 82 states. [2019-09-03 21:00:27,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:27,098 INFO L93 Difference]: Finished difference Result 331 states and 389 transitions. [2019-09-03 21:00:27,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 21:00:27,099 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2019-09-03 21:00:27,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:27,100 INFO L225 Difference]: With dead ends: 331 [2019-09-03 21:00:27,100 INFO L226 Difference]: Without dead ends: 275 [2019-09-03 21:00:27,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 242 SyntacticMatches, 40 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7463 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2723, Invalid=12039, Unknown=0, NotChecked=0, Total=14762 [2019-09-03 21:00:27,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-09-03 21:00:27,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 200. [2019-09-03 21:00:27,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 21:00:27,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-03 21:00:27,104 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-03 21:00:27,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:27,104 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-03 21:00:27,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-03 21:00:27,104 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-03 21:00:27,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 21:00:27,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:27,105 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:27,105 INFO L418 AbstractCegarLoop]: === Iteration 191 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:27,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:27,105 INFO L82 PathProgramCache]: Analyzing trace with hash 862175086, now seen corresponding path program 137 times [2019-09-03 21:00:27,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:27,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:27,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:27,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:27,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:27,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 531 proven. 154 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:00:27,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:27,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:27,715 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:27,715 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:27,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:27,715 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 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:27,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:00:27,727 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:00:27,810 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-09-03 21:00:27,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:27,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 21:00:27,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:28,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 531 proven. 154 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:00:28,956 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:29,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 531 proven. 154 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:00:29,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:29,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 81 [2019-09-03 21:00:29,518 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:29,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-03 21:00:29,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-03 21:00:29,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1246, Invalid=5234, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 21:00:29,519 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 81 states. [2019-09-03 21:00:31,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:31,550 INFO L93 Difference]: Finished difference Result 406 states and 484 transitions. [2019-09-03 21:00:31,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-03 21:00:31,551 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2019-09-03 21:00:31,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:31,552 INFO L225 Difference]: With dead ends: 406 [2019-09-03 21:00:31,552 INFO L226 Difference]: Without dead ends: 350 [2019-09-03 21:00:31,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 243 SyntacticMatches, 40 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8949 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3403, Invalid=15779, Unknown=0, NotChecked=0, Total=19182 [2019-09-03 21:00:31,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-09-03 21:00:31,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 200. [2019-09-03 21:00:31,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 21:00:31,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-03 21:00:31,555 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-03 21:00:31,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:31,556 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-03 21:00:31,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-03 21:00:31,556 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-03 21:00:31,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 21:00:31,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:31,556 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:31,557 INFO L418 AbstractCegarLoop]: === Iteration 192 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:31,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:31,557 INFO L82 PathProgramCache]: Analyzing trace with hash 423536143, now seen corresponding path program 138 times [2019-09-03 21:00:31,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:31,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:31,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:31,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:31,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:32,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 531 proven. 139 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:00:32,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:32,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:32,139 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:32,139 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:32,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:32,139 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 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:32,151 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:00:32,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:00:32,197 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:00:32,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:32,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 21:00:32,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:33,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 531 proven. 139 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:00:33,328 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:33,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 531 proven. 139 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:00:33,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:33,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 80 [2019-09-03 21:00:33,879 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:33,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-03 21:00:33,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-03 21:00:33,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1193, Invalid=5127, Unknown=0, NotChecked=0, Total=6320 [2019-09-03 21:00:33,881 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 80 states. [2019-09-03 21:00:36,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:36,122 INFO L93 Difference]: Finished difference Result 480 states and 578 transitions. [2019-09-03 21:00:36,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-03 21:00:36,122 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 160 [2019-09-03 21:00:36,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:36,123 INFO L225 Difference]: With dead ends: 480 [2019-09-03 21:00:36,123 INFO L226 Difference]: Without dead ends: 424 [2019-09-03 21:00:36,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 244 SyntacticMatches, 40 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10506 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4123, Invalid=19439, Unknown=0, NotChecked=0, Total=23562 [2019-09-03 21:00:36,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-09-03 21:00:36,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 200. [2019-09-03 21:00:36,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 21:00:36,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-03 21:00:36,127 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-03 21:00:36,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:36,128 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-03 21:00:36,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-03 21:00:36,128 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-03 21:00:36,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 21:00:36,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:36,129 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 15, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:36,129 INFO L418 AbstractCegarLoop]: === Iteration 193 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:36,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:36,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1391728818, now seen corresponding path program 139 times [2019-09-03 21:00:36,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:36,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:36,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:36,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:36,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:36,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:36,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1269 backedges. 531 proven. 126 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:00:36,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:36,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:36,723 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:36,723 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:36,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:36,723 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 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:36,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:36,736 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:00:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:36,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 21:00:36,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:37,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1269 backedges. 531 proven. 126 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:00:37,861 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:38,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1269 backedges. 531 proven. 126 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:00:38,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:38,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 79 [2019-09-03 21:00:38,424 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:38,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-03 21:00:38,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-03 21:00:38,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1144, Invalid=5018, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 21:00:38,427 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 79 states. [2019-09-03 21:00:41,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:41,358 INFO L93 Difference]: Finished difference Result 553 states and 671 transitions. [2019-09-03 21:00:41,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-03 21:00:41,359 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 160 [2019-09-03 21:00:41,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:41,360 INFO L225 Difference]: With dead ends: 553 [2019-09-03 21:00:41,360 INFO L226 Difference]: Without dead ends: 497 [2019-09-03 21:00:41,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 245 SyntacticMatches, 40 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12042 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4838, Invalid=22884, Unknown=0, NotChecked=0, Total=27722 [2019-09-03 21:00:41,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-09-03 21:00:41,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 200. [2019-09-03 21:00:41,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 21:00:41,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-03 21:00:41,366 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-03 21:00:41,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:41,366 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-03 21:00:41,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-03 21:00:41,367 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-03 21:00:41,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 21:00:41,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:41,367 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 14, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:41,367 INFO L418 AbstractCegarLoop]: === Iteration 194 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:41,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:41,368 INFO L82 PathProgramCache]: Analyzing trace with hash 2013397551, now seen corresponding path program 140 times [2019-09-03 21:00:41,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:41,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:41,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:41,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:41,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:41,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 531 proven. 115 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:00:41,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:41,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:41,964 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:41,964 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:41,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:41,964 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 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:41,975 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:00:41,975 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:00:42,035 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-09-03 21:00:42,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:42,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 21:00:42,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:43,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 531 proven. 115 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:00:43,100 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:43,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 531 proven. 115 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:00:43,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:43,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 78 [2019-09-03 21:00:43,668 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:43,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-03 21:00:43,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-03 21:00:43,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1099, Invalid=4907, Unknown=0, NotChecked=0, Total=6006 [2019-09-03 21:00:43,670 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 78 states. [2019-09-03 21:00:46,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:46,279 INFO L93 Difference]: Finished difference Result 625 states and 763 transitions. [2019-09-03 21:00:46,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-03 21:00:46,279 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 160 [2019-09-03 21:00:46,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:46,280 INFO L225 Difference]: With dead ends: 625 [2019-09-03 21:00:46,280 INFO L226 Difference]: Without dead ends: 569 [2019-09-03 21:00:46,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 246 SyntacticMatches, 40 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13477 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5509, Invalid=25997, Unknown=0, NotChecked=0, Total=31506 [2019-09-03 21:00:46,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-09-03 21:00:46,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 200. [2019-09-03 21:00:46,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 21:00:46,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-03 21:00:46,286 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-03 21:00:46,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:46,286 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-03 21:00:46,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-03 21:00:46,286 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-03 21:00:46,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 21:00:46,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:46,287 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 13, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:46,287 INFO L418 AbstractCegarLoop]: === Iteration 195 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:46,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:46,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1201895634, now seen corresponding path program 141 times [2019-09-03 21:00:46,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:46,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:46,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:46,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:46,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:46,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1249 backedges. 531 proven. 106 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:00:46,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:46,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:46,873 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:46,873 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:46,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:46,873 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 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:46,884 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:00:46,884 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:00:46,934 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:00:46,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:46,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 21:00:46,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:47,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1249 backedges. 531 proven. 106 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:00:47,983 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:48,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1249 backedges. 531 proven. 106 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:00:48,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:48,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 77 [2019-09-03 21:00:48,530 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:48,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-03 21:00:48,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-03 21:00:48,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1058, Invalid=4794, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 21:00:48,531 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 77 states. [2019-09-03 21:00:51,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:51,794 INFO L93 Difference]: Finished difference Result 696 states and 854 transitions. [2019-09-03 21:00:51,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-09-03 21:00:51,794 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 160 [2019-09-03 21:00:51,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:51,796 INFO L225 Difference]: With dead ends: 696 [2019-09-03 21:00:51,796 INFO L226 Difference]: Without dead ends: 640 [2019-09-03 21:00:51,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 247 SyntacticMatches, 40 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14743 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6103, Invalid=28679, Unknown=0, NotChecked=0, Total=34782 [2019-09-03 21:00:51,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-09-03 21:00:51,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 200. [2019-09-03 21:00:51,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 21:00:51,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-03 21:00:51,802 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-03 21:00:51,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:51,802 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-03 21:00:51,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-03 21:00:51,803 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-03 21:00:51,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 21:00:51,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:51,803 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 12, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:51,803 INFO L418 AbstractCegarLoop]: === Iteration 196 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:51,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:51,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1305614769, now seen corresponding path program 142 times [2019-09-03 21:00:51,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:51,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:51,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:51,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:51,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:52,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 531 proven. 99 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:00:52,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:52,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:52,390 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:52,390 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:52,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:52,390 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 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:52,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:52,402 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:00:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:52,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 21:00:52,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:53,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 531 proven. 99 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:00:53,463 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:54,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 531 proven. 99 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:00:54,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:54,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 76 [2019-09-03 21:00:54,025 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:54,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-03 21:00:54,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-03 21:00:54,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1021, Invalid=4679, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 21:00:54,026 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 76 states. [2019-09-03 21:00:57,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:57,772 INFO L93 Difference]: Finished difference Result 766 states and 944 transitions. [2019-09-03 21:00:57,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-09-03 21:00:57,773 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 160 [2019-09-03 21:00:57,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:57,774 INFO L225 Difference]: With dead ends: 766 [2019-09-03 21:00:57,774 INFO L226 Difference]: Without dead ends: 710 [2019-09-03 21:00:57,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 248 SyntacticMatches, 40 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15784 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6593, Invalid=30849, Unknown=0, NotChecked=0, Total=37442 [2019-09-03 21:00:57,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-09-03 21:00:57,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 200. [2019-09-03 21:00:57,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 21:00:57,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-03 21:00:57,780 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-03 21:00:57,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:57,781 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-03 21:00:57,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-03 21:00:57,781 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-03 21:00:57,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 21:00:57,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:57,781 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 11, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:57,782 INFO L418 AbstractCegarLoop]: === Iteration 197 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:57,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:57,782 INFO L82 PathProgramCache]: Analyzing trace with hash 353607438, now seen corresponding path program 143 times [2019-09-03 21:00:57,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:57,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:57,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:57,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:57,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:58,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1237 backedges. 531 proven. 94 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:00:58,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:58,341 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:58,342 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:58,342 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:58,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:58,342 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 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:58,351 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:00:58,351 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:00:58,410 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-09-03 21:00:58,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:58,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 21:00:58,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:59,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1237 backedges. 531 proven. 94 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:00:59,390 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:59,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1237 backedges. 531 proven. 94 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:00:59,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:59,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 75 [2019-09-03 21:00:59,924 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:59,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-03 21:00:59,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-03 21:00:59,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=988, Invalid=4562, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 21:00:59,926 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 75 states. [2019-09-03 21:01:03,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:03,711 INFO L93 Difference]: Finished difference Result 835 states and 1033 transitions. [2019-09-03 21:01:03,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-09-03 21:01:03,712 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 160 [2019-09-03 21:01:03,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:03,713 INFO L225 Difference]: With dead ends: 835 [2019-09-03 21:01:03,713 INFO L226 Difference]: Without dead ends: 779 [2019-09-03 21:01:03,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 249 SyntacticMatches, 40 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16556 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6958, Invalid=32444, Unknown=0, NotChecked=0, Total=39402 [2019-09-03 21:01:03,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-09-03 21:01:03,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 200. [2019-09-03 21:01:03,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 21:01:03,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-03 21:01:03,722 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-03 21:01:03,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:03,722 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-03 21:01:03,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-03 21:01:03,722 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-03 21:01:03,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 21:01:03,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:03,723 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 10, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:03,723 INFO L418 AbstractCegarLoop]: === Iteration 198 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:03,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:03,724 INFO L82 PathProgramCache]: Analyzing trace with hash 407130735, now seen corresponding path program 144 times [2019-09-03 21:01:03,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:03,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:03,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:01:03,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:03,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1234 backedges. 531 proven. 91 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:01:04,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:04,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:04,300 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:04,300 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:01:04,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:04,300 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 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:04,310 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:01:04,310 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:01:04,360 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:01:04,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:01:04,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 21:01:04,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:05,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1234 backedges. 531 proven. 91 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:01:05,325 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:05,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1234 backedges. 531 proven. 91 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:01:05,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:05,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 74 [2019-09-03 21:01:05,870 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:05,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-03 21:01:05,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-03 21:01:05,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=959, Invalid=4443, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 21:01:05,871 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 74 states. [2019-09-03 21:01:09,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:09,918 INFO L93 Difference]: Finished difference Result 903 states and 1121 transitions. [2019-09-03 21:01:09,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-09-03 21:01:09,919 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 160 [2019-09-03 21:01:09,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:09,920 INFO L225 Difference]: With dead ends: 903 [2019-09-03 21:01:09,920 INFO L226 Difference]: Without dead ends: 847 [2019-09-03 21:01:09,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 250 SyntacticMatches, 40 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17027 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7183, Invalid=33419, Unknown=0, NotChecked=0, Total=40602 [2019-09-03 21:01:09,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2019-09-03 21:01:09,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 200. [2019-09-03 21:01:09,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 21:01:09,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-03 21:01:09,929 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-03 21:01:09,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:09,929 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-03 21:01:09,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-03 21:01:09,929 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-03 21:01:09,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 21:01:09,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:09,930 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:09,930 INFO L418 AbstractCegarLoop]: === Iteration 199 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:09,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:09,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1517235950, now seen corresponding path program 145 times [2019-09-03 21:01:09,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:09,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:09,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:01:09,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:09,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:10,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1233 backedges. 531 proven. 90 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:01:10,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:10,491 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:10,491 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:10,491 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:01:10,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:10,491 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 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:10,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:01:10,500 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:01:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:10,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 21:01:10,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:11,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1233 backedges. 531 proven. 90 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:01:11,503 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:12,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1233 backedges. 531 proven. 90 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:01:12,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:12,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 73 [2019-09-03 21:01:12,024 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:12,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-03 21:01:12,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-03 21:01:12,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=934, Invalid=4322, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 21:01:12,025 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 73 states. [2019-09-03 21:01:15,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:15,824 INFO L93 Difference]: Finished difference Result 970 states and 1208 transitions. [2019-09-03 21:01:15,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2019-09-03 21:01:15,824 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 160 [2019-09-03 21:01:15,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:15,826 INFO L225 Difference]: With dead ends: 970 [2019-09-03 21:01:15,826 INFO L226 Difference]: Without dead ends: 914 [2019-09-03 21:01:15,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 251 SyntacticMatches, 40 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17177 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7259, Invalid=33747, Unknown=0, NotChecked=0, Total=41006 [2019-09-03 21:01:15,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-09-03 21:01:15,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 200. [2019-09-03 21:01:15,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 21:01:15,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-03 21:01:15,835 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-03 21:01:15,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:15,835 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-03 21:01:15,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-03 21:01:15,835 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-03 21:01:15,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 21:01:15,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:15,836 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 10, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:15,836 INFO L418 AbstractCegarLoop]: === Iteration 200 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:15,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:15,836 INFO L82 PathProgramCache]: Analyzing trace with hash 860309135, now seen corresponding path program 146 times [2019-09-03 21:01:15,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:15,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:15,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:01:15,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:15,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:16,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1234 backedges. 531 proven. 91 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:01:16,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:16,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:16,416 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:16,416 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:01:16,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:16,416 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 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:16,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:01:16,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:01:16,485 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-09-03 21:01:16,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:01:16,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 21:01:16,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:17,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1234 backedges. 531 proven. 91 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:01:17,406 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:17,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1234 backedges. 531 proven. 91 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:01:17,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:17,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 72 [2019-09-03 21:01:17,932 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:17,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-03 21:01:17,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-03 21:01:17,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=913, Invalid=4199, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 21:01:17,934 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 72 states. [2019-09-03 21:01:21,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:21,907 INFO L93 Difference]: Finished difference Result 1036 states and 1294 transitions. [2019-09-03 21:01:21,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-09-03 21:01:21,908 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 160 [2019-09-03 21:01:21,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:21,909 INFO L225 Difference]: With dead ends: 1036 [2019-09-03 21:01:21,909 INFO L226 Difference]: Without dead ends: 980 [2019-09-03 21:01:21,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 252 SyntacticMatches, 40 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16997 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7183, Invalid=33419, Unknown=0, NotChecked=0, Total=40602 [2019-09-03 21:01:21,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2019-09-03 21:01:21,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 200. [2019-09-03 21:01:21,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 21:01:21,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-03 21:01:21,918 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-03 21:01:21,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:21,918 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-03 21:01:21,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-03 21:01:21,918 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-03 21:01:21,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 21:01:21,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:21,919 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 11, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:21,919 INFO L418 AbstractCegarLoop]: === Iteration 201 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:21,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:21,919 INFO L82 PathProgramCache]: Analyzing trace with hash -684902706, now seen corresponding path program 147 times [2019-09-03 21:01:21,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:21,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:21,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:01:21,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:21,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:22,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1237 backedges. 531 proven. 94 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:01:22,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:22,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:22,470 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:22,470 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:01:22,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:22,471 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 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:22,480 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:01:22,480 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:01:22,528 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:01:22,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:01:22,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 21:01:22,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:23,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1237 backedges. 531 proven. 94 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:01:23,434 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:23,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1237 backedges. 531 proven. 94 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:01:23,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:23,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 71 [2019-09-03 21:01:23,986 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:23,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-03 21:01:23,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-03 21:01:23,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=896, Invalid=4074, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 21:01:23,987 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 71 states. [2019-09-03 21:01:27,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:27,555 INFO L93 Difference]: Finished difference Result 1101 states and 1379 transitions. [2019-09-03 21:01:27,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2019-09-03 21:01:27,555 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 160 [2019-09-03 21:01:27,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:27,557 INFO L225 Difference]: With dead ends: 1101 [2019-09-03 21:01:27,557 INFO L226 Difference]: Without dead ends: 1045 [2019-09-03 21:01:27,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 253 SyntacticMatches, 40 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16484 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6958, Invalid=32444, Unknown=0, NotChecked=0, Total=39402 [2019-09-03 21:01:27,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-09-03 21:01:27,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 200. [2019-09-03 21:01:27,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 21:01:27,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-03 21:01:27,567 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-03 21:01:27,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:27,567 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-03 21:01:27,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-03 21:01:27,568 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-03 21:01:27,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 21:01:27,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:27,568 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 12, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:27,568 INFO L418 AbstractCegarLoop]: === Iteration 202 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:27,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:27,569 INFO L82 PathProgramCache]: Analyzing trace with hash -457653585, now seen corresponding path program 148 times [2019-09-03 21:01:27,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:27,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:27,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:01:27,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:27,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:28,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 531 proven. 99 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:01:28,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:28,120 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:28,120 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:28,120 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:01:28,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:28,120 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 201 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 201 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:28,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:01:28,130 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:01:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:28,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 21:01:28,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:29,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 531 proven. 99 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:01:29,061 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:29,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 531 proven. 99 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:01:29,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:29,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 70 [2019-09-03 21:01:29,593 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:29,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-03 21:01:29,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-03 21:01:29,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=883, Invalid=3947, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 21:01:29,594 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 70 states. [2019-09-03 21:01:33,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:33,123 INFO L93 Difference]: Finished difference Result 1165 states and 1463 transitions. [2019-09-03 21:01:33,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-09-03 21:01:33,123 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 160 [2019-09-03 21:01:33,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:33,125 INFO L225 Difference]: With dead ends: 1165 [2019-09-03 21:01:33,125 INFO L226 Difference]: Without dead ends: 1109 [2019-09-03 21:01:33,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 254 SyntacticMatches, 40 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15646 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6593, Invalid=30849, Unknown=0, NotChecked=0, Total=37442 [2019-09-03 21:01:33,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-03 21:01:33,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 200. [2019-09-03 21:01:33,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 21:01:33,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-03 21:01:33,136 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-03 21:01:33,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:33,136 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-03 21:01:33,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-03 21:01:33,136 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-03 21:01:33,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 21:01:33,137 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:33,137 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 13, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:33,137 INFO L418 AbstractCegarLoop]: === Iteration 203 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:33,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:33,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1904981678, now seen corresponding path program 149 times [2019-09-03 21:01:33,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:33,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:33,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:01:33,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:33,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1249 backedges. 531 proven. 106 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:01:33,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:33,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:33,698 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:33,698 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:01:33,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:33,698 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 202 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 202 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:33,709 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:01:33,709 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:01:33,775 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-09-03 21:01:33,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:01:33,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 21:01:33,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:34,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1249 backedges. 531 proven. 106 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:01:34,653 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:35,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1249 backedges. 531 proven. 106 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:01:35,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:35,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 69 [2019-09-03 21:01:35,169 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:35,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-03 21:01:35,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-03 21:01:35,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=874, Invalid=3818, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 21:01:35,170 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 69 states. [2019-09-03 21:01:38,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:38,661 INFO L93 Difference]: Finished difference Result 1228 states and 1546 transitions. [2019-09-03 21:01:38,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-09-03 21:01:38,662 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 160 [2019-09-03 21:01:38,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:38,664 INFO L225 Difference]: With dead ends: 1228 [2019-09-03 21:01:38,664 INFO L226 Difference]: Without dead ends: 1172 [2019-09-03 21:01:38,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 255 SyntacticMatches, 40 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14503 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6103, Invalid=28679, Unknown=0, NotChecked=0, Total=34782 [2019-09-03 21:01:38,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2019-09-03 21:01:38,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 200. [2019-09-03 21:01:38,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 21:01:38,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-03 21:01:38,675 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-03 21:01:38,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:38,675 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-03 21:01:38,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-03 21:01:38,675 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-03 21:01:38,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 21:01:38,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:38,676 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 14, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:38,676 INFO L418 AbstractCegarLoop]: === Iteration 204 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:38,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:38,676 INFO L82 PathProgramCache]: Analyzing trace with hash -2036676913, now seen corresponding path program 150 times [2019-09-03 21:01:38,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:38,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:38,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:01:38,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:38,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:39,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 531 proven. 115 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:01:39,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:39,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:39,241 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:39,241 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:01:39,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:39,242 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 203 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 203 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:39,252 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:01:39,252 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:01:39,301 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:01:39,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:01:39,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 21:01:39,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:40,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 531 proven. 115 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:01:40,144 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:40,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 531 proven. 115 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:01:40,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:40,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 68 [2019-09-03 21:01:40,667 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:40,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-03 21:01:40,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-03 21:01:40,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=869, Invalid=3687, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 21:01:40,668 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 68 states. [2019-09-03 21:01:44,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:44,045 INFO L93 Difference]: Finished difference Result 1290 states and 1628 transitions. [2019-09-03 21:01:44,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-09-03 21:01:44,046 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 160 [2019-09-03 21:01:44,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:44,048 INFO L225 Difference]: With dead ends: 1290 [2019-09-03 21:01:44,048 INFO L226 Difference]: Without dead ends: 1234 [2019-09-03 21:01:44,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 256 SyntacticMatches, 40 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13087 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5509, Invalid=25997, Unknown=0, NotChecked=0, Total=31506 [2019-09-03 21:01:44,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2019-09-03 21:01:44,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 200. [2019-09-03 21:01:44,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 21:01:44,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-03 21:01:44,060 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-03 21:01:44,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:44,060 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-03 21:01:44,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-03 21:01:44,060 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-03 21:01:44,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 21:01:44,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:44,061 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 15, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:44,061 INFO L418 AbstractCegarLoop]: === Iteration 205 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:44,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:44,061 INFO L82 PathProgramCache]: Analyzing trace with hash -2025279858, now seen corresponding path program 151 times [2019-09-03 21:01:44,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:44,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:44,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:01:44,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:44,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:44,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1269 backedges. 531 proven. 126 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:01:44,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:44,613 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:44,614 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:44,614 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:01:44,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:44,614 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 204 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 204 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:44,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:01:44,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:01:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:44,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 21:01:44,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:45,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1269 backedges. 531 proven. 126 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:01:45,510 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:46,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1269 backedges. 531 proven. 126 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:01:46,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:46,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 67 [2019-09-03 21:01:46,061 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:46,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-03 21:01:46,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-03 21:01:46,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=868, Invalid=3554, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 21:01:46,062 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 67 states. [2019-09-03 21:01:49,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:49,059 INFO L93 Difference]: Finished difference Result 1351 states and 1709 transitions. [2019-09-03 21:01:49,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-09-03 21:01:49,060 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 160 [2019-09-03 21:01:49,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:49,062 INFO L225 Difference]: With dead ends: 1351 [2019-09-03 21:01:49,062 INFO L226 Difference]: Without dead ends: 1295 [2019-09-03 21:01:49,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 257 SyntacticMatches, 40 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11442 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4838, Invalid=22884, Unknown=0, NotChecked=0, Total=27722 [2019-09-03 21:01:49,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2019-09-03 21:01:49,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 200. [2019-09-03 21:01:49,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 21:01:49,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-03 21:01:49,076 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-03 21:01:49,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:49,076 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-03 21:01:49,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-03 21:01:49,076 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-03 21:01:49,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 21:01:49,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:49,077 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:49,077 INFO L418 AbstractCegarLoop]: === Iteration 206 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:49,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:49,077 INFO L82 PathProgramCache]: Analyzing trace with hash 191845103, now seen corresponding path program 152 times [2019-09-03 21:01:49,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:49,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:49,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:01:49,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:49,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:49,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 531 proven. 139 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:01:49,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:49,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:49,670 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:49,670 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:01:49,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:49,670 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 205 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 205 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:49,680 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:01:49,680 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:01:49,739 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-09-03 21:01:49,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:01:49,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 21:01:49,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:50,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 531 proven. 139 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:01:50,511 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:51,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 531 proven. 139 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:01:51,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:51,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 66 [2019-09-03 21:01:51,035 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:51,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-03 21:01:51,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-03 21:01:51,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=871, Invalid=3419, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 21:01:51,036 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 66 states. [2019-09-03 21:01:53,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:53,677 INFO L93 Difference]: Finished difference Result 1411 states and 1789 transitions. [2019-09-03 21:01:53,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-03 21:01:53,678 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 160 [2019-09-03 21:01:53,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:53,680 INFO L225 Difference]: With dead ends: 1411 [2019-09-03 21:01:53,680 INFO L226 Difference]: Without dead ends: 1355 [2019-09-03 21:01:53,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 258 SyntacticMatches, 40 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9624 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4123, Invalid=19439, Unknown=0, NotChecked=0, Total=23562 [2019-09-03 21:01:53,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2019-09-03 21:01:53,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 200. [2019-09-03 21:01:53,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 21:01:53,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-03 21:01:53,693 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-03 21:01:53,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:53,693 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-03 21:01:53,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-03 21:01:53,693 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-03 21:01:53,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 21:01:53,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:53,694 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:53,694 INFO L418 AbstractCegarLoop]: === Iteration 207 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:53,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:53,694 INFO L82 PathProgramCache]: Analyzing trace with hash -845013394, now seen corresponding path program 153 times [2019-09-03 21:01:53,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:53,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:53,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:01:53,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:53,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:54,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 531 proven. 154 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:01:54,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:54,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:54,260 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:54,260 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:01:54,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:54,260 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 206 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 206 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:54,270 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:01:54,270 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:01:54,320 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:01:54,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:01:54,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 21:01:54,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:55,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 531 proven. 154 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:01:55,104 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:55,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 531 proven. 154 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:01:55,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:55,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 65 [2019-09-03 21:01:55,638 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:55,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-03 21:01:55,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-03 21:01:55,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=878, Invalid=3282, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 21:01:55,639 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 65 states. [2019-09-03 21:01:57,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:57,945 INFO L93 Difference]: Finished difference Result 1470 states and 1868 transitions. [2019-09-03 21:01:57,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-03 21:01:57,946 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 160 [2019-09-03 21:01:57,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:57,948 INFO L225 Difference]: With dead ends: 1470 [2019-09-03 21:01:57,948 INFO L226 Difference]: Without dead ends: 1414 [2019-09-03 21:01:57,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 259 SyntacticMatches, 40 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7701 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3403, Invalid=15779, Unknown=0, NotChecked=0, Total=19182 [2019-09-03 21:01:57,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2019-09-03 21:01:57,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 200. [2019-09-03 21:01:57,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 21:01:57,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-03 21:01:57,962 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-03 21:01:57,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:57,963 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-03 21:01:57,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-03 21:01:57,963 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-03 21:01:57,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 21:01:57,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:57,963 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:57,963 INFO L418 AbstractCegarLoop]: === Iteration 208 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:57,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:57,964 INFO L82 PathProgramCache]: Analyzing trace with hash 507012879, now seen corresponding path program 18 times [2019-09-03 21:01:57,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:57,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:57,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:01:57,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:57,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:58,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1314 backedges. 531 proven. 171 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:01:58,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:58,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:58,580 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:58,580 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:01:58,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:58,580 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 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:58,591 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:01:58,591 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:01:58,639 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:01:58,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:01:58,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 21:01:58,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:59,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1314 backedges. 531 proven. 171 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:01:59,383 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:59,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1314 backedges. 531 proven. 171 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:01:59,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:59,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 64 [2019-09-03 21:01:59,920 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:59,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-03 21:01:59,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-03 21:01:59,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=889, Invalid=3143, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 21:01:59,921 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 64 states. [2019-09-03 21:02:01,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:01,660 INFO L93 Difference]: Finished difference Result 1531 states and 1950 transitions. [2019-09-03 21:02:01,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-03 21:02:01,660 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 160 [2019-09-03 21:02:01,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:01,663 INFO L225 Difference]: With dead ends: 1531 [2019-09-03 21:02:01,663 INFO L226 Difference]: Without dead ends: 1475 [2019-09-03 21:02:01,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 260 SyntacticMatches, 40 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5753 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2723, Invalid=12039, Unknown=0, NotChecked=0, Total=14762 [2019-09-03 21:02:01,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2019-09-03 21:02:01,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 202. [2019-09-03 21:02:01,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-03 21:02:01,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 223 transitions. [2019-09-03 21:02:01,677 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 223 transitions. Word has length 160 [2019-09-03 21:02:01,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:01,677 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 223 transitions. [2019-09-03 21:02:01,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-03 21:02:01,677 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 223 transitions. [2019-09-03 21:02:01,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-03 21:02:01,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:01,678 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:01,678 INFO L418 AbstractCegarLoop]: === Iteration 209 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:01,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:01,678 INFO L82 PathProgramCache]: Analyzing trace with hash -766547577, now seen corresponding path program 36 times [2019-09-03 21:02:01,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:01,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:01,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:02:01,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:01,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:01,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:01,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 226 proven. 495 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:02:01,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:01,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:01,898 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:01,898 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:02:01,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:01,898 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 208 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 208 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:01,907 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:02:01,907 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:02:01,957 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:02:01,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:02:01,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 21:02:01,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:01,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:01,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 226 proven. 495 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:02:01,997 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:02,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 226 proven. 495 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 21:02:02,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:02,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 26 [2019-09-03 21:02:02,312 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:02,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 21:02:02,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 21:02:02,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=409, Unknown=0, NotChecked=0, Total=650 [2019-09-03 21:02:02,313 INFO L87 Difference]: Start difference. First operand 202 states and 223 transitions. Second operand 26 states. [2019-09-03 21:02:02,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:02,675 INFO L93 Difference]: Finished difference Result 213 states and 235 transitions. [2019-09-03 21:02:02,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 21:02:02,676 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 161 [2019-09-03 21:02:02,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:02,676 INFO L225 Difference]: With dead ends: 213 [2019-09-03 21:02:02,677 INFO L226 Difference]: Without dead ends: 213 [2019-09-03 21:02:02,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 301 SyntacticMatches, 38 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=247, Invalid=455, Unknown=0, NotChecked=0, Total=702 [2019-09-03 21:02:02,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-03 21:02:02,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 209. [2019-09-03 21:02:02,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-09-03 21:02:02,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 230 transitions. [2019-09-03 21:02:02,680 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 230 transitions. Word has length 161 [2019-09-03 21:02:02,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:02,680 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 230 transitions. [2019-09-03 21:02:02,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 21:02:02,680 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 230 transitions. [2019-09-03 21:02:02,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-03 21:02:02,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:02,681 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:02,681 INFO L418 AbstractCegarLoop]: === Iteration 210 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:02,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:02,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1543809456, now seen corresponding path program 37 times [2019-09-03 21:02:02,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:02,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:02,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:02:02,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:02,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:03,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 589 proven. 190 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:02:03,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:03,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:03,352 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:03,352 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:02:03,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:03,352 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 209 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 209 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:03,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:02:03,376 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:02:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:03,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 21:02:03,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:04,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 589 proven. 190 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:02:04,687 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:05,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 589 proven. 190 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:02:05,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:05,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 86 [2019-09-03 21:02:05,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:05,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-03 21:02:05,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-03 21:02:05,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=5879, Unknown=0, NotChecked=0, Total=7310 [2019-09-03 21:02:05,306 INFO L87 Difference]: Start difference. First operand 209 states and 230 transitions. Second operand 86 states. [2019-09-03 21:02:07,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:07,302 INFO L93 Difference]: Finished difference Result 348 states and 409 transitions. [2019-09-03 21:02:07,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-03 21:02:07,302 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2019-09-03 21:02:07,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:07,303 INFO L225 Difference]: With dead ends: 348 [2019-09-03 21:02:07,303 INFO L226 Difference]: Without dead ends: 289 [2019-09-03 21:02:07,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 254 SyntacticMatches, 42 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8266 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2985, Invalid=13271, Unknown=0, NotChecked=0, Total=16256 [2019-09-03 21:02:07,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-09-03 21:02:07,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 210. [2019-09-03 21:02:07,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-03 21:02:07,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-03 21:02:07,307 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-03 21:02:07,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:07,307 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-03 21:02:07,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-03 21:02:07,307 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-03 21:02:07,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-03 21:02:07,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:07,308 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:07,308 INFO L418 AbstractCegarLoop]: === Iteration 211 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:07,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:07,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1362318543, now seen corresponding path program 154 times [2019-09-03 21:02:07,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:07,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:07,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:02:07,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:07,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:07,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 589 proven. 172 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:02:07,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:07,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:07,962 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:07,962 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:02:07,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:07,962 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 210 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 210 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:07,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:02:07,972 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:02:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:08,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 21:02:08,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:09,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 589 proven. 172 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:02:09,356 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:09,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 589 proven. 172 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:02:09,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:09,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 85 [2019-09-03 21:02:09,988 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:09,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-03 21:02:09,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-03 21:02:09,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1371, Invalid=5769, Unknown=0, NotChecked=0, Total=7140 [2019-09-03 21:02:09,989 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 85 states. [2019-09-03 21:02:11,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:11,991 INFO L93 Difference]: Finished difference Result 427 states and 509 transitions. [2019-09-03 21:02:11,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-03 21:02:11,992 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2019-09-03 21:02:11,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:11,993 INFO L225 Difference]: With dead ends: 427 [2019-09-03 21:02:11,993 INFO L226 Difference]: Without dead ends: 368 [2019-09-03 21:02:11,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 255 SyntacticMatches, 42 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9930 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3741, Invalid=17429, Unknown=0, NotChecked=0, Total=21170 [2019-09-03 21:02:11,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-09-03 21:02:11,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 210. [2019-09-03 21:02:11,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-03 21:02:11,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-03 21:02:11,998 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-03 21:02:11,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:11,998 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-03 21:02:11,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-03 21:02:11,998 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-03 21:02:11,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-03 21:02:11,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:11,999 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 17, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:11,999 INFO L418 AbstractCegarLoop]: === Iteration 212 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:11,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:11,999 INFO L82 PathProgramCache]: Analyzing trace with hash 2010253936, now seen corresponding path program 155 times [2019-09-03 21:02:11,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:11,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:11,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:02:11,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:12,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:12,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 589 proven. 156 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:02:12,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:12,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:12,660 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:12,660 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:02:12,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:12,660 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 211 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 211 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:12,670 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:02:12,670 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:02:12,731 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-03 21:02:12,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:02:12,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 21:02:12,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:13,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 589 proven. 156 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:02:13,963 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:14,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 589 proven. 156 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:02:14,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:14,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 84 [2019-09-03 21:02:14,569 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:14,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-03 21:02:14,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-03 21:02:14,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1315, Invalid=5657, Unknown=0, NotChecked=0, Total=6972 [2019-09-03 21:02:14,570 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 84 states. [2019-09-03 21:02:17,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:17,391 INFO L93 Difference]: Finished difference Result 505 states and 608 transitions. [2019-09-03 21:02:17,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-03 21:02:17,392 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 168 [2019-09-03 21:02:17,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:17,393 INFO L225 Difference]: With dead ends: 505 [2019-09-03 21:02:17,393 INFO L226 Difference]: Without dead ends: 446 [2019-09-03 21:02:17,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 256 SyntacticMatches, 42 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11688 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4549, Invalid=21533, Unknown=0, NotChecked=0, Total=26082 [2019-09-03 21:02:17,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-09-03 21:02:17,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 210. [2019-09-03 21:02:17,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-03 21:02:17,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-03 21:02:17,398 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-03 21:02:17,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:17,398 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-03 21:02:17,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-03 21:02:17,398 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-03 21:02:17,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-03 21:02:17,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:17,399 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 16, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:17,399 INFO L418 AbstractCegarLoop]: === Iteration 213 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:17,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:17,399 INFO L82 PathProgramCache]: Analyzing trace with hash -878338897, now seen corresponding path program 156 times [2019-09-03 21:02:17,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:17,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:17,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:02:17,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:17,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:18,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 589 proven. 142 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:02:18,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:18,041 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:18,041 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:18,041 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:02:18,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:18,041 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 212 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 212 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:18,051 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:02:18,051 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:02:18,102 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:02:18,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:02:18,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 21:02:18,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:19,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 589 proven. 142 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:02:19,316 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:19,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 589 proven. 142 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:02:19,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:19,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 83 [2019-09-03 21:02:19,924 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:19,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-03 21:02:19,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-03 21:02:19,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1263, Invalid=5543, Unknown=0, NotChecked=0, Total=6806 [2019-09-03 21:02:19,925 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 83 states. [2019-09-03 21:02:23,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:23,212 INFO L93 Difference]: Finished difference Result 582 states and 706 transitions. [2019-09-03 21:02:23,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-03 21:02:23,213 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 168 [2019-09-03 21:02:23,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:23,214 INFO L225 Difference]: With dead ends: 582 [2019-09-03 21:02:23,214 INFO L226 Difference]: Without dead ends: 523 [2019-09-03 21:02:23,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 257 SyntacticMatches, 42 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13442 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5361, Invalid=25439, Unknown=0, NotChecked=0, Total=30800 [2019-09-03 21:02:23,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-09-03 21:02:23,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 210. [2019-09-03 21:02:23,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-03 21:02:23,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-03 21:02:23,219 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-03 21:02:23,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:23,220 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-03 21:02:23,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-03 21:02:23,220 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-03 21:02:23,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-03 21:02:23,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:23,220 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 15, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:23,221 INFO L418 AbstractCegarLoop]: === Iteration 214 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:23,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:23,221 INFO L82 PathProgramCache]: Analyzing trace with hash -2079897968, now seen corresponding path program 157 times [2019-09-03 21:02:23,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:23,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:23,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:02:23,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:23,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:23,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 589 proven. 130 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:02:23,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:23,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:23,849 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:23,849 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:02:23,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:23,849 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 213 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 213 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:23,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:02:23,859 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:02:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:23,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 21:02:23,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:25,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 589 proven. 130 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:02:25,065 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:25,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 589 proven. 130 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:02:25,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:25,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 82 [2019-09-03 21:02:25,685 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:25,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-03 21:02:25,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-03 21:02:25,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1215, Invalid=5427, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 21:02:25,686 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 82 states. [2019-09-03 21:02:28,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:28,556 INFO L93 Difference]: Finished difference Result 658 states and 803 transitions. [2019-09-03 21:02:28,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-09-03 21:02:28,557 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 168 [2019-09-03 21:02:28,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:28,558 INFO L225 Difference]: With dead ends: 658 [2019-09-03 21:02:28,558 INFO L226 Difference]: Without dead ends: 599 [2019-09-03 21:02:28,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 258 SyntacticMatches, 42 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15106 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6135, Invalid=29021, Unknown=0, NotChecked=0, Total=35156 [2019-09-03 21:02:28,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-09-03 21:02:28,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 210. [2019-09-03 21:02:28,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-03 21:02:28,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-03 21:02:28,565 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-03 21:02:28,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:28,565 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-03 21:02:28,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-03 21:02:28,565 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-03 21:02:28,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-03 21:02:28,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:28,566 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 14, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:28,566 INFO L418 AbstractCegarLoop]: === Iteration 215 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:28,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:28,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1010279281, now seen corresponding path program 158 times [2019-09-03 21:02:28,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:28,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:28,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:02:28,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:28,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:29,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 589 proven. 120 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:02:29,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:29,204 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:29,204 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:29,204 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:02:29,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:29,205 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 214 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 214 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:29,229 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:02:29,229 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:02:29,290 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-03 21:02:29,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:02:29,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 21:02:29,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:30,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 589 proven. 120 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:02:30,413 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:31,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 589 proven. 120 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:02:31,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:31,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 81 [2019-09-03 21:02:31,011 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:31,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-03 21:02:31,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-03 21:02:31,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1171, Invalid=5309, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 21:02:31,012 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 81 states. [2019-09-03 21:02:34,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:34,914 INFO L93 Difference]: Finished difference Result 733 states and 899 transitions. [2019-09-03 21:02:34,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-03 21:02:34,914 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 168 [2019-09-03 21:02:34,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:34,916 INFO L225 Difference]: With dead ends: 733 [2019-09-03 21:02:34,916 INFO L226 Difference]: Without dead ends: 674 [2019-09-03 21:02:34,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 259 SyntacticMatches, 42 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16606 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6835, Invalid=32171, Unknown=0, NotChecked=0, Total=39006 [2019-09-03 21:02:34,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2019-09-03 21:02:34,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 210. [2019-09-03 21:02:34,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-03 21:02:34,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-03 21:02:34,924 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-03 21:02:34,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:34,925 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-03 21:02:34,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-03 21:02:34,925 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-03 21:02:34,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-03 21:02:34,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:34,926 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 13, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:34,926 INFO L418 AbstractCegarLoop]: === Iteration 216 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:34,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:34,926 INFO L82 PathProgramCache]: Analyzing trace with hash -560133456, now seen corresponding path program 159 times [2019-09-03 21:02:34,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:34,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:34,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:02:34,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:34,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:35,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1385 backedges. 589 proven. 112 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:02:35,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:35,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:35,551 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:35,551 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:02:35,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:35,551 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 215 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 215 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:35,562 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:02:35,562 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:02:35,614 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:02:35,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:02:35,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 21:02:35,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:36,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1385 backedges. 589 proven. 112 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:02:36,751 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:37,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1385 backedges. 589 proven. 112 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:02:37,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:37,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 80 [2019-09-03 21:02:37,346 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:37,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-03 21:02:37,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-03 21:02:37,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1131, Invalid=5189, Unknown=0, NotChecked=0, Total=6320 [2019-09-03 21:02:37,348 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 80 states. [2019-09-03 21:02:41,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:41,596 INFO L93 Difference]: Finished difference Result 807 states and 994 transitions. [2019-09-03 21:02:41,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-09-03 21:02:41,596 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 168 [2019-09-03 21:02:41,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:41,598 INFO L225 Difference]: With dead ends: 807 [2019-09-03 21:02:41,598 INFO L226 Difference]: Without dead ends: 748 [2019-09-03 21:02:41,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 260 SyntacticMatches, 42 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17880 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7431, Invalid=34799, Unknown=0, NotChecked=0, Total=42230 [2019-09-03 21:02:41,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-09-03 21:02:41,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 210. [2019-09-03 21:02:41,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-03 21:02:41,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-03 21:02:41,605 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-03 21:02:41,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:41,605 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-03 21:02:41,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-03 21:02:41,605 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-03 21:02:41,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-03 21:02:41,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:41,606 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 12, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:41,606 INFO L418 AbstractCegarLoop]: === Iteration 217 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:41,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:41,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1532597359, now seen corresponding path program 160 times [2019-09-03 21:02:41,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:41,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:41,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:02:41,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:41,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:42,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1379 backedges. 589 proven. 106 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:02:42,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:42,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:42,230 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:42,230 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:02:42,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:42,231 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 216 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 216 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:42,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:02:42,240 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:02:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:42,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 21:02:42,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:43,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1379 backedges. 589 proven. 106 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:02:43,389 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:43,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1379 backedges. 589 proven. 106 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:02:43,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:43,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 79 [2019-09-03 21:02:43,982 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:43,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-03 21:02:43,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-03 21:02:43,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1095, Invalid=5067, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 21:02:43,983 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 79 states. [2019-09-03 21:02:47,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:47,724 INFO L93 Difference]: Finished difference Result 880 states and 1088 transitions. [2019-09-03 21:02:47,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-09-03 21:02:47,725 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 168 [2019-09-03 21:02:47,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:47,726 INFO L225 Difference]: With dead ends: 880 [2019-09-03 21:02:47,726 INFO L226 Difference]: Without dead ends: 821 [2019-09-03 21:02:47,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 261 SyntacticMatches, 42 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18878 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7899, Invalid=36833, Unknown=0, NotChecked=0, Total=44732 [2019-09-03 21:02:47,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2019-09-03 21:02:47,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 210. [2019-09-03 21:02:47,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-03 21:02:47,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-03 21:02:47,734 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-03 21:02:47,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:47,734 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-03 21:02:47,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-03 21:02:47,734 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-03 21:02:47,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-03 21:02:47,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:47,735 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 11, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:47,735 INFO L418 AbstractCegarLoop]: === Iteration 218 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:47,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:47,735 INFO L82 PathProgramCache]: Analyzing trace with hash 907368144, now seen corresponding path program 161 times [2019-09-03 21:02:47,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:47,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:47,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:02:47,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:47,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:48,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1375 backedges. 589 proven. 102 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:02:48,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:48,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:48,354 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:48,354 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:02:48,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:48,355 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 217 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 217 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:48,364 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:02:48,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:02:48,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-03 21:02:48,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:02:48,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 21:02:48,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:49,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1375 backedges. 589 proven. 102 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:02:49,512 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:50,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1375 backedges. 589 proven. 102 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:02:50,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:50,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 78 [2019-09-03 21:02:50,101 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:50,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-03 21:02:50,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-03 21:02:50,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1063, Invalid=4943, Unknown=0, NotChecked=0, Total=6006 [2019-09-03 21:02:50,102 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 78 states. [2019-09-03 21:02:54,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:54,191 INFO L93 Difference]: Finished difference Result 952 states and 1181 transitions. [2019-09-03 21:02:54,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-09-03 21:02:54,191 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 168 [2019-09-03 21:02:54,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:54,193 INFO L225 Difference]: With dead ends: 952 [2019-09-03 21:02:54,193 INFO L226 Difference]: Without dead ends: 893 [2019-09-03 21:02:54,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 262 SyntacticMatches, 42 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19562 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=8221, Invalid=38219, Unknown=0, NotChecked=0, Total=46440 [2019-09-03 21:02:54,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-09-03 21:02:54,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 210. [2019-09-03 21:02:54,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-03 21:02:54,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-03 21:02:54,201 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-03 21:02:54,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:54,201 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-03 21:02:54,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-03 21:02:54,201 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-03 21:02:54,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-03 21:02:54,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:54,202 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:54,202 INFO L418 AbstractCegarLoop]: === Iteration 219 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:54,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:54,202 INFO L82 PathProgramCache]: Analyzing trace with hash 194462799, now seen corresponding path program 162 times [2019-09-03 21:02:54,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:54,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:54,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:02:54,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:54,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:54,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 589 proven. 100 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:02:54,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:54,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:54,849 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:54,849 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:02:54,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:54,850 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 218 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 218 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:54,859 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:02:54,859 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:02:54,911 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:02:54,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:02:54,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 21:02:54,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:55,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 589 proven. 100 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:02:55,957 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:56,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 589 proven. 100 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:02:56,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:56,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 77 [2019-09-03 21:02:56,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:56,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-03 21:02:56,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-03 21:02:56,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=4817, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 21:02:56,545 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 77 states. [2019-09-03 21:03:00,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:00,945 INFO L93 Difference]: Finished difference Result 1023 states and 1273 transitions. [2019-09-03 21:03:00,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2019-09-03 21:03:00,946 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 168 [2019-09-03 21:03:00,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:00,948 INFO L225 Difference]: With dead ends: 1023 [2019-09-03 21:03:00,948 INFO L226 Difference]: Without dead ends: 964 [2019-09-03 21:03:00,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 263 SyntacticMatches, 42 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19906 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=8385, Invalid=38921, Unknown=0, NotChecked=0, Total=47306 [2019-09-03 21:03:00,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2019-09-03 21:03:00,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 210. [2019-09-03 21:03:00,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-03 21:03:00,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-03 21:03:00,958 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-03 21:03:00,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:00,958 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-03 21:03:00,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-03 21:03:00,958 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-03 21:03:00,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-03 21:03:00,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:00,959 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:00,959 INFO L418 AbstractCegarLoop]: === Iteration 220 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:00,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:00,959 INFO L82 PathProgramCache]: Analyzing trace with hash -244176144, now seen corresponding path program 163 times [2019-09-03 21:03:00,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:00,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:00,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:03:00,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:00,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:01,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 589 proven. 100 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:03:01,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:01,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:01,596 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:01,596 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:03:01,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:01,596 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 219 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 219 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:01,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:03:01,606 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:03:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:01,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 21:03:01,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:02,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 589 proven. 100 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:03:02,669 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:03,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 589 proven. 100 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:03:03,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:03,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 76 [2019-09-03 21:03:03,254 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:03,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-03 21:03:03,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-03 21:03:03,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1011, Invalid=4689, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 21:03:03,256 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 76 states. [2019-09-03 21:03:07,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:07,393 INFO L93 Difference]: Finished difference Result 1093 states and 1364 transitions. [2019-09-03 21:03:07,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-09-03 21:03:07,394 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 168 [2019-09-03 21:03:07,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:07,396 INFO L225 Difference]: With dead ends: 1093 [2019-09-03 21:03:07,396 INFO L226 Difference]: Without dead ends: 1034 [2019-09-03 21:03:07,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 264 SyntacticMatches, 42 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19896 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8385, Invalid=38921, Unknown=0, NotChecked=0, Total=47306 [2019-09-03 21:03:07,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2019-09-03 21:03:07,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 210. [2019-09-03 21:03:07,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-03 21:03:07,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-03 21:03:07,407 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-03 21:03:07,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:07,407 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-03 21:03:07,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-03 21:03:07,407 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-03 21:03:07,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-03 21:03:07,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:07,408 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 11, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:07,408 INFO L418 AbstractCegarLoop]: === Iteration 221 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:07,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:07,408 INFO L82 PathProgramCache]: Analyzing trace with hash -2059441105, now seen corresponding path program 164 times [2019-09-03 21:03:07,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:07,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:07,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:03:07,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:07,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:08,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1375 backedges. 589 proven. 102 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:03:08,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:08,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:08,024 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:08,025 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:03:08,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:08,025 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 220 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 220 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:08,054 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:03:08,054 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:03:08,131 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-03 21:03:08,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:03:08,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 21:03:08,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:09,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1375 backedges. 589 proven. 102 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:03:09,185 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:09,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1375 backedges. 589 proven. 102 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:03:09,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:09,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 75 [2019-09-03 21:03:09,763 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:09,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-03 21:03:09,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-03 21:03:09,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=4559, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 21:03:09,764 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 75 states. [2019-09-03 21:03:14,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:14,210 INFO L93 Difference]: Finished difference Result 1162 states and 1454 transitions. [2019-09-03 21:03:14,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-09-03 21:03:14,211 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 168 [2019-09-03 21:03:14,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:14,213 INFO L225 Difference]: With dead ends: 1162 [2019-09-03 21:03:14,213 INFO L226 Difference]: Without dead ends: 1103 [2019-09-03 21:03:14,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 265 SyntacticMatches, 42 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19526 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8221, Invalid=38219, Unknown=0, NotChecked=0, Total=46440 [2019-09-03 21:03:14,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2019-09-03 21:03:14,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 210. [2019-09-03 21:03:14,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-03 21:03:14,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-03 21:03:14,224 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-03 21:03:14,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:14,224 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-03 21:03:14,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-03 21:03:14,224 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-03 21:03:14,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-03 21:03:14,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:14,224 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 12, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:14,225 INFO L418 AbstractCegarLoop]: === Iteration 222 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:14,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:14,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1345685264, now seen corresponding path program 165 times [2019-09-03 21:03:14,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:14,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:14,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:03:14,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:14,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:14,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1379 backedges. 589 proven. 106 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:03:14,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:14,825 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:14,825 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:14,825 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:03:14,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:14,825 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 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:14,835 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:03:14,835 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:03:14,885 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:03:14,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:03:14,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 21:03:14,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:15,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1379 backedges. 589 proven. 106 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:03:15,897 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:16,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1379 backedges. 589 proven. 106 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:03:16,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:16,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 74 [2019-09-03 21:03:16,464 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:16,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-03 21:03:16,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-03 21:03:16,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=975, Invalid=4427, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 21:03:16,465 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 74 states. [2019-09-03 21:03:20,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:20,735 INFO L93 Difference]: Finished difference Result 1230 states and 1543 transitions. [2019-09-03 21:03:20,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2019-09-03 21:03:20,736 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 168 [2019-09-03 21:03:20,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:20,738 INFO L225 Difference]: With dead ends: 1230 [2019-09-03 21:03:20,738 INFO L226 Difference]: Without dead ends: 1171 [2019-09-03 21:03:20,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 266 SyntacticMatches, 42 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18798 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7899, Invalid=36833, Unknown=0, NotChecked=0, Total=44732 [2019-09-03 21:03:20,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2019-09-03 21:03:20,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 210. [2019-09-03 21:03:20,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-03 21:03:20,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-03 21:03:20,748 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-03 21:03:20,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:20,748 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-03 21:03:20,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-03 21:03:20,748 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-03 21:03:20,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-03 21:03:20,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:20,748 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 13, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:20,749 INFO L418 AbstractCegarLoop]: === Iteration 223 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:20,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:20,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1869607921, now seen corresponding path program 166 times [2019-09-03 21:03:20,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:20,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:20,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:03:20,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:20,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:21,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1385 backedges. 589 proven. 112 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:03:21,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:21,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:21,358 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:21,358 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:03:21,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:21,358 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 222 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 222 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:21,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:03:21,368 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:03:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:21,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 21:03:21,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:22,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1385 backedges. 589 proven. 112 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:03:22,359 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:22,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1385 backedges. 589 proven. 112 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:03:22,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:22,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 73 [2019-09-03 21:03:22,939 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:22,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-03 21:03:22,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-03 21:03:22,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=963, Invalid=4293, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 21:03:22,940 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 73 states. [2019-09-03 21:03:26,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:26,755 INFO L93 Difference]: Finished difference Result 1297 states and 1631 transitions. [2019-09-03 21:03:26,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-09-03 21:03:26,756 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 168 [2019-09-03 21:03:26,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:26,758 INFO L225 Difference]: With dead ends: 1297 [2019-09-03 21:03:26,758 INFO L226 Difference]: Without dead ends: 1238 [2019-09-03 21:03:26,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 267 SyntacticMatches, 42 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17726 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7431, Invalid=34799, Unknown=0, NotChecked=0, Total=42230 [2019-09-03 21:03:26,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-09-03 21:03:26,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 210. [2019-09-03 21:03:26,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-03 21:03:26,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-03 21:03:26,771 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-03 21:03:26,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:26,771 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-03 21:03:26,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-03 21:03:26,772 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-03 21:03:26,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-03 21:03:26,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:26,772 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 14, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:26,772 INFO L418 AbstractCegarLoop]: === Iteration 224 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:26,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:26,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1973327056, now seen corresponding path program 167 times [2019-09-03 21:03:26,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:26,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:26,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:03:26,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:26,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:27,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 589 proven. 120 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:03:27,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:27,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:27,411 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:27,411 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:03:27,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:27,411 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 223 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 223 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:27,420 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:03:27,420 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:03:27,484 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-03 21:03:27,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:03:27,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 21:03:27,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 589 proven. 120 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:03:28,398 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:28,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 589 proven. 120 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:03:28,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:28,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 72 [2019-09-03 21:03:28,984 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:28,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-03 21:03:28,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-03 21:03:28,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=4157, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 21:03:28,985 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 72 states. [2019-09-03 21:03:32,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:32,805 INFO L93 Difference]: Finished difference Result 1363 states and 1718 transitions. [2019-09-03 21:03:32,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-09-03 21:03:32,806 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 168 [2019-09-03 21:03:32,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:32,808 INFO L225 Difference]: With dead ends: 1363 [2019-09-03 21:03:32,808 INFO L226 Difference]: Without dead ends: 1304 [2019-09-03 21:03:32,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 268 SyntacticMatches, 42 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16336 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6835, Invalid=32171, Unknown=0, NotChecked=0, Total=39006 [2019-09-03 21:03:32,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2019-09-03 21:03:32,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 210. [2019-09-03 21:03:32,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-03 21:03:32,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-03 21:03:32,819 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-03 21:03:32,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:32,819 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-03 21:03:32,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-03 21:03:32,819 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-03 21:03:32,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-03 21:03:32,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:32,820 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 15, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:32,820 INFO L418 AbstractCegarLoop]: === Iteration 225 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:32,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:32,820 INFO L82 PathProgramCache]: Analyzing trace with hash -314104849, now seen corresponding path program 168 times [2019-09-03 21:03:32,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:32,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:32,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:03:32,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:32,821 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:32,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:33,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 589 proven. 130 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:03:33,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:33,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:33,431 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:33,431 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:03:33,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:33,431 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 224 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 224 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:33,440 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:03:33,441 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:03:33,491 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:03:33,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:03:33,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 21:03:33,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:34,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 589 proven. 130 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:03:34,387 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:34,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 589 proven. 130 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:03:34,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:34,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 71 [2019-09-03 21:03:34,986 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:34,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-03 21:03:34,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-03 21:03:34,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=951, Invalid=4019, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 21:03:34,987 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 71 states. [2019-09-03 21:03:38,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:38,290 INFO L93 Difference]: Finished difference Result 1428 states and 1804 transitions. [2019-09-03 21:03:38,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-09-03 21:03:38,290 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 168 [2019-09-03 21:03:38,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:38,293 INFO L225 Difference]: With dead ends: 1428 [2019-09-03 21:03:38,293 INFO L226 Difference]: Without dead ends: 1369 [2019-09-03 21:03:38,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 269 SyntacticMatches, 42 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14666 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6135, Invalid=29021, Unknown=0, NotChecked=0, Total=35156 [2019-09-03 21:03:38,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2019-09-03 21:03:38,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 210. [2019-09-03 21:03:38,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-03 21:03:38,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-03 21:03:38,307 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-03 21:03:38,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:38,307 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-03 21:03:38,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-03 21:03:38,307 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-03 21:03:38,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-03 21:03:38,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:38,308 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 16, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:38,308 INFO L418 AbstractCegarLoop]: === Iteration 226 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:38,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:38,308 INFO L82 PathProgramCache]: Analyzing trace with hash -260581552, now seen corresponding path program 169 times [2019-09-03 21:03:38,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:38,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:38,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:03:38,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:38,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:38,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 589 proven. 142 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:03:38,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:38,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:38,949 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:38,949 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:03:38,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:38,950 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 225 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 225 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:38,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:03:38,958 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:03:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:39,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 21:03:39,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:39,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 589 proven. 142 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:03:39,890 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:40,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 589 proven. 142 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:03:40,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:40,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 70 [2019-09-03 21:03:40,466 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:40,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-03 21:03:40,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-03 21:03:40,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=951, Invalid=3879, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 21:03:40,467 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 70 states. [2019-09-03 21:03:43,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:43,465 INFO L93 Difference]: Finished difference Result 1492 states and 1889 transitions. [2019-09-03 21:03:43,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-03 21:03:43,465 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 168 [2019-09-03 21:03:43,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:43,467 INFO L225 Difference]: With dead ends: 1492 [2019-09-03 21:03:43,467 INFO L226 Difference]: Without dead ends: 1433 [2019-09-03 21:03:43,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 270 SyntacticMatches, 42 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12766 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5361, Invalid=25439, Unknown=0, NotChecked=0, Total=30800 [2019-09-03 21:03:43,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2019-09-03 21:03:43,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 210. [2019-09-03 21:03:43,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-03 21:03:43,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-03 21:03:43,482 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-03 21:03:43,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:43,482 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-03 21:03:43,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-03 21:03:43,482 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-03 21:03:43,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-03 21:03:43,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:43,482 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 17, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:43,483 INFO L418 AbstractCegarLoop]: === Iteration 227 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:43,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:43,483 INFO L82 PathProgramCache]: Analyzing trace with hash 849523663, now seen corresponding path program 170 times [2019-09-03 21:03:43,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:43,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:43,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:03:43,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:43,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:44,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 589 proven. 156 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:03:44,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:44,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:44,102 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:44,102 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:03:44,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:44,102 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 226 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 226 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:44,112 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:03:44,112 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:03:44,174 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-03 21:03:44,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:03:44,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 21:03:44,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:45,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 589 proven. 156 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:03:45,043 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:45,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 589 proven. 156 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:03:45,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:45,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 69 [2019-09-03 21:03:45,631 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:45,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-03 21:03:45,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-03 21:03:45,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=3737, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 21:03:45,632 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 69 states. [2019-09-03 21:03:48,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:48,441 INFO L93 Difference]: Finished difference Result 1555 states and 1973 transitions. [2019-09-03 21:03:48,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-09-03 21:03:48,442 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 168 [2019-09-03 21:03:48,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:48,444 INFO L225 Difference]: With dead ends: 1555 [2019-09-03 21:03:48,444 INFO L226 Difference]: Without dead ends: 1496 [2019-09-03 21:03:48,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 271 SyntacticMatches, 42 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10698 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4549, Invalid=21533, Unknown=0, NotChecked=0, Total=26082 [2019-09-03 21:03:48,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2019-09-03 21:03:48,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 210. [2019-09-03 21:03:48,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-03 21:03:48,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-03 21:03:48,458 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-03 21:03:48,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:48,458 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-03 21:03:48,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-03 21:03:48,458 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-03 21:03:48,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-03 21:03:48,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:48,458 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:48,459 INFO L418 AbstractCegarLoop]: === Iteration 228 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:48,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:48,459 INFO L82 PathProgramCache]: Analyzing trace with hash 192596848, now seen corresponding path program 171 times [2019-09-03 21:03:48,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:48,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:48,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:03:48,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:48,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:49,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 589 proven. 172 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:03:49,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:49,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:49,083 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:49,084 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:03:49,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:49,084 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 227 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 227 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:49,093 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:03:49,093 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:03:49,144 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:03:49,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:03:49,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 21:03:49,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:49,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 589 proven. 172 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:03:49,966 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:50,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 589 proven. 172 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:03:50,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:50,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 68 [2019-09-03 21:03:50,567 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:50,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-03 21:03:50,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-03 21:03:50,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=963, Invalid=3593, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 21:03:50,568 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 68 states. [2019-09-03 21:03:52,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:52,778 INFO L93 Difference]: Finished difference Result 1617 states and 2056 transitions. [2019-09-03 21:03:52,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-03 21:03:52,778 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 168 [2019-09-03 21:03:52,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:52,781 INFO L225 Difference]: With dead ends: 1617 [2019-09-03 21:03:52,781 INFO L226 Difference]: Without dead ends: 1558 [2019-09-03 21:03:52,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 272 SyntacticMatches, 42 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8536 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3741, Invalid=17429, Unknown=0, NotChecked=0, Total=21170 [2019-09-03 21:03:52,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2019-09-03 21:03:52,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 210. [2019-09-03 21:03:52,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-03 21:03:52,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-03 21:03:52,797 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-03 21:03:52,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:52,797 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-03 21:03:52,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-03 21:03:52,797 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-03 21:03:52,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-03 21:03:52,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:52,798 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:52,798 INFO L418 AbstractCegarLoop]: === Iteration 229 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:52,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:52,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1352614993, now seen corresponding path program 19 times [2019-09-03 21:03:52,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:52,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:52,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:03:52,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:52,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:53,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 589 proven. 190 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:03:53,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:53,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:53,416 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:53,416 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:03:53,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:53,416 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 228 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 228 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:53,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:03:53,427 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:03:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:53,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 21:03:53,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:54,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 589 proven. 190 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:03:54,280 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:54,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 589 proven. 190 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:03:54,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:54,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 67 [2019-09-03 21:03:54,885 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:54,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-03 21:03:54,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-03 21:03:54,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=975, Invalid=3447, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 21:03:54,886 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 67 states. [2019-09-03 21:03:56,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:56,858 INFO L93 Difference]: Finished difference Result 1681 states and 2142 transitions. [2019-09-03 21:03:56,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-03 21:03:56,859 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 168 [2019-09-03 21:03:56,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:56,861 INFO L225 Difference]: With dead ends: 1681 [2019-09-03 21:03:56,861 INFO L226 Difference]: Without dead ends: 1622 [2019-09-03 21:03:56,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 273 SyntacticMatches, 42 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6366 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2985, Invalid=13271, Unknown=0, NotChecked=0, Total=16256 [2019-09-03 21:03:56,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2019-09-03 21:03:56,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 212. [2019-09-03 21:03:56,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-03 21:03:56,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 234 transitions. [2019-09-03 21:03:56,878 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 234 transitions. Word has length 168 [2019-09-03 21:03:56,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:56,878 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 234 transitions. [2019-09-03 21:03:56,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-03 21:03:56,878 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 234 transitions. [2019-09-03 21:03:56,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-03 21:03:56,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:56,879 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:56,879 INFO L418 AbstractCegarLoop]: === Iteration 230 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:56,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:56,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1048324632, now seen corresponding path program 38 times [2019-09-03 21:03:56,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:56,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:56,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:03:56,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:56,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:57,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 248 proven. 551 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:03:57,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:57,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:57,108 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:57,108 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:03:57,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:57,108 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 229 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 229 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:57,118 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:03:57,118 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:03:57,181 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-03 21:03:57,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:03:57,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 21:03:57,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:57,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:57,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 248 proven. 551 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:03:57,223 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:57,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 248 proven. 551 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 21:03:57,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:57,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 27 [2019-09-03 21:03:57,564 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:57,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 21:03:57,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 21:03:57,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=439, Unknown=0, NotChecked=0, Total=702 [2019-09-03 21:03:57,565 INFO L87 Difference]: Start difference. First operand 212 states and 234 transitions. Second operand 27 states. [2019-09-03 21:03:57,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:57,994 INFO L93 Difference]: Finished difference Result 223 states and 246 transitions. [2019-09-03 21:03:57,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 21:03:57,995 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 169 [2019-09-03 21:03:57,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:57,995 INFO L225 Difference]: With dead ends: 223 [2019-09-03 21:03:57,995 INFO L226 Difference]: Without dead ends: 223 [2019-09-03 21:03:57,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 316 SyntacticMatches, 40 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=269, Invalid=487, Unknown=0, NotChecked=0, Total=756 [2019-09-03 21:03:57,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-03 21:03:57,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 219. [2019-09-03 21:03:57,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-09-03 21:03:57,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 241 transitions. [2019-09-03 21:03:57,999 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 241 transitions. Word has length 169 [2019-09-03 21:03:57,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:57,999 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 241 transitions. [2019-09-03 21:03:57,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 21:03:57,999 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 241 transitions. [2019-09-03 21:03:58,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-03 21:03:58,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:58,000 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:58,000 INFO L418 AbstractCegarLoop]: === Iteration 231 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:58,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:58,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1300720335, now seen corresponding path program 39 times [2019-09-03 21:03:58,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:58,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:58,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:03:58,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:58,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:58,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1620 backedges. 650 proven. 210 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 21:03:58,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:58,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:58,723 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:58,723 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:03:58,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:58,723 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 230 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 230 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:58,733 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:03:58,733 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:03:58,785 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:03:58,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:03:58,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 21:03:58,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:00,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1620 backedges. 650 proven. 210 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 21:04:00,140 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:00,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1620 backedges. 650 proven. 210 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 21:04:00,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:00,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 90 [2019-09-03 21:04:00,818 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:00,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-03 21:04:00,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-03 21:04:00,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1565, Invalid=6445, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 21:04:00,820 INFO L87 Difference]: Start difference. First operand 219 states and 241 transitions. Second operand 90 states. [2019-09-03 21:04:02,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:02,790 INFO L93 Difference]: Finished difference Result 365 states and 429 transitions. [2019-09-03 21:04:02,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 21:04:02,790 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2019-09-03 21:04:02,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:02,791 INFO L225 Difference]: With dead ends: 365 [2019-09-03 21:04:02,791 INFO L226 Difference]: Without dead ends: 303 [2019-09-03 21:04:02,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 266 SyntacticMatches, 44 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9110 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3259, Invalid=14563, Unknown=0, NotChecked=0, Total=17822 [2019-09-03 21:04:02,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-09-03 21:04:02,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 220. [2019-09-03 21:04:02,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-09-03 21:04:02,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 242 transitions. [2019-09-03 21:04:02,796 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 242 transitions. Word has length 176 [2019-09-03 21:04:02,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:02,796 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 242 transitions. [2019-09-03 21:04:02,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-03 21:04:02,796 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 242 transitions. [2019-09-03 21:04:02,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-03 21:04:02,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:02,797 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:02,797 INFO L418 AbstractCegarLoop]: === Iteration 232 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:02,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:02,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1205107278, now seen corresponding path program 172 times [2019-09-03 21:04:02,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:02,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:02,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:02,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:02,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:03,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1601 backedges. 650 proven. 191 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 21:04:03,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:03,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:03,499 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:03,499 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:04:03,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:03,499 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 231 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 231 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:03,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:03,509 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:04:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:03,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 21:04:03,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:04,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1601 backedges. 650 proven. 191 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 21:04:04,907 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:05,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1601 backedges. 650 proven. 191 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 21:04:05,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:05,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 89 [2019-09-03 21:04:05,575 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:05,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-03 21:04:05,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-03 21:04:05,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1502, Invalid=6330, Unknown=0, NotChecked=0, Total=7832 [2019-09-03 21:04:05,576 INFO L87 Difference]: Start difference. First operand 220 states and 242 transitions. Second operand 89 states. [2019-09-03 21:04:08,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:08,128 INFO L93 Difference]: Finished difference Result 448 states and 534 transitions. [2019-09-03 21:04:08,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-03 21:04:08,129 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2019-09-03 21:04:08,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:08,130 INFO L225 Difference]: With dead ends: 448 [2019-09-03 21:04:08,130 INFO L226 Difference]: Without dead ends: 386 [2019-09-03 21:04:08,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 267 SyntacticMatches, 44 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10962 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4095, Invalid=19161, Unknown=0, NotChecked=0, Total=23256 [2019-09-03 21:04:08,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-09-03 21:04:08,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 220. [2019-09-03 21:04:08,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-09-03 21:04:08,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 242 transitions. [2019-09-03 21:04:08,134 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 242 transitions. Word has length 176 [2019-09-03 21:04:08,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:08,134 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 242 transitions. [2019-09-03 21:04:08,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-03 21:04:08,135 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 242 transitions. [2019-09-03 21:04:08,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-03 21:04:08,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:08,135 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 18, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:08,135 INFO L418 AbstractCegarLoop]: === Iteration 233 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:08,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:08,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1846018321, now seen corresponding path program 173 times [2019-09-03 21:04:08,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:08,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:08,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:08,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:08,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:08,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 650 proven. 174 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 21:04:08,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:08,826 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:08,826 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:08,826 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:04:08,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:08,826 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 232 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 232 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:08,838 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:08,838 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:04:08,906 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-03 21:04:08,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:08,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 21:04:08,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:10,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 650 proven. 174 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 21:04:10,216 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:10,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 650 proven. 174 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 21:04:10,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:10,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 88 [2019-09-03 21:04:10,903 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:10,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-03 21:04:10,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-03 21:04:10,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=6213, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 21:04:10,905 INFO L87 Difference]: Start difference. First operand 220 states and 242 transitions. Second operand 88 states. [2019-09-03 21:04:13,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:13,636 INFO L93 Difference]: Finished difference Result 530 states and 638 transitions. [2019-09-03 21:04:13,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-03 21:04:13,636 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 176 [2019-09-03 21:04:13,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:13,637 INFO L225 Difference]: With dead ends: 530 [2019-09-03 21:04:13,637 INFO L226 Difference]: Without dead ends: 468 [2019-09-03 21:04:13,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 268 SyntacticMatches, 44 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12933 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4996, Invalid=23734, Unknown=0, NotChecked=0, Total=28730 [2019-09-03 21:04:13,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-09-03 21:04:13,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 220. [2019-09-03 21:04:13,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-09-03 21:04:13,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 242 transitions. [2019-09-03 21:04:13,642 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 242 transitions. Word has length 176 [2019-09-03 21:04:13,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:13,642 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 242 transitions. [2019-09-03 21:04:13,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-03 21:04:13,642 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 242 transitions. [2019-09-03 21:04:13,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-03 21:04:13,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:13,643 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 17, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:13,643 INFO L418 AbstractCegarLoop]: === Iteration 234 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:13,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:13,643 INFO L82 PathProgramCache]: Analyzing trace with hash -420421074, now seen corresponding path program 174 times [2019-09-03 21:04:13,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:13,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:13,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:13,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:13,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:14,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 650 proven. 159 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 21:04:14,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:14,336 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:14,336 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:14,336 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:04:14,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:14,336 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 233 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 233 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:14,346 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:04:14,346 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:04:14,398 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:04:14,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:14,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 21:04:14,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:15,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 650 proven. 159 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 21:04:15,704 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:16,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 650 proven. 159 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 21:04:16,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:16,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 87 [2019-09-03 21:04:16,361 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:16,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-03 21:04:16,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-03 21:04:16,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1388, Invalid=6094, Unknown=0, NotChecked=0, Total=7482 [2019-09-03 21:04:16,362 INFO L87 Difference]: Start difference. First operand 220 states and 242 transitions. Second operand 87 states. [2019-09-03 21:04:18,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:18,985 INFO L93 Difference]: Finished difference Result 611 states and 741 transitions. [2019-09-03 21:04:18,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-09-03 21:04:18,985 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 176 [2019-09-03 21:04:18,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:18,986 INFO L225 Difference]: With dead ends: 611 [2019-09-03 21:04:18,986 INFO L226 Difference]: Without dead ends: 549 [2019-09-03 21:04:18,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 269 SyntacticMatches, 44 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14919 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5911, Invalid=28129, Unknown=0, NotChecked=0, Total=34040 [2019-09-03 21:04:18,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-09-03 21:04:18,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 220. [2019-09-03 21:04:18,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-09-03 21:04:18,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 242 transitions. [2019-09-03 21:04:18,993 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 242 transitions. Word has length 176 [2019-09-03 21:04:18,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:18,993 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 242 transitions. [2019-09-03 21:04:18,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-03 21:04:18,993 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 242 transitions. [2019-09-03 21:04:18,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-03 21:04:18,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:18,994 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 16, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:18,994 INFO L418 AbstractCegarLoop]: === Iteration 235 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:18,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:18,994 INFO L82 PathProgramCache]: Analyzing trace with hash 733944591, now seen corresponding path program 175 times [2019-09-03 21:04:18,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:18,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:18,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:18,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:18,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:19,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1556 backedges. 650 proven. 146 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 21:04:19,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:19,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:19,693 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:19,693 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:04:19,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:19,693 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 234 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 234 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:19,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:19,703 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:04:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:19,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 21:04:19,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:21,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1556 backedges. 650 proven. 146 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 21:04:21,160 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:21,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1556 backedges. 650 proven. 146 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 21:04:21,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:21,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 86 [2019-09-03 21:04:21,797 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:21,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-03 21:04:21,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-03 21:04:21,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1337, Invalid=5973, Unknown=0, NotChecked=0, Total=7310 [2019-09-03 21:04:21,799 INFO L87 Difference]: Start difference. First operand 220 states and 242 transitions. Second operand 86 states. [2019-09-03 21:04:25,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:25,459 INFO L93 Difference]: Finished difference Result 691 states and 843 transitions. [2019-09-03 21:04:25,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-03 21:04:25,459 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 176 [2019-09-03 21:04:25,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:25,460 INFO L225 Difference]: With dead ends: 691 [2019-09-03 21:04:25,460 INFO L226 Difference]: Without dead ends: 629 [2019-09-03 21:04:25,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 270 SyntacticMatches, 44 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16828 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6795, Invalid=32211, Unknown=0, NotChecked=0, Total=39006 [2019-09-03 21:04:25,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-09-03 21:04:25,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 220. [2019-09-03 21:04:25,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-09-03 21:04:25,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 242 transitions. [2019-09-03 21:04:25,467 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 242 transitions. Word has length 176 [2019-09-03 21:04:25,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:25,467 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 242 transitions. [2019-09-03 21:04:25,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-03 21:04:25,467 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 242 transitions. [2019-09-03 21:04:25,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-03 21:04:25,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:25,467 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 15, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:25,468 INFO L418 AbstractCegarLoop]: === Iteration 236 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:25,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:25,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1741013518, now seen corresponding path program 176 times [2019-09-03 21:04:25,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:25,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:25,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:25,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:25,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:25,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:26,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1545 backedges. 650 proven. 135 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 21:04:26,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:26,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:26,143 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:26,144 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:04:26,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:26,144 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 235 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 235 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:26,153 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:26,153 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:04:26,219 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-03 21:04:26,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:26,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 21:04:26,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:27,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1545 backedges. 650 proven. 135 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 21:04:27,462 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:28,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1545 backedges. 650 proven. 135 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 21:04:28,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:28,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 85 [2019-09-03 21:04:28,136 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:28,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-03 21:04:28,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-03 21:04:28,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1290, Invalid=5850, Unknown=0, NotChecked=0, Total=7140 [2019-09-03 21:04:28,137 INFO L87 Difference]: Start difference. First operand 220 states and 242 transitions. Second operand 85 states. [2019-09-03 21:04:32,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:32,208 INFO L93 Difference]: Finished difference Result 770 states and 944 transitions. [2019-09-03 21:04:32,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-09-03 21:04:32,209 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 176 [2019-09-03 21:04:32,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:32,210 INFO L225 Difference]: With dead ends: 770 [2019-09-03 21:04:32,210 INFO L226 Difference]: Without dead ends: 708 [2019-09-03 21:04:32,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 271 SyntacticMatches, 44 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18580 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7609, Invalid=35863, Unknown=0, NotChecked=0, Total=43472 [2019-09-03 21:04:32,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-09-03 21:04:32,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 220. [2019-09-03 21:04:32,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-09-03 21:04:32,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 242 transitions. [2019-09-03 21:04:32,218 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 242 transitions. Word has length 176 [2019-09-03 21:04:32,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:32,218 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 242 transitions. [2019-09-03 21:04:32,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-03 21:04:32,219 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 242 transitions. [2019-09-03 21:04:32,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-03 21:04:32,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:32,219 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 14, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:32,219 INFO L418 AbstractCegarLoop]: === Iteration 237 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:32,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:32,220 INFO L82 PathProgramCache]: Analyzing trace with hash 249478959, now seen corresponding path program 177 times [2019-09-03 21:04:32,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:32,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:32,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:32,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:32,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:32,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1536 backedges. 650 proven. 126 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 21:04:32,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:32,939 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:32,939 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:32,939 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:04:32,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:32,940 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 236 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 236 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:32,949 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:04:32,949 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:04:32,999 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:04:32,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:33,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 21:04:33,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:34,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1536 backedges. 650 proven. 126 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 21:04:34,234 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:34,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1536 backedges. 650 proven. 126 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 21:04:34,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:34,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 84 [2019-09-03 21:04:34,866 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:34,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-03 21:04:34,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-03 21:04:34,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1247, Invalid=5725, Unknown=0, NotChecked=0, Total=6972 [2019-09-03 21:04:34,867 INFO L87 Difference]: Start difference. First operand 220 states and 242 transitions. Second operand 84 states. [2019-09-03 21:04:39,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:39,017 INFO L93 Difference]: Finished difference Result 848 states and 1044 transitions. [2019-09-03 21:04:39,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-09-03 21:04:39,017 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 176 [2019-09-03 21:04:39,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:39,019 INFO L225 Difference]: With dead ends: 848 [2019-09-03 21:04:39,019 INFO L226 Difference]: Without dead ends: 786 [2019-09-03 21:04:39,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 272 SyntacticMatches, 44 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20107 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8320, Invalid=38986, Unknown=0, NotChecked=0, Total=47306 [2019-09-03 21:04:39,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2019-09-03 21:04:39,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 220. [2019-09-03 21:04:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-09-03 21:04:39,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 242 transitions. [2019-09-03 21:04:39,026 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 242 transitions. Word has length 176 [2019-09-03 21:04:39,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:39,027 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 242 transitions. [2019-09-03 21:04:39,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-03 21:04:39,027 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 242 transitions. [2019-09-03 21:04:39,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-03 21:04:39,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:39,027 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 13, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:39,027 INFO L418 AbstractCegarLoop]: === Iteration 238 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:39,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:39,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1309743598, now seen corresponding path program 178 times [2019-09-03 21:04:39,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:39,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:39,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:39,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:39,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:39,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1529 backedges. 650 proven. 119 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 21:04:39,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:39,708 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:39,709 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:39,709 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:04:39,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:39,709 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 237 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 237 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:39,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:39,719 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:04:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:39,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 21:04:39,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:40,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1529 backedges. 650 proven. 119 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 21:04:40,961 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:41,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1529 backedges. 650 proven. 119 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 21:04:41,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:41,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 83 [2019-09-03 21:04:41,628 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:41,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-03 21:04:41,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-03 21:04:41,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1208, Invalid=5598, Unknown=0, NotChecked=0, Total=6806 [2019-09-03 21:04:41,629 INFO L87 Difference]: Start difference. First operand 220 states and 242 transitions. Second operand 83 states. [2019-09-03 21:04:46,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:46,247 INFO L93 Difference]: Finished difference Result 925 states and 1143 transitions. [2019-09-03 21:04:46,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-09-03 21:04:46,247 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 176 [2019-09-03 21:04:46,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:46,249 INFO L225 Difference]: With dead ends: 925 [2019-09-03 21:04:46,249 INFO L226 Difference]: Without dead ends: 863 [2019-09-03 21:04:46,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 273 SyntacticMatches, 44 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21353 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8901, Invalid=41499, Unknown=0, NotChecked=0, Total=50400 [2019-09-03 21:04:46,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2019-09-03 21:04:46,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 220. [2019-09-03 21:04:46,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-09-03 21:04:46,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 242 transitions. [2019-09-03 21:04:46,259 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 242 transitions. Word has length 176 [2019-09-03 21:04:46,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:46,260 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 242 transitions. [2019-09-03 21:04:46,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-03 21:04:46,260 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 242 transitions. [2019-09-03 21:04:46,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-03 21:04:46,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:46,260 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 12, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:46,261 INFO L418 AbstractCegarLoop]: === Iteration 239 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:46,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:46,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1205398351, now seen corresponding path program 179 times [2019-09-03 21:04:46,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:46,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:46,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:46,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:46,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:46,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1524 backedges. 650 proven. 114 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 21:04:46,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:46,955 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:46,956 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:46,956 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:04:46,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:46,956 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 238 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 238 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:46,966 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:46,966 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:04:47,033 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-03 21:04:47,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:47,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 21:04:47,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:48,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1524 backedges. 650 proven. 114 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 21:04:48,208 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:48,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1524 backedges. 650 proven. 114 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 21:04:48,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:48,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 82 [2019-09-03 21:04:48,836 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:48,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-03 21:04:48,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-03 21:04:48,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1173, Invalid=5469, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 21:04:48,838 INFO L87 Difference]: Start difference. First operand 220 states and 242 transitions. Second operand 82 states.