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-acceleration/simple_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:01:56,010 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:01:56,012 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:01:56,023 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:01:56,024 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:01:56,025 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:01:56,026 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:01:56,028 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:01:56,030 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:01:56,030 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:01:56,031 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:01:56,032 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:01:56,033 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:01:56,034 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:01:56,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:01:56,036 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:01:56,036 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:01:56,037 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:01:56,039 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:01:56,040 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:01:56,042 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:01:56,043 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:01:56,044 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:01:56,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:01:56,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:01:56,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:01:56,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:01:56,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:01:56,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:01:56,049 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:01:56,049 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:01:56,050 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:01:56,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:01:56,051 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:01:56,052 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:01:56,052 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:01:56,053 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:01:56,053 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:01:56,053 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:01:56,054 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:01:56,055 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:01:56,056 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:01:56,069 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:01:56,070 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:01:56,070 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:01:56,070 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:01:56,071 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:01:56,071 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:01:56,071 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:01:56,071 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:01:56,071 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:01:56,072 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:01:56,072 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:01:56,072 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:01:56,073 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:01:56,073 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:01:56,073 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:01:56,073 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:01:56,073 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:01:56,074 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:01:56,074 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:01:56,074 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:01:56,074 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:01:56,074 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:01:56,075 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:01:56,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:01:56,075 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:01:56,075 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:01:56,075 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:01:56,076 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:01:56,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:01:56,076 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:01:56,120 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:01:56,136 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:01:56,140 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:01:56,141 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:01:56,142 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:01:56,143 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_1-2.c [2019-09-10 02:01:56,209 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/094635ba3/dc60c1ab19804260baf168166af1fdf2/FLAGdbff63862 [2019-09-10 02:01:56,609 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:01:56,610 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_1-2.c [2019-09-10 02:01:56,616 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/094635ba3/dc60c1ab19804260baf168166af1fdf2/FLAGdbff63862 [2019-09-10 02:01:56,975 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/094635ba3/dc60c1ab19804260baf168166af1fdf2 [2019-09-10 02:01:56,990 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:01:56,991 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:01:56,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:01:56,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:01:56,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:01:56,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:01:56" (1/1) ... [2019-09-10 02:01:57,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@427c24f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:01:56, skipping insertion in model container [2019-09-10 02:01:57,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:01:56" (1/1) ... [2019-09-10 02:01:57,007 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:01:57,022 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:01:57,182 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:01:57,187 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:01:57,205 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:01:57,221 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:01:57,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:01:57 WrapperNode [2019-09-10 02:01:57,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:01:57,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:01:57,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:01:57,224 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:01:57,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:01:57" (1/1) ... [2019-09-10 02:01:57,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:01:57" (1/1) ... [2019-09-10 02:01:57,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:01:57" (1/1) ... [2019-09-10 02:01:57,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:01:57" (1/1) ... [2019-09-10 02:01:57,332 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:01:57" (1/1) ... [2019-09-10 02:01:57,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:01:57" (1/1) ... [2019-09-10 02:01:57,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:01:57" (1/1) ... [2019-09-10 02:01:57,338 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:01:57,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:01:57,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:01:57,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:01:57,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:01:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:01:57,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:01:57,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:01:57,400 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-10 02:01:57,400 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:01:57,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:01:57,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 02:01:57,401 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:01:57,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:01:57,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:01:57,536 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:01:57,536 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 02:01:57,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:01:57 BoogieIcfgContainer [2019-09-10 02:01:57,538 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:01:57,539 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:01:57,539 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:01:57,542 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:01:57,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:01:56" (1/3) ... [2019-09-10 02:01:57,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d778c5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:01:57, skipping insertion in model container [2019-09-10 02:01:57,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:01:57" (2/3) ... [2019-09-10 02:01:57,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d778c5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:01:57, skipping insertion in model container [2019-09-10 02:01:57,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:01:57" (3/3) ... [2019-09-10 02:01:57,545 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_1-2.c [2019-09-10 02:01:57,554 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:01:57,560 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:01:57,572 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:01:57,598 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:01:57,598 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:01:57,598 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:01:57,598 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:01:57,598 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:01:57,599 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:01:57,599 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:01:57,599 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:01:57,613 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-09-10 02:01:57,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 02:01:57,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:01:57,623 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:01:57,625 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:01:57,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:01:57,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2019-09-10 02:01:57,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:01:57,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:01:57,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:01:57,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:01:57,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:01:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:01:57,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:01:57,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:01:57,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:01:57,849 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:01:57,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:01:57,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:01:57,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:01:57,887 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-09-10 02:01:57,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:01:57,918 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-10 02:01:57,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:01:57,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-10 02:01:57,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:01:57,930 INFO L225 Difference]: With dead ends: 18 [2019-09-10 02:01:57,930 INFO L226 Difference]: Without dead ends: 12 [2019-09-10 02:01:57,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:01:57,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-10 02:01:57,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-10 02:01:57,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-10 02:01:57,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-10 02:01:57,960 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-10 02:01:57,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:01:57,961 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-10 02:01:57,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:01:57,961 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-10 02:01:57,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-10 02:01:57,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:01:57,962 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:01:57,962 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:01:57,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:01:57,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2019-09-10 02:01:57,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:01:57,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:01:57,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:01:57,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:01:57,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:01:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:01:58,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:01:58,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:01:58,059 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:01:58,060 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2019-09-10 02:01:58,062 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [19], [22], [24], [30], [31], [32], [34] [2019-09-10 02:01:58,091 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:01:58,092 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:01:58,145 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 02:01:58,664 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:01:58,668 INFO L272 AbstractInterpreter]: Visited 11 different actions 41 times. Merged at 2 different actions 10 times. Widened at 1 different actions 3 times. Performed 55 root evaluator evaluations with a maximum evaluation depth of 13. Performed 55 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2019-09-10 02:01:58,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:01:58,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:01:58,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:01:58,672 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:01:58,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:01:58,698 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:01:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:01:58,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 02:01:58,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:01:58,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:01:58,772 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:01:58,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:01:58,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:01:58,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-09-10 02:01:58,816 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:01:58,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:01:58,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:01:58,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:01:58,818 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2019-09-10 02:01:58,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:01:58,850 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-09-10 02:01:58,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:01:58,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-09-10 02:01:58,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:01:58,853 INFO L225 Difference]: With dead ends: 13 [2019-09-10 02:01:58,854 INFO L226 Difference]: Without dead ends: 13 [2019-09-10 02:01:58,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:01:58,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-10 02:01:58,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-10 02:01:58,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-10 02:01:58,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-09-10 02:01:58,861 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-09-10 02:01:58,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:01:58,862 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-09-10 02:01:58,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:01:58,863 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-09-10 02:01:58,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-10 02:01:58,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:01:58,864 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:01:58,864 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:01:58,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:01:58,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1490448798, now seen corresponding path program 2 times [2019-09-10 02:01:58,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:01:58,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:01:58,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:01:58,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:01:58,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:01:58,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:01:59,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:01:59,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:01:59,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:01:59,010 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:01:59,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:01:59,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:01:59,010 INFO 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-10 02:01:59,030 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:01:59,030 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:01:59,045 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-10 02:01:59,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:01:59,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 02:01:59,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:01:59,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:01:59,077 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:01:59,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:01:59,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:01:59,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-09-10 02:01:59,137 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:01:59,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:01:59,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:01:59,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:01:59,139 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2019-09-10 02:01:59,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:01:59,170 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-09-10 02:01:59,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:01:59,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-09-10 02:01:59,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:01:59,171 INFO L225 Difference]: With dead ends: 14 [2019-09-10 02:01:59,172 INFO L226 Difference]: Without dead ends: 14 [2019-09-10 02:01:59,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:01:59,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-10 02:01:59,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-10 02:01:59,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-10 02:01:59,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-09-10 02:01:59,175 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-09-10 02:01:59,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:01:59,175 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-09-10 02:01:59,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:01:59,176 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-09-10 02:01:59,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 02:01:59,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:01:59,177 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:01:59,177 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:01:59,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:01:59,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1004266255, now seen corresponding path program 3 times [2019-09-10 02:01:59,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:01:59,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:01:59,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:01:59,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:01:59,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:01:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:01:59,281 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:01:59,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:01:59,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:01:59,282 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:01:59,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:01:59,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:01:59,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:01:59,296 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:01:59,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:01:59,308 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:01:59,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:01:59,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-10 02:01:59,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:01:59,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:01:59,334 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:01:59,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:01:59,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:01:59,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-09-10 02:01:59,423 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:01:59,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:01:59,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:01:59,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:01:59,425 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 7 states. [2019-09-10 02:01:59,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:01:59,469 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-09-10 02:01:59,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:01:59,470 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-09-10 02:01:59,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:01:59,471 INFO L225 Difference]: With dead ends: 15 [2019-09-10 02:01:59,471 INFO L226 Difference]: Without dead ends: 15 [2019-09-10 02:01:59,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:01:59,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-10 02:01:59,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-10 02:01:59,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-10 02:01:59,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-10 02:01:59,474 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-09-10 02:01:59,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:01:59,475 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-10 02:01:59,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:01:59,475 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-10 02:01:59,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-10 02:01:59,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:01:59,476 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:01:59,476 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:01:59,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:01:59,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 4 times [2019-09-10 02:01:59,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:01:59,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:01:59,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:01:59,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:01:59,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:01:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:01:59,591 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:01:59,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:01:59,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:01:59,592 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:01:59,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:01:59,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:01:59,593 INFO 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-10 02:01:59,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:01:59,611 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:01:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:01:59,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-10 02:01:59,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:01:59,668 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:01:59,669 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:01:59,806 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:01:59,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:01:59,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-09-10 02:01:59,815 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:01:59,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:01:59,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:01:59,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:01:59,816 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2019-09-10 02:01:59,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:01:59,866 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-09-10 02:01:59,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:01:59,866 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-09-10 02:01:59,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:01:59,867 INFO L225 Difference]: With dead ends: 16 [2019-09-10 02:01:59,867 INFO L226 Difference]: Without dead ends: 16 [2019-09-10 02:01:59,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:01:59,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-10 02:01:59,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-10 02:01:59,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-10 02:01:59,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-09-10 02:01:59,870 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-09-10 02:01:59,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:01:59,871 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-09-10 02:01:59,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:01:59,871 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-09-10 02:01:59,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-10 02:01:59,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:01:59,872 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:01:59,872 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:01:59,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:01:59,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1860436335, now seen corresponding path program 5 times [2019-09-10 02:01:59,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:01:59,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:01:59,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:01:59,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:01:59,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:01:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:01:59,989 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:01:59,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:01:59,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:01:59,990 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:01:59,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:01:59,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:01:59,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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:02:00,004 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:02:00,005 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:02:00,020 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-10 02:02:00,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:02:00,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 02:02:00,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:02:00,049 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:00,049 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:02:00,258 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:00,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:02:00,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-09-10 02:02:00,262 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:02:00,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:02:00,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:02:00,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:02:00,263 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2019-09-10 02:02:00,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:02:00,313 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-09-10 02:02:00,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:02:00,314 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-09-10 02:02:00,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:02:00,314 INFO L225 Difference]: With dead ends: 17 [2019-09-10 02:02:00,314 INFO L226 Difference]: Without dead ends: 17 [2019-09-10 02:02:00,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:02:00,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-10 02:02:00,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-10 02:02:00,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-10 02:02:00,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-10 02:02:00,318 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-09-10 02:02:00,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:02:00,318 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-10 02:02:00,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:02:00,318 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-10 02:02:00,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-10 02:02:00,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:02:00,319 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:02:00,319 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:02:00,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:02:00,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1802490274, now seen corresponding path program 6 times [2019-09-10 02:02:00,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:02:00,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:02:00,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:02:00,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:02:00,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:02:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:02:00,447 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:00,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:02:00,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:02:00,447 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:02:00,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:02:00,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:02:00,448 INFO 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-10 02:02:00,465 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:02:00,465 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:02:00,477 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:02:00,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:02:00,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-10 02:02:00,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:02:00,509 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:00,509 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:02:00,700 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:00,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:02:00,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-09-10 02:02:00,704 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:02:00,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:02:00,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:02:00,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:02:00,706 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-09-10 02:02:00,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:02:00,772 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-10 02:02:00,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:02:00,774 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-09-10 02:02:00,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:02:00,775 INFO L225 Difference]: With dead ends: 18 [2019-09-10 02:02:00,775 INFO L226 Difference]: Without dead ends: 18 [2019-09-10 02:02:00,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:02:00,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-10 02:02:00,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-10 02:02:00,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-10 02:02:00,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-09-10 02:02:00,783 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-09-10 02:02:00,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:02:00,783 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-09-10 02:02:00,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:02:00,784 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-09-10 02:02:00,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 02:02:00,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:02:00,785 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:02:00,785 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:02:00,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:02:00,785 INFO L82 PathProgramCache]: Analyzing trace with hash -6162383, now seen corresponding path program 7 times [2019-09-10 02:02:00,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:02:00,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:02:00,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:02:00,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:02:00,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:02:00,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:02:00,942 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:00,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:02:00,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:02:00,943 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:02:00,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:02:00,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:02:00,944 INFO 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-10 02:02:00,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:02:00,959 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:02:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:02:00,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 02:02:00,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:02:00,998 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:00,998 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:02:01,218 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:01,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:02:01,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-09-10 02:02:01,223 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:02:01,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:02:01,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:02:01,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:02:01,224 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 11 states. [2019-09-10 02:02:01,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:02:01,317 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-09-10 02:02:01,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:02:01,318 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-09-10 02:02:01,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:02:01,319 INFO L225 Difference]: With dead ends: 19 [2019-09-10 02:02:01,319 INFO L226 Difference]: Without dead ends: 19 [2019-09-10 02:02:01,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:02:01,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-10 02:02:01,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-10 02:02:01,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-10 02:02:01,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-10 02:02:01,323 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-09-10 02:02:01,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:02:01,323 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-10 02:02:01,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:02:01,323 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-10 02:02:01,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 02:02:01,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:02:01,324 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:02:01,324 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:02:01,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:02:01,325 INFO L82 PathProgramCache]: Analyzing trace with hash -154572610, now seen corresponding path program 8 times [2019-09-10 02:02:01,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:02:01,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:02:01,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:02:01,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:02:01,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:02:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:02:01,449 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:01,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:02:01,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:02:01,450 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:02:01,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:02:01,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:02:01,450 INFO 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-10 02:02:01,460 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:02:01,460 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:02:01,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-10 02:02:01,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:02:01,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 02:02:01,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:02:01,509 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:01,509 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:02:01,749 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:01,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:02:01,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-09-10 02:02:01,754 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:02:01,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:02:01,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:02:01,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-09-10 02:02:01,756 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2019-09-10 02:02:01,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:02:01,852 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-09-10 02:02:01,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:02:01,853 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-09-10 02:02:01,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:02:01,854 INFO L225 Difference]: With dead ends: 20 [2019-09-10 02:02:01,854 INFO L226 Difference]: Without dead ends: 20 [2019-09-10 02:02:01,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-09-10 02:02:01,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-10 02:02:01,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-10 02:02:01,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-10 02:02:01,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-09-10 02:02:01,858 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-09-10 02:02:01,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:02:01,858 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-09-10 02:02:01,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:02:01,859 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-09-10 02:02:01,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-10 02:02:01,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:02:01,859 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:02:01,859 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:02:01,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:02:01,860 INFO L82 PathProgramCache]: Analyzing trace with hash -460322351, now seen corresponding path program 9 times [2019-09-10 02:02:01,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:02:01,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:02:01,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:02:01,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:02:01,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:02:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:02:02,009 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:02,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:02:02,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:02:02,010 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:02:02,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:02:02,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:02:02,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 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-10 02:02:02,036 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:02:02,036 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:02:02,045 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:02:02,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:02:02,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 02:02:02,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:02:02,079 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:02,079 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:02:02,412 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:02,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:02:02,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-09-10 02:02:02,415 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:02:02,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 02:02:02,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 02:02:02,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-09-10 02:02:02,416 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 13 states. [2019-09-10 02:02:02,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:02:02,553 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-09-10 02:02:02,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:02:02,555 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2019-09-10 02:02:02,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:02:02,556 INFO L225 Difference]: With dead ends: 21 [2019-09-10 02:02:02,556 INFO L226 Difference]: Without dead ends: 21 [2019-09-10 02:02:02,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-09-10 02:02:02,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-10 02:02:02,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-10 02:02:02,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-10 02:02:02,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-10 02:02:02,559 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-09-10 02:02:02,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:02:02,559 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-10 02:02:02,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 02:02:02,559 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-10 02:02:02,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-10 02:02:02,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:02:02,560 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:02:02,560 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:02:02,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:02:02,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1348629730, now seen corresponding path program 10 times [2019-09-10 02:02:02,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:02:02,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:02:02,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:02:02,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:02:02,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:02:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:02:02,745 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:02,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:02:02,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:02:02,745 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:02:02,746 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:02:02,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:02:02,746 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:02:02,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:02:02,758 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:02:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:02:02,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-10 02:02:02,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:02:02,797 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:02,797 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:02:03,112 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:03,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:02:03,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-09-10 02:02:03,116 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:02:03,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 02:02:03,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 02:02:03,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-10 02:02:03,117 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 14 states. [2019-09-10 02:02:03,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:02:03,254 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-10 02:02:03,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 02:02:03,255 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2019-09-10 02:02:03,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:02:03,256 INFO L225 Difference]: With dead ends: 22 [2019-09-10 02:02:03,256 INFO L226 Difference]: Without dead ends: 22 [2019-09-10 02:02:03,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-10 02:02:03,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-10 02:02:03,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-10 02:02:03,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-10 02:02:03,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-09-10 02:02:03,260 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-09-10 02:02:03,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:02:03,261 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-09-10 02:02:03,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 02:02:03,261 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-09-10 02:02:03,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-10 02:02:03,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:02:03,262 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:02:03,262 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:02:03,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:02:03,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1178612593, now seen corresponding path program 11 times [2019-09-10 02:02:03,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:02:03,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:02:03,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:02:03,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:02:03,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:02:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:02:03,443 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:03,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:02:03,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:02:03,443 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:02:03,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:02:03,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:02:03,444 INFO 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-10 02:02:03,465 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:02:03,465 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:02:33,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-10 02:02:33,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:02:33,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 02:02:33,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:02:33,455 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:33,455 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:02:33,824 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:33,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:02:33,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-09-10 02:02:33,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:02:33,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 02:02:33,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 02:02:33,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-10 02:02:33,831 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 15 states. [2019-09-10 02:02:34,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:02:34,007 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-09-10 02:02:34,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:02:34,007 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2019-09-10 02:02:34,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:02:34,008 INFO L225 Difference]: With dead ends: 23 [2019-09-10 02:02:34,008 INFO L226 Difference]: Without dead ends: 23 [2019-09-10 02:02:34,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-10 02:02:34,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-10 02:02:34,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-10 02:02:34,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-10 02:02:34,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-10 02:02:34,012 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-09-10 02:02:34,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:02:34,013 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-10 02:02:34,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 02:02:34,013 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-10 02:02:34,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 02:02:34,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:02:34,014 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:02:34,014 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:02:34,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:02:34,014 INFO L82 PathProgramCache]: Analyzing trace with hash -2081254018, now seen corresponding path program 12 times [2019-09-10 02:02:34,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:02:34,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:02:34,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:02:34,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:02:34,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:02:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:02:34,238 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:34,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:02:34,239 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:02:34,239 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:02:34,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:02:34,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:02:34,239 INFO 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-10 02:02:34,250 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:02:34,250 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:02:34,261 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:02:34,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:02:34,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-10 02:02:34,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:02:34,301 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:34,302 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:02:34,710 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:34,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:02:34,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-09-10 02:02:34,715 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:02:34,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 02:02:34,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 02:02:34,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-10 02:02:34,716 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 16 states. [2019-09-10 02:02:34,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:02:34,913 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-09-10 02:02:34,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 02:02:34,916 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-09-10 02:02:34,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:02:34,917 INFO L225 Difference]: With dead ends: 24 [2019-09-10 02:02:34,917 INFO L226 Difference]: Without dead ends: 24 [2019-09-10 02:02:34,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-10 02:02:34,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-10 02:02:34,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-10 02:02:34,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-10 02:02:34,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-09-10 02:02:34,920 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-09-10 02:02:34,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:02:34,920 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-09-10 02:02:34,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 02:02:34,921 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-09-10 02:02:34,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-10 02:02:34,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:02:34,921 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:02:34,922 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:02:34,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:02:34,922 INFO L82 PathProgramCache]: Analyzing trace with hash -57903855, now seen corresponding path program 13 times [2019-09-10 02:02:34,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:02:34,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:02:34,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:02:34,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:02:34,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:02:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:02:35,139 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:35,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:02:35,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:02:35,140 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:02:35,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:02:35,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:02:35,141 INFO 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-10 02:02:35,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:02:35,163 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:02:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:02:35,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-10 02:02:35,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:02:35,225 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:35,225 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:02:35,722 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:35,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:02:35,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-09-10 02:02:35,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:02:35,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 02:02:35,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 02:02:35,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-10 02:02:35,728 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 17 states. [2019-09-10 02:02:35,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:02:35,943 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-09-10 02:02:35,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 02:02:35,945 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2019-09-10 02:02:35,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:02:35,946 INFO L225 Difference]: With dead ends: 25 [2019-09-10 02:02:35,946 INFO L226 Difference]: Without dead ends: 25 [2019-09-10 02:02:35,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-10 02:02:35,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-10 02:02:35,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-10 02:02:35,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-10 02:02:35,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-10 02:02:35,950 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-09-10 02:02:35,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:02:35,951 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-10 02:02:35,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 02:02:35,951 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-10 02:02:35,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-10 02:02:35,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:02:35,952 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:02:35,952 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:02:35,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:02:35,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1758558242, now seen corresponding path program 14 times [2019-09-10 02:02:35,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:02:35,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:02:35,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:02:35,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:02:35,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:02:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:02:36,233 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:36,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:02:36,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:02:36,234 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:02:36,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:02:36,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:02:36,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:02:36,245 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:02:36,245 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:02:48,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-10 02:02:48,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:02:48,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-10 02:02:48,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:02:48,751 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:48,752 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:02:49,305 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:49,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:02:49,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-09-10 02:02:49,310 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:02:49,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 02:02:49,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 02:02:49,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 02:02:49,312 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 18 states. [2019-09-10 02:02:49,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:02:49,571 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-09-10 02:02:49,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 02:02:49,574 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-09-10 02:02:49,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:02:49,575 INFO L225 Difference]: With dead ends: 26 [2019-09-10 02:02:49,575 INFO L226 Difference]: Without dead ends: 26 [2019-09-10 02:02:49,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 02:02:49,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-10 02:02:49,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-10 02:02:49,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-10 02:02:49,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-09-10 02:02:49,578 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-09-10 02:02:49,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:02:49,579 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-09-10 02:02:49,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 02:02:49,579 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-09-10 02:02:49,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-10 02:02:49,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:02:49,580 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:02:49,580 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:02:49,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:02:49,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1355730609, now seen corresponding path program 15 times [2019-09-10 02:02:49,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:02:49,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:02:49,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:02:49,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:02:49,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:02:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:02:49,841 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:49,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:02:49,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:02:49,842 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:02:49,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:02:49,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:02:49,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 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-10 02:02:49,852 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:02:49,852 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:02:49,865 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:02:49,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:02:49,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-10 02:02:49,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:02:49,900 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:49,900 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:02:50,485 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:50,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:02:50,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-09-10 02:02:50,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:02:50,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 02:02:50,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 02:02:50,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 02:02:50,490 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 19 states. [2019-09-10 02:02:50,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:02:50,756 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-09-10 02:02:50,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 02:02:50,758 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-09-10 02:02:50,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:02:50,759 INFO L225 Difference]: With dead ends: 27 [2019-09-10 02:02:50,759 INFO L226 Difference]: Without dead ends: 27 [2019-09-10 02:02:50,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 02:02:50,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-10 02:02:50,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-10 02:02:50,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-10 02:02:50,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-10 02:02:50,762 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-09-10 02:02:50,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:02:50,762 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-10 02:02:50,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 02:02:50,763 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-10 02:02:50,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-10 02:02:50,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:02:50,763 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:02:50,764 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:02:50,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:02:50,764 INFO L82 PathProgramCache]: Analyzing trace with hash -885562818, now seen corresponding path program 16 times [2019-09-10 02:02:50,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:02:50,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:02:50,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:02:50,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:02:50,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:02:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:02:51,083 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:51,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:02:51,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:02:51,083 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:02:51,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:02:51,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:02:51,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 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-10 02:02:51,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:02:51,094 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:02:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:02:51,107 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-10 02:02:51,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:02:51,141 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:51,141 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:02:51,825 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:51,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:02:51,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-09-10 02:02:51,828 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:02:51,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 02:02:51,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 02:02:51,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 02:02:51,829 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 20 states. [2019-09-10 02:02:52,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:02:52,095 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-09-10 02:02:52,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 02:02:52,095 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2019-09-10 02:02:52,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:02:52,096 INFO L225 Difference]: With dead ends: 28 [2019-09-10 02:02:52,096 INFO L226 Difference]: Without dead ends: 28 [2019-09-10 02:02:52,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 02:02:52,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-10 02:02:52,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-10 02:02:52,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-10 02:02:52,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-09-10 02:02:52,100 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-09-10 02:02:52,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:02:52,100 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-09-10 02:02:52,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 02:02:52,100 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-09-10 02:02:52,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-10 02:02:52,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:02:52,101 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:02:52,101 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:02:52,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:02:52,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1646182319, now seen corresponding path program 17 times [2019-09-10 02:02:52,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:02:52,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:02:52,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:02:52,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:02:52,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:02:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:02:52,405 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:52,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:02:52,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:02:52,406 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:02:52,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:02:52,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:02:52,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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:02:52,431 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:02:52,431 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:03:04,816 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-10 02:03:04,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:03:04,823 WARN L254 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-10 02:03:04,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:03:04,873 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:03:04,873 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:03:05,767 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:03:05,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:03:05,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-09-10 02:03:05,773 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:03:05,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 02:03:05,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 02:03:05,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 02:03:05,774 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 21 states. [2019-09-10 02:03:06,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:03:06,102 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-09-10 02:03:06,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 02:03:06,106 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2019-09-10 02:03:06,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:03:06,107 INFO L225 Difference]: With dead ends: 29 [2019-09-10 02:03:06,107 INFO L226 Difference]: Without dead ends: 29 [2019-09-10 02:03:06,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 02:03:06,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-10 02:03:06,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-10 02:03:06,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-10 02:03:06,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-10 02:03:06,110 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-09-10 02:03:06,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:03:06,111 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-10 02:03:06,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 02:03:06,111 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-10 02:03:06,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-10 02:03:06,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:03:06,112 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:03:06,112 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:03:06,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:03:06,112 INFO L82 PathProgramCache]: Analyzing trace with hash 544416926, now seen corresponding path program 18 times [2019-09-10 02:03:06,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:03:06,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:03:06,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:03:06,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:03:06,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:03:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:03:06,424 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:03:06,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:03:06,424 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:03:06,424 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:03:06,424 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:03:06,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:03:06,424 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:03:06,440 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:03:06,440 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:03:06,455 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:03:06,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:03:06,457 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-10 02:03:06,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:03:06,499 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:03:06,500 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:03:07,693 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:03:07,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:03:07,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-09-10 02:03:07,696 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:03:07,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 02:03:07,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 02:03:07,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 02:03:07,698 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 22 states. [2019-09-10 02:03:08,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:03:08,067 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-09-10 02:03:08,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 02:03:08,068 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2019-09-10 02:03:08,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:03:08,069 INFO L225 Difference]: With dead ends: 30 [2019-09-10 02:03:08,069 INFO L226 Difference]: Without dead ends: 30 [2019-09-10 02:03:08,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 02:03:08,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-10 02:03:08,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-10 02:03:08,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-10 02:03:08,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-09-10 02:03:08,073 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-09-10 02:03:08,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:03:08,074 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-09-10 02:03:08,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 02:03:08,074 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-09-10 02:03:08,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-10 02:03:08,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:03:08,075 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:03:08,075 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:03:08,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:03:08,075 INFO L82 PathProgramCache]: Analyzing trace with hash -266483215, now seen corresponding path program 19 times [2019-09-10 02:03:08,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:03:08,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:03:08,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:03:08,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:03:08,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:03:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:03:08,412 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:03:08,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:03:08,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:03:08,413 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:03:08,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:03:08,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:03:08,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:03:08,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:03:08,425 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:03:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:03:08,441 WARN L254 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-10 02:03:08,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:03:08,481 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:03:08,481 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:03:09,361 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:03:09,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:03:09,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-09-10 02:03:09,365 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:03:09,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 02:03:09,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 02:03:09,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 02:03:09,367 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 23 states. [2019-09-10 02:03:09,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:03:09,737 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-09-10 02:03:09,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 02:03:09,737 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2019-09-10 02:03:09,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:03:09,738 INFO L225 Difference]: With dead ends: 31 [2019-09-10 02:03:09,738 INFO L226 Difference]: Without dead ends: 31 [2019-09-10 02:03:09,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 02:03:09,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-10 02:03:09,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-10 02:03:09,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-10 02:03:09,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-10 02:03:09,743 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-09-10 02:03:09,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:03:09,743 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-10 02:03:09,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 02:03:09,743 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-10 02:03:09,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-10 02:03:09,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:03:09,744 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:03:09,744 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:03:09,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:03:09,744 INFO L82 PathProgramCache]: Analyzing trace with hash 365416190, now seen corresponding path program 20 times [2019-09-10 02:03:09,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:03:09,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:03:09,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:03:09,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:03:09,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:03:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:03:10,145 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:03:10,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:03:10,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:03:10,146 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:03:10,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:03:10,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:03:10,146 INFO 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) [2019-09-10 02:03:10,159 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:03:10,160 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:03:53,086 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-10 02:03:53,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:03:53,318 WARN L254 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-10 02:03:53,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:03:53,376 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:03:53,376 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:03:54,344 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:03:54,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:03:54,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-09-10 02:03:54,350 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:03:54,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 02:03:54,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 02:03:54,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 02:03:54,351 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 24 states. [2019-09-10 02:03:54,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:03:54,778 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-09-10 02:03:54,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 02:03:54,780 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2019-09-10 02:03:54,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:03:54,781 INFO L225 Difference]: With dead ends: 32 [2019-09-10 02:03:54,781 INFO L226 Difference]: Without dead ends: 32 [2019-09-10 02:03:54,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 02:03:54,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-10 02:03:54,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-10 02:03:54,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-10 02:03:54,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-09-10 02:03:54,784 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-09-10 02:03:54,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:03:54,785 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-09-10 02:03:54,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 02:03:54,785 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-09-10 02:03:54,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-10 02:03:54,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:03:54,786 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:03:54,786 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:03:54,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:03:54,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1520538735, now seen corresponding path program 21 times [2019-09-10 02:03:54,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:03:54,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:03:54,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:03:54,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:03:54,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:03:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:03:55,223 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:03:55,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:03:55,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:03:55,223 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:03:55,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:03:55,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:03:55,224 INFO 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-10 02:03:55,245 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:03:55,246 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:03:55,264 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:03:55,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:03:55,265 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-10 02:03:55,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:03:55,307 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:03:55,307 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:03:56,438 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:03:56,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:03:56,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-09-10 02:03:56,441 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:03:56,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 02:03:56,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 02:03:56,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 02:03:56,442 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 25 states. [2019-09-10 02:03:56,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:03:56,898 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-09-10 02:03:56,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 02:03:56,900 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2019-09-10 02:03:56,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:03:56,901 INFO L225 Difference]: With dead ends: 33 [2019-09-10 02:03:56,901 INFO L226 Difference]: Without dead ends: 33 [2019-09-10 02:03:56,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 02:03:56,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-10 02:03:56,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-10 02:03:56,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-10 02:03:56,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-10 02:03:56,906 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-09-10 02:03:56,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:03:56,906 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-10 02:03:56,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 02:03:56,906 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-10 02:03:56,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-10 02:03:56,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:03:56,907 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:03:56,907 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:03:56,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:03:56,907 INFO L82 PathProgramCache]: Analyzing trace with hash 144400734, now seen corresponding path program 22 times [2019-09-10 02:03:56,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:03:56,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:03:56,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:03:56,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:03:56,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:03:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:03:57,376 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:03:57,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:03:57,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:03:57,376 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:03:57,376 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:03:57,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:03:57,377 INFO 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-10 02:03:57,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:03:57,398 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:03:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:03:57,416 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-10 02:03:57,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:03:57,458 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:03:57,458 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:04:00,057 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:00,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:04:00,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-09-10 02:04:00,061 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:04:00,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 02:04:00,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 02:04:00,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 02:04:00,062 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 26 states. [2019-09-10 02:04:00,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:00,527 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-09-10 02:04:00,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 02:04:00,527 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 32 [2019-09-10 02:04:00,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:00,528 INFO L225 Difference]: With dead ends: 34 [2019-09-10 02:04:00,528 INFO L226 Difference]: Without dead ends: 34 [2019-09-10 02:04:00,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 02:04:00,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-10 02:04:00,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-09-10 02:04:00,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-10 02:04:00,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-09-10 02:04:00,532 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-09-10 02:04:00,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:00,533 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-09-10 02:04:00,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 02:04:00,533 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-09-10 02:04:00,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-10 02:04:00,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:00,534 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:00,542 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:00,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:00,543 INFO L82 PathProgramCache]: Analyzing trace with hash 217916721, now seen corresponding path program 23 times [2019-09-10 02:04:00,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:00,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:00,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:00,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:00,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:01,056 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:01,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:04:01,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:04:01,056 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:04:01,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:04:01,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:04:01,056 INFO 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) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:04:01,069 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:04:01,070 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:05:53,567 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-10 02:05:53,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:54,379 WARN L254 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-10 02:05:54,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:54,446 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:05:54,447 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:55,797 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:05:55,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:55,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-09-10 02:05:55,804 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:55,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 02:05:55,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 02:05:55,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 02:05:55,805 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 27 states. [2019-09-10 02:05:56,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:56,332 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-09-10 02:05:56,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 02:05:56,333 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 33 [2019-09-10 02:05:56,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:56,334 INFO L225 Difference]: With dead ends: 35 [2019-09-10 02:05:56,334 INFO L226 Difference]: Without dead ends: 35 [2019-09-10 02:05:56,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 02:05:56,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-10 02:05:56,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-10 02:05:56,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-10 02:05:56,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-09-10 02:05:56,337 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-09-10 02:05:56,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:56,337 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-09-10 02:05:56,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 02:05:56,337 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-09-10 02:05:56,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-10 02:05:56,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:56,338 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:56,338 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:56,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:56,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1798054978, now seen corresponding path program 24 times [2019-09-10 02:05:56,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:56,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:56,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:56,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:56,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:56,794 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:05:56,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:56,795 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:56,795 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:56,795 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:56,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:56,795 INFO 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-10 02:05:56,811 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:05:56,811 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:05:56,827 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:05:56,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:56,828 WARN L254 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-10 02:05:56,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:56,893 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:05:56,893 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:58,348 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:05:58,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:58,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-09-10 02:05:58,351 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:58,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 02:05:58,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 02:05:58,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 02:05:58,354 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 28 states. [2019-09-10 02:05:58,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:58,925 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-09-10 02:05:58,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 02:05:58,926 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2019-09-10 02:05:58,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:58,926 INFO L225 Difference]: With dead ends: 36 [2019-09-10 02:05:58,926 INFO L226 Difference]: Without dead ends: 36 [2019-09-10 02:05:58,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 02:05:58,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-10 02:05:58,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-10 02:05:58,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-10 02:05:58,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-09-10 02:05:58,931 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-09-10 02:05:58,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:58,931 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-09-10 02:05:58,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 02:05:58,931 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-09-10 02:05:58,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-10 02:05:58,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:58,932 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:58,932 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:58,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:58,932 INFO L82 PathProgramCache]: Analyzing trace with hash 131331793, now seen corresponding path program 25 times [2019-09-10 02:05:58,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:58,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:58,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:58,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:58,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:59,395 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:05:59,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:59,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:59,395 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:59,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:59,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:59,396 INFO 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-10 02:05:59,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:59,407 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:05:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:59,444 WARN L254 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-10 02:05:59,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:59,493 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:05:59,494 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:01,174 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:01,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:01,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-09-10 02:06:01,178 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:01,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-10 02:06:01,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-10 02:06:01,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 02:06:01,179 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 29 states. [2019-09-10 02:06:01,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:01,803 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-09-10 02:06:01,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 02:06:01,803 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 35 [2019-09-10 02:06:01,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:01,804 INFO L225 Difference]: With dead ends: 37 [2019-09-10 02:06:01,804 INFO L226 Difference]: Without dead ends: 37 [2019-09-10 02:06:01,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 02:06:01,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-10 02:06:01,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-10 02:06:01,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-10 02:06:01,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-09-10 02:06:01,808 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-09-10 02:06:01,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:01,808 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-09-10 02:06:01,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-10 02:06:01,808 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-09-10 02:06:01,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-10 02:06:01,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:01,809 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:01,809 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:01,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:01,810 INFO L82 PathProgramCache]: Analyzing trace with hash -187220450, now seen corresponding path program 26 times [2019-09-10 02:06:01,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:01,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:01,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:01,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:01,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:02,326 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:02,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:02,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:02,327 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:02,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:02,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:02,327 INFO 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-10 02:06:02,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:06:02,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:08:12,421 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-10 02:08:12,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:12,787 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-10 02:08:12,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:12,833 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:12,834 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:14,489 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:14,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:14,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-09-10 02:08:14,496 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:14,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 02:08:14,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 02:08:14,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=894, Invalid=2298, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 02:08:14,497 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 30 states. [2019-09-10 02:08:15,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:15,157 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-09-10 02:08:15,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 02:08:15,158 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2019-09-10 02:08:15,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:15,159 INFO L225 Difference]: With dead ends: 38 [2019-09-10 02:08:15,159 INFO L226 Difference]: Without dead ends: 38 [2019-09-10 02:08:15,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=894, Invalid=2298, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 02:08:15,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-10 02:08:15,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-09-10 02:08:15,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-10 02:08:15,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-09-10 02:08:15,163 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-09-10 02:08:15,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:15,163 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-09-10 02:08:15,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 02:08:15,164 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-09-10 02:08:15,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-10 02:08:15,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:15,164 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:15,165 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:15,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:15,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1472405391, now seen corresponding path program 27 times [2019-09-10 02:08:15,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:15,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:15,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:15,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:15,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:15,710 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:15,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:15,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:15,710 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:15,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:15,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:15,711 INFO 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-10 02:08:15,724 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:15,724 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:08:15,741 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:15,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:15,742 WARN L254 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-10 02:08:15,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:15,782 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:15,782 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:17,600 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:17,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:17,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-09-10 02:08:17,603 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:17,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 02:08:17,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 02:08:17,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 02:08:17,605 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 31 states. [2019-09-10 02:08:18,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:18,284 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-09-10 02:08:18,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 02:08:18,284 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 37 [2019-09-10 02:08:18,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:18,285 INFO L225 Difference]: With dead ends: 39 [2019-09-10 02:08:18,285 INFO L226 Difference]: Without dead ends: 39 [2019-09-10 02:08:18,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 02:08:18,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-10 02:08:18,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-10 02:08:18,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-10 02:08:18,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-09-10 02:08:18,289 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-09-10 02:08:18,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:18,289 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-09-10 02:08:18,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 02:08:18,290 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-09-10 02:08:18,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-10 02:08:18,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:18,290 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:18,291 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:18,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:18,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1636534398, now seen corresponding path program 28 times [2019-09-10 02:08:18,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:18,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:18,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:18,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:18,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:19,043 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:19,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:19,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:19,043 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:19,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:19,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:19,043 INFO 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-10 02:08:19,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:19,054 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:08:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:19,086 WARN L254 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-10 02:08:19,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:19,132 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:19,132 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:21,145 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:21,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:21,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-09-10 02:08:21,148 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:21,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 02:08:21,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 02:08:21,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 02:08:21,151 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 32 states. [2019-09-10 02:08:21,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:21,957 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-09-10 02:08:21,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 02:08:21,957 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 38 [2019-09-10 02:08:21,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:21,958 INFO L225 Difference]: With dead ends: 40 [2019-09-10 02:08:21,958 INFO L226 Difference]: Without dead ends: 40 [2019-09-10 02:08:21,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 02:08:21,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-10 02:08:21,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-10 02:08:21,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-10 02:08:21,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-09-10 02:08:21,961 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-09-10 02:08:21,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:21,962 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-09-10 02:08:21,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 02:08:21,962 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-09-10 02:08:21,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-10 02:08:21,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:21,963 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:21,963 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:21,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:21,963 INFO L82 PathProgramCache]: Analyzing trace with hash -770579951, now seen corresponding path program 29 times [2019-09-10 02:08:21,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:21,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:21,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:21,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:21,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:22,843 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:22,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:22,844 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:22,844 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:22,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:22,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:22,844 INFO 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) [2019-09-10 02:08:22,859 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:08:22,859 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:19,116 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-10 02:09:19,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:19,138 WARN L254 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-10 02:09:19,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:19,196 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:19,197 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:21,369 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:21,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:21,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-09-10 02:09:21,377 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:21,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-10 02:09:21,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-10 02:09:21,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=2823, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 02:09:21,378 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 33 states. [2019-09-10 02:09:22,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:22,215 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-09-10 02:09:22,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 02:09:22,215 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2019-09-10 02:09:22,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:22,216 INFO L225 Difference]: With dead ends: 41 [2019-09-10 02:09:22,216 INFO L226 Difference]: Without dead ends: 41 [2019-09-10 02:09:22,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1083, Invalid=2823, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 02:09:22,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-10 02:09:22,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-10 02:09:22,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-10 02:09:22,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-09-10 02:09:22,222 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-09-10 02:09:22,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:22,222 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-09-10 02:09:22,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-10 02:09:22,222 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-09-10 02:09:22,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-10 02:09:22,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:22,223 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:22,223 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:22,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:22,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1918286558, now seen corresponding path program 30 times [2019-09-10 02:09:22,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:22,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:22,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:22,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:22,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:23,083 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:23,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:23,084 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:23,085 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:23,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:23,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:23,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 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-10 02:09:23,117 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:09:23,117 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:09:23,150 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:09:23,150 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:23,153 WARN L254 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-10 02:09:23,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:23,253 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:23,253 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:26,069 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:26,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:26,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-09-10 02:09:26,073 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:26,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-10 02:09:26,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-10 02:09:26,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1150, Invalid=3010, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 02:09:26,074 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 34 states. [2019-09-10 02:09:26,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:26,932 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-09-10 02:09:26,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 02:09:26,933 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 40 [2019-09-10 02:09:26,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:26,933 INFO L225 Difference]: With dead ends: 42 [2019-09-10 02:09:26,933 INFO L226 Difference]: Without dead ends: 42 [2019-09-10 02:09:26,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1150, Invalid=3010, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 02:09:26,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-10 02:09:26,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-10 02:09:26,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-10 02:09:26,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-09-10 02:09:26,936 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-09-10 02:09:26,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:26,936 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-09-10 02:09:26,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-10 02:09:26,937 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-09-10 02:09:26,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-10 02:09:26,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:26,938 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:26,938 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:26,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:26,938 INFO L82 PathProgramCache]: Analyzing trace with hash -626197583, now seen corresponding path program 31 times [2019-09-10 02:09:26,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:26,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:26,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:26,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:26,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:26,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:27,695 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:27,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:27,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:27,696 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:27,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:27,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:27,696 INFO 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) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:27,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:27,707 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:09:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:27,729 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-10 02:09:27,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:27,774 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:27,774 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:30,208 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:30,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:30,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-09-10 02:09:30,211 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:30,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-10 02:09:30,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-10 02:09:30,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1219, Invalid=3203, Unknown=0, NotChecked=0, Total=4422 [2019-09-10 02:09:30,213 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 35 states. [2019-09-10 02:09:31,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:31,163 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-09-10 02:09:31,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 02:09:31,167 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 41 [2019-09-10 02:09:31,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:31,168 INFO L225 Difference]: With dead ends: 43 [2019-09-10 02:09:31,168 INFO L226 Difference]: Without dead ends: 43 [2019-09-10 02:09:31,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1219, Invalid=3203, Unknown=0, NotChecked=0, Total=4422 [2019-09-10 02:09:31,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-10 02:09:31,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-10 02:09:31,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-10 02:09:31,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-09-10 02:09:31,173 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-09-10 02:09:31,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:31,173 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-09-10 02:09:31,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-10 02:09:31,173 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-09-10 02:09:31,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-10 02:09:31,174 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:31,174 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:31,174 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:31,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:31,174 INFO L82 PathProgramCache]: Analyzing trace with hash 2099172670, now seen corresponding path program 32 times [2019-09-10 02:09:31,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:31,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:31,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:31,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:31,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:31,984 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:31,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:31,984 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:31,985 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:31,985 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:31,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:31,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 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-10 02:09:31,996 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:09:31,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:09:40,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-10 02:09:40,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:40,617 WARN L254 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-10 02:09:40,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:40,664 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:40,664 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:43,151 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:43,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:43,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-09-10 02:09:43,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:43,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 02:09:43,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 02:09:43,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1290, Invalid=3402, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 02:09:43,159 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 36 states. [2019-09-10 02:09:44,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:44,157 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-09-10 02:09:44,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 02:09:44,157 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 42 [2019-09-10 02:09:44,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:44,158 INFO L225 Difference]: With dead ends: 44 [2019-09-10 02:09:44,159 INFO L226 Difference]: Without dead ends: 44 [2019-09-10 02:09:44,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1290, Invalid=3402, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 02:09:44,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-10 02:09:44,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-10 02:09:44,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-10 02:09:44,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-09-10 02:09:44,161 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-09-10 02:09:44,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:44,162 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-09-10 02:09:44,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-10 02:09:44,162 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-09-10 02:09:44,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-10 02:09:44,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:44,163 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:44,163 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:44,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:44,163 INFO L82 PathProgramCache]: Analyzing trace with hash 686304593, now seen corresponding path program 33 times [2019-09-10 02:09:44,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:44,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:44,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:44,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:44,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:44,947 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:44,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:44,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:44,948 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:44,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:44,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:44,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10 02:09:44,958 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:09:44,959 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:09:44,981 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:09:44,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:44,984 WARN L254 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-10 02:09:44,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:45,029 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:45,029 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:47,630 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:47,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:47,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-09-10 02:09:47,633 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:47,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-10 02:09:47,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-10 02:09:47,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1363, Invalid=3607, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 02:09:47,634 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 37 states. [2019-09-10 02:09:48,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:48,667 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-09-10 02:09:48,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 02:09:48,667 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 43 [2019-09-10 02:09:48,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:48,668 INFO L225 Difference]: With dead ends: 45 [2019-09-10 02:09:48,668 INFO L226 Difference]: Without dead ends: 45 [2019-09-10 02:09:48,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1363, Invalid=3607, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 02:09:48,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-10 02:09:48,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-10 02:09:48,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-10 02:09:48,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-09-10 02:09:48,678 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-09-10 02:09:48,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:48,678 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-09-10 02:09:48,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-10 02:09:48,679 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-09-10 02:09:48,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-10 02:09:48,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:48,681 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:48,681 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:48,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:48,682 INFO L82 PathProgramCache]: Analyzing trace with hash -162932834, now seen corresponding path program 34 times [2019-09-10 02:09:48,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:48,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:48,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:48,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:48,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:49,469 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:49,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:49,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:49,470 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:49,470 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:49,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:49,470 INFO 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-10 02:09:49,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:49,496 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:09:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:49,518 WARN L254 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-10 02:09:49,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:49,561 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:49,562 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:52,362 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:52,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:52,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-09-10 02:09:52,366 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:52,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-10 02:09:52,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-10 02:09:52,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1438, Invalid=3818, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 02:09:52,367 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 38 states. [2019-09-10 02:09:53,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:53,448 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-09-10 02:09:53,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 02:09:53,449 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 44 [2019-09-10 02:09:53,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:53,450 INFO L225 Difference]: With dead ends: 46 [2019-09-10 02:09:53,450 INFO L226 Difference]: Without dead ends: 46 [2019-09-10 02:09:53,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1438, Invalid=3818, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 02:09:53,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-10 02:09:53,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-09-10 02:09:53,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-10 02:09:53,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-09-10 02:09:53,453 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-09-10 02:09:53,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:53,453 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-09-10 02:09:53,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-10 02:09:53,453 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-09-10 02:09:53,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-10 02:09:53,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:53,454 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:53,454 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:53,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:53,455 INFO L82 PathProgramCache]: Analyzing trace with hash -719489295, now seen corresponding path program 35 times [2019-09-10 02:09:53,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:53,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:53,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:53,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:53,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:54,569 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:54,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:54,570 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:54,570 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:54,570 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:54,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:54,570 INFO 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) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:54,592 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:09:54,593 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:12:31,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-09-10 02:12:31,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:12:31,634 WARN L254 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-10 02:12:31,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:12:31,686 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:12:31,686 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:12:34,637 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:12:34,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:12:34,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-09-10 02:12:34,645 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:12:34,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-10 02:12:34,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-10 02:12:34,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1515, Invalid=4035, Unknown=0, NotChecked=0, Total=5550 [2019-09-10 02:12:34,645 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 39 states. [2019-09-10 02:12:35,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:12:35,727 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-09-10 02:12:35,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-10 02:12:35,728 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 45 [2019-09-10 02:12:35,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:12:35,729 INFO L225 Difference]: With dead ends: 47 [2019-09-10 02:12:35,729 INFO L226 Difference]: Without dead ends: 47 [2019-09-10 02:12:35,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1515, Invalid=4035, Unknown=0, NotChecked=0, Total=5550 [2019-09-10 02:12:35,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-10 02:12:35,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-09-10 02:12:35,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-10 02:12:35,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-09-10 02:12:35,732 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-09-10 02:12:35,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:12:35,732 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-09-10 02:12:35,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-10 02:12:35,732 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-09-10 02:12:35,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-10 02:12:35,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:12:35,732 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:12:35,733 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:12:35,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:12:35,733 INFO L82 PathProgramCache]: Analyzing trace with hash -792870402, now seen corresponding path program 36 times [2019-09-10 02:12:35,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:12:35,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:35,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:12:35,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:35,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:12:35,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:12:36,593 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:12:36,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:36,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:12:36,594 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:12:36,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:12:36,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:36,594 INFO 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-10 02:12:36,610 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:12:36,611 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:12:36,639 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:12:36,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:12:36,641 WARN L254 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-10 02:12:36,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:12:36,700 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:12:36,700 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:12:40,092 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:12:40,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:12:40,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-09-10 02:12:40,095 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:12:40,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-10 02:12:40,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-10 02:12:40,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1594, Invalid=4258, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 02:12:40,096 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 40 states. [2019-09-10 02:12:41,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:12:41,286 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-09-10 02:12:41,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-10 02:12:41,286 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 46 [2019-09-10 02:12:41,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:12:41,287 INFO L225 Difference]: With dead ends: 48 [2019-09-10 02:12:41,287 INFO L226 Difference]: Without dead ends: 48 [2019-09-10 02:12:41,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1594, Invalid=4258, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 02:12:41,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-10 02:12:41,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-09-10 02:12:41,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-10 02:12:41,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-09-10 02:12:41,289 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-09-10 02:12:41,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:12:41,289 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-09-10 02:12:41,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-10 02:12:41,290 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-09-10 02:12:41,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-10 02:12:41,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:12:41,290 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:12:41,291 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:12:41,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:12:41,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1227282577, now seen corresponding path program 37 times [2019-09-10 02:12:41,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:12:41,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:41,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:12:41,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:41,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:12:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:12:42,194 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:12:42,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:42,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:12:42,194 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:12:42,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:12:42,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:42,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 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-10 02:12:42,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:12:42,211 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:12:42,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:12:42,239 WARN L254 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-10 02:12:42,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:12:42,289 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:12:42,289 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:12:46,051 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:12:46,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:12:46,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-09-10 02:12:46,055 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:12:46,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-10 02:12:46,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-10 02:12:46,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1675, Invalid=4487, Unknown=0, NotChecked=0, Total=6162 [2019-09-10 02:12:46,056 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 41 states. [2019-09-10 02:12:47,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:12:47,328 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-09-10 02:12:47,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-10 02:12:47,329 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 47 [2019-09-10 02:12:47,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:12:47,330 INFO L225 Difference]: With dead ends: 49 [2019-09-10 02:12:47,330 INFO L226 Difference]: Without dead ends: 49 [2019-09-10 02:12:47,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1675, Invalid=4487, Unknown=0, NotChecked=0, Total=6162 [2019-09-10 02:12:47,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-10 02:12:47,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-09-10 02:12:47,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-10 02:12:47,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-09-10 02:12:47,332 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-09-10 02:12:47,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:12:47,333 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-09-10 02:12:47,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-10 02:12:47,333 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-09-10 02:12:47,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-10 02:12:47,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:12:47,334 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:12:47,334 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:12:47,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:12:47,334 INFO L82 PathProgramCache]: Analyzing trace with hash -572484514, now seen corresponding path program 38 times [2019-09-10 02:12:47,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:12:47,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:47,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:12:47,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:47,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:12:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:12:48,308 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:12:48,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:48,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:12:48,308 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:12:48,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:12:48,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:48,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 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-10 02:12:48,318 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:12:48,318 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:14:35,358 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-10 02:14:35,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:14:35,397 WARN L254 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-10 02:14:35,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:14:35,499 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:14:35,499 INFO L322 TraceCheckSpWp]: Computing backward predicates...