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-lit/gr2006.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:07:49,322 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:07:49,325 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:07:49,341 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:07:49,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:07:49,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:07:49,345 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:07:49,354 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:07:49,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:07:49,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:07:49,362 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:07:49,364 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:07:49,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:07:49,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:07:49,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:07:49,370 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:07:49,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:07:49,373 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:07:49,375 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:07:49,379 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:07:49,383 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:07:49,384 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:07:49,387 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:07:49,388 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:07:49,390 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:07:49,390 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:07:49,390 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:07:49,392 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:07:49,393 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:07:49,394 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:07:49,394 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:07:49,395 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:07:49,396 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:07:49,397 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:07:49,399 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:07:49,399 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:07:49,399 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:07:49,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:07:49,400 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:07:49,400 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:07:49,401 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:07:49,402 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:07:49,437 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:07:49,437 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:07:49,437 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:07:49,438 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:07:49,438 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:07:49,438 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:07:49,439 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:07:49,439 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:07:49,439 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:07:49,442 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:07:49,443 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:07:49,443 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:07:49,444 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:07:49,444 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:07:49,444 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:07:49,444 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:07:49,444 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:07:49,445 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:07:49,445 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:07:49,445 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:07:49,448 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:07:49,448 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:07:49,448 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:07:49,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:07:49,449 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:07:49,449 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:07:49,449 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:07:49,449 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:07:49,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:07:49,449 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:07:49,498 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:07:49,512 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:07:49,515 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:07:49,517 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:07:49,517 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:07:49,518 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gr2006.i [2019-09-10 02:07:49,582 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f69f0c885/e39d942032424b16960111c8a2530671/FLAGaf5d79c95 [2019-09-10 02:07:49,976 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:07:49,977 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gr2006.i [2019-09-10 02:07:49,982 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f69f0c885/e39d942032424b16960111c8a2530671/FLAGaf5d79c95 [2019-09-10 02:07:50,406 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f69f0c885/e39d942032424b16960111c8a2530671 [2019-09-10 02:07:50,415 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:07:50,416 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:07:50,418 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:07:50,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:07:50,422 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:07:50,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:07:50" (1/1) ... [2019-09-10 02:07:50,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11ecd5ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:07:50, skipping insertion in model container [2019-09-10 02:07:50,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:07:50" (1/1) ... [2019-09-10 02:07:50,433 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:07:50,446 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:07:50,590 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:07:50,593 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:07:50,606 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:07:50,617 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:07:50,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:07:50 WrapperNode [2019-09-10 02:07:50,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:07:50,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:07:50,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:07:50,619 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:07:50,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:07:50" (1/1) ... [2019-09-10 02:07:50,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:07:50" (1/1) ... [2019-09-10 02:07:50,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:07:50" (1/1) ... [2019-09-10 02:07:50,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:07:50" (1/1) ... [2019-09-10 02:07:50,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:07:50" (1/1) ... [2019-09-10 02:07:50,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:07:50" (1/1) ... [2019-09-10 02:07:50,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:07:50" (1/1) ... [2019-09-10 02:07:50,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:07:50,734 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:07:50,734 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:07:50,734 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:07:50,735 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:07:50" (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:07:50,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:07:50,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:07:50,794 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-10 02:07:50,794 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:07:50,794 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:07:50,794 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 02:07:50,794 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 02:07:50,794 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:07:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:07:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:07:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:07:50,939 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:07:50,939 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 02:07:50,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:07:50 BoogieIcfgContainer [2019-09-10 02:07:50,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:07:50,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:07:50,941 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:07:50,944 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:07:50,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:07:50" (1/3) ... [2019-09-10 02:07:50,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43a08e29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:07:50, skipping insertion in model container [2019-09-10 02:07:50,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:07:50" (2/3) ... [2019-09-10 02:07:50,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43a08e29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:07:50, skipping insertion in model container [2019-09-10 02:07:50,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:07:50" (3/3) ... [2019-09-10 02:07:50,948 INFO L109 eAbstractionObserver]: Analyzing ICFG gr2006.i [2019-09-10 02:07:50,957 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:07:50,970 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:07:50,985 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:07:51,010 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:07:51,010 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:07:51,010 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:07:51,011 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:07:51,011 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:07:51,011 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:07:51,011 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:07:51,011 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:07:51,022 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-09-10 02:07:51,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 02:07:51,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:51,031 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:51,033 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:51,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:51,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1001202113, now seen corresponding path program 1 times [2019-09-10 02:07:51,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:51,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:51,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:51,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:51,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:51,123 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:07:51,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:07:51,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 02:07:51,125 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:07:51,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:07:51,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:07:51,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:07:51,141 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-09-10 02:07:51,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:51,154 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-09-10 02:07:51,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:07:51,156 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-10 02:07:51,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:51,163 INFO L225 Difference]: With dead ends: 20 [2019-09-10 02:07:51,163 INFO L226 Difference]: Without dead ends: 13 [2019-09-10 02:07:51,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:07:51,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-10 02:07:51,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-10 02:07:51,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-10 02:07:51,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-09-10 02:07:51,190 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-09-10 02:07:51,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:51,191 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-09-10 02:07:51,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:07:51,191 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-09-10 02:07:51,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-10 02:07:51,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:51,192 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:51,192 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:51,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:51,193 INFO L82 PathProgramCache]: Analyzing trace with hash 563077882, now seen corresponding path program 1 times [2019-09-10 02:07:51,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:51,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:51,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:51,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:51,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:51,248 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:07:51,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:07:51,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:07:51,248 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:07:51,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:07:51,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:07:51,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:07:51,251 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 4 states. [2019-09-10 02:07:51,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:51,324 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-09-10 02:07:51,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:07:51,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-10 02:07:51,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:51,326 INFO L225 Difference]: With dead ends: 17 [2019-09-10 02:07:51,326 INFO L226 Difference]: Without dead ends: 17 [2019-09-10 02:07:51,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:07:51,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-10 02:07:51,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-10 02:07:51,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-10 02:07:51,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-09-10 02:07:51,332 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2019-09-10 02:07:51,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:51,333 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-09-10 02:07:51,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:07:51,333 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-09-10 02:07:51,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-10 02:07:51,333 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:51,334 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:51,334 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:51,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:51,344 INFO L82 PathProgramCache]: Analyzing trace with hash 620336184, now seen corresponding path program 1 times [2019-09-10 02:07:51,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:51,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:51,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:51,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:51,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:51,382 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:07:51,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:07:51,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:07:51,383 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:07:51,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:07:51,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:07:51,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:07:51,384 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2019-09-10 02:07:51,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:51,396 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-09-10 02:07:51,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:07:51,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-09-10 02:07:51,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:51,398 INFO L225 Difference]: With dead ends: 20 [2019-09-10 02:07:51,398 INFO L226 Difference]: Without dead ends: 20 [2019-09-10 02:07:51,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:07:51,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-10 02:07:51,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-09-10 02:07:51,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-10 02:07:51,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-09-10 02:07:51,403 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2019-09-10 02:07:51,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:51,403 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-09-10 02:07:51,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:07:51,403 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-09-10 02:07:51,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 02:07:51,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:51,404 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:51,405 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:51,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:51,405 INFO L82 PathProgramCache]: Analyzing trace with hash -657196198, now seen corresponding path program 1 times [2019-09-10 02:07:51,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:51,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:51,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:51,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:51,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:51,449 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 02:07:51,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:51,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:51,451 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2019-09-10 02:07:51,453 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [16], [18], [22], [24], [31], [34], [36], [42], [43], [44], [46] [2019-09-10 02:07:51,484 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:07:51,485 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:07:51,620 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:07:51,624 INFO L272 AbstractInterpreter]: Visited 14 different actions 73 times. Merged at 5 different actions 32 times. Widened at 1 different actions 5 times. Performed 197 root evaluator evaluations with a maximum evaluation depth of 4. Performed 197 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 10 fixpoints after 3 different actions. Largest state had 5 variables. [2019-09-10 02:07:51,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:51,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:07:51,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:51,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:51,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:51,646 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:07:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:51,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-10 02:07:51,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:51,713 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 02:07:51,713 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 02:07:51,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:51,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-10 02:07:51,750 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:51,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:07:51,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:07:51,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:07:51,751 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 4 states. [2019-09-10 02:07:51,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:51,771 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-09-10 02:07:51,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:07:51,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-09-10 02:07:51,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:51,773 INFO L225 Difference]: With dead ends: 23 [2019-09-10 02:07:51,773 INFO L226 Difference]: Without dead ends: 23 [2019-09-10 02:07:51,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:07:51,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-10 02:07:51,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-09-10 02:07:51,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-10 02:07:51,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-09-10 02:07:51,778 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 18 [2019-09-10 02:07:51,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:51,779 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-09-10 02:07:51,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:07:51,779 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-09-10 02:07:51,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-10 02:07:51,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:51,780 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:51,780 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:51,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:51,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1550672957, now seen corresponding path program 2 times [2019-09-10 02:07:51,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:51,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:51,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:51,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:51,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:51,871 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 02:07:51,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:51,872 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:51,872 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:51,872 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:07:51,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:51,872 INFO 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:07:51,888 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:07:51,889 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:07:51,911 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-10 02:07:51,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:51,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 02:07:51,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:51,935 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:51,935 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:51,993 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:51,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:51,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2019-09-10 02:07:51,997 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:51,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:07:51,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:07:51,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:07:51,999 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 6 states. [2019-09-10 02:07:52,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:52,034 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2019-09-10 02:07:52,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:07:52,036 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-09-10 02:07:52,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:52,037 INFO L225 Difference]: With dead ends: 29 [2019-09-10 02:07:52,037 INFO L226 Difference]: Without dead ends: 29 [2019-09-10 02:07:52,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:07:52,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-10 02:07:52,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-09-10 02:07:52,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-10 02:07:52,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-09-10 02:07:52,043 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 21 [2019-09-10 02:07:52,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:52,043 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-09-10 02:07:52,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:07:52,043 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-09-10 02:07:52,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-10 02:07:52,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:52,045 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:52,045 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:52,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:52,045 INFO L82 PathProgramCache]: Analyzing trace with hash -755753187, now seen corresponding path program 3 times [2019-09-10 02:07:52,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:52,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:52,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:52,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:52,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:52,117 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 02:07:52,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:52,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:52,118 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:52,118 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:07:52,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:52,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:52,151 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:07:52,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:07:52,167 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:07:52,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:52,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 02:07:52,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:52,178 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 02:07:52,178 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:52,263 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:07:52,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:52,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2019-09-10 02:07:52,268 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:52,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:07:52,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:07:52,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:07:52,270 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 7 states. [2019-09-10 02:07:52,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:52,303 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-09-10 02:07:52,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:07:52,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-09-10 02:07:52,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:52,305 INFO L225 Difference]: With dead ends: 32 [2019-09-10 02:07:52,305 INFO L226 Difference]: Without dead ends: 32 [2019-09-10 02:07:52,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:07:52,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-10 02:07:52,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-10 02:07:52,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-10 02:07:52,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-09-10 02:07:52,310 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2019-09-10 02:07:52,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:52,310 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-09-10 02:07:52,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:07:52,310 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-09-10 02:07:52,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-10 02:07:52,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:52,311 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:52,312 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:52,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:52,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1097923174, now seen corresponding path program 4 times [2019-09-10 02:07:52,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:52,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:52,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:52,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:52,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:52,387 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 22 proven. 40 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 02:07:52,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:52,387 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:52,387 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:52,388 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:07:52,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:52,388 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:07:52,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:52,410 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:52,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 02:07:52,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:52,436 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 22 proven. 40 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 02:07:52,436 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:52,530 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 22 proven. 40 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 02:07:52,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:52,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2019-09-10 02:07:52,534 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:52,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:07:52,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:07:52,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-10 02:07:52,535 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 8 states. [2019-09-10 02:07:52,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:52,571 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-09-10 02:07:52,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:07:52,572 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-09-10 02:07:52,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:52,573 INFO L225 Difference]: With dead ends: 35 [2019-09-10 02:07:52,573 INFO L226 Difference]: Without dead ends: 35 [2019-09-10 02:07:52,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-10 02:07:52,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-10 02:07:52,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-09-10 02:07:52,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-10 02:07:52,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-09-10 02:07:52,580 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 30 [2019-09-10 02:07:52,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:52,581 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-09-10 02:07:52,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:07:52,582 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-09-10 02:07:52,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-10 02:07:52,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:52,583 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:52,584 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:52,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:52,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1568354813, now seen corresponding path program 5 times [2019-09-10 02:07:52,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:52,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:52,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:52,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:52,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:52,681 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 26 proven. 57 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 02:07:52,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:52,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:52,683 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:52,683 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:07:52,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:52,683 INFO 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:07:52,699 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:07:52,699 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:07:52,724 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-10 02:07:52,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:52,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 02:07:52,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:52,765 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 57 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-10 02:07:52,766 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:52,813 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 57 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-10 02:07:52,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:52,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2019-09-10 02:07:52,818 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:52,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:07:52,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:07:52,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:07:52,819 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 12 states. [2019-09-10 02:07:52,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:52,986 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-09-10 02:07:52,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:07:52,989 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-09-10 02:07:52,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:52,990 INFO L225 Difference]: With dead ends: 45 [2019-09-10 02:07:52,990 INFO L226 Difference]: Without dead ends: 45 [2019-09-10 02:07:52,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-09-10 02:07:52,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-10 02:07:52,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2019-09-10 02:07:52,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-10 02:07:53,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2019-09-10 02:07:53,001 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 33 [2019-09-10 02:07:53,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:53,004 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-09-10 02:07:53,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:07:53,004 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2019-09-10 02:07:53,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-10 02:07:53,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:53,006 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:53,009 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:53,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:53,009 INFO L82 PathProgramCache]: Analyzing trace with hash 801367963, now seen corresponding path program 6 times [2019-09-10 02:07:53,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:53,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:53,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:53,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:53,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:53,139 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 53 proven. 77 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 02:07:53,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:53,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:53,140 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:53,140 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:07:53,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:53,140 INFO 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:07:53,157 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:07:53,157 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:07:53,175 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:07:53,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:53,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-10 02:07:53,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:53,198 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 53 proven. 77 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 02:07:53,198 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:53,341 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 53 proven. 77 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 02:07:53,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:53,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2019-09-10 02:07:53,345 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:53,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:07:53,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:07:53,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:07:53,346 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 10 states. [2019-09-10 02:07:53,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:53,387 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-09-10 02:07:53,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:07:53,388 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2019-09-10 02:07:53,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:53,389 INFO L225 Difference]: With dead ends: 44 [2019-09-10 02:07:53,389 INFO L226 Difference]: Without dead ends: 44 [2019-09-10 02:07:53,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:07:53,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-10 02:07:53,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-09-10 02:07:53,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-10 02:07:53,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-09-10 02:07:53,393 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 39 [2019-09-10 02:07:53,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:53,394 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-09-10 02:07:53,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:07:53,394 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-09-10 02:07:53,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-10 02:07:53,395 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:53,395 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:53,395 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:53,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:53,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1305478504, now seen corresponding path program 7 times [2019-09-10 02:07:53,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:53,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:53,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:53,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:53,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:53,501 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 60 proven. 100 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 02:07:53,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:53,502 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:53,502 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:53,502 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:07:53,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:53,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:07:53,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:53,520 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:53,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 02:07:53,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:53,551 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 60 proven. 100 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 02:07:53,552 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:53,714 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 60 proven. 100 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 02:07:53,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:53,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2019-09-10 02:07:53,719 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:53,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:07:53,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:07:53,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-10 02:07:53,724 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 11 states. [2019-09-10 02:07:53,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:53,761 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-09-10 02:07:53,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:07:53,762 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2019-09-10 02:07:53,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:53,763 INFO L225 Difference]: With dead ends: 47 [2019-09-10 02:07:53,763 INFO L226 Difference]: Without dead ends: 47 [2019-09-10 02:07:53,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-10 02:07:53,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-10 02:07:53,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-09-10 02:07:53,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-10 02:07:53,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2019-09-10 02:07:53,768 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 42 [2019-09-10 02:07:53,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:53,768 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2019-09-10 02:07:53,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:07:53,768 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2019-09-10 02:07:53,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-10 02:07:53,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:53,770 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:53,770 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:53,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:53,770 INFO L82 PathProgramCache]: Analyzing trace with hash 283486843, now seen corresponding path program 8 times [2019-09-10 02:07:53,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:53,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:53,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:53,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:53,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:53,863 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 67 proven. 126 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 02:07:53,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:53,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:53,864 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:53,864 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:07:53,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:53,864 INFO 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:07:53,881 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:07:53,882 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:07:53,902 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-10 02:07:53,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:53,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 02:07:53,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:53,970 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 130 proven. 17 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-10 02:07:53,971 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:54,052 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 130 proven. 17 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-10 02:07:54,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:54,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 16 [2019-09-10 02:07:54,057 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:54,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 02:07:54,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 02:07:54,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:07:54,060 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 16 states. [2019-09-10 02:07:54,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:54,276 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2019-09-10 02:07:54,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 02:07:54,277 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2019-09-10 02:07:54,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:54,278 INFO L225 Difference]: With dead ends: 60 [2019-09-10 02:07:54,278 INFO L226 Difference]: Without dead ends: 60 [2019-09-10 02:07:54,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 81 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2019-09-10 02:07:54,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-10 02:07:54,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2019-09-10 02:07:54,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-10 02:07:54,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-09-10 02:07:54,291 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 45 [2019-09-10 02:07:54,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:54,291 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-09-10 02:07:54,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 02:07:54,291 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-09-10 02:07:54,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-10 02:07:54,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:54,292 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:54,293 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:54,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:54,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1264097757, now seen corresponding path program 9 times [2019-09-10 02:07:54,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:54,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:54,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:54,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:54,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:54,442 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 106 proven. 155 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 02:07:54,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:54,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:54,442 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:54,442 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:07:54,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:54,443 INFO 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:07:54,459 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:07:54,459 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:07:54,481 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:07:54,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:54,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 02:07:54,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:54,493 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 106 proven. 155 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 02:07:54,494 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:54,719 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 106 proven. 155 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 02:07:54,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:54,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2019-09-10 02:07:54,723 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:54,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 02:07:54,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 02:07:54,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-10 02:07:54,726 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 13 states. [2019-09-10 02:07:54,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:54,769 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2019-09-10 02:07:54,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 02:07:54,769 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2019-09-10 02:07:54,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:54,770 INFO L225 Difference]: With dead ends: 56 [2019-09-10 02:07:54,770 INFO L226 Difference]: Without dead ends: 56 [2019-09-10 02:07:54,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-10 02:07:54,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-10 02:07:54,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-09-10 02:07:54,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-10 02:07:54,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-09-10 02:07:54,775 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 51 [2019-09-10 02:07:54,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:54,775 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-09-10 02:07:54,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 02:07:54,775 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-09-10 02:07:54,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 02:07:54,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:54,776 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:54,777 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:54,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:54,777 INFO L82 PathProgramCache]: Analyzing trace with hash 2042042714, now seen corresponding path program 10 times [2019-09-10 02:07:54,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:54,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:54,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:54,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:54,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:54,881 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 116 proven. 187 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 02:07:54,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:54,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:54,882 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:54,882 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:07:54,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:54,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:07:54,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:54,933 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:07:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:54,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 02:07:54,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:54,971 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 116 proven. 187 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 02:07:54,971 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:55,216 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 116 proven. 187 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 02:07:55,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:55,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2019-09-10 02:07:55,220 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:55,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 02:07:55,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 02:07:55,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-10 02:07:55,222 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 14 states. [2019-09-10 02:07:55,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:55,268 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-09-10 02:07:55,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:07:55,268 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-09-10 02:07:55,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:55,269 INFO L225 Difference]: With dead ends: 59 [2019-09-10 02:07:55,269 INFO L226 Difference]: Without dead ends: 59 [2019-09-10 02:07:55,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-10 02:07:55,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-10 02:07:55,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-09-10 02:07:55,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-10 02:07:55,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-09-10 02:07:55,274 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 54 [2019-09-10 02:07:55,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:55,274 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-09-10 02:07:55,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 02:07:55,274 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-09-10 02:07:55,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 02:07:55,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:55,276 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:55,276 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:55,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:55,276 INFO L82 PathProgramCache]: Analyzing trace with hash -2138239811, now seen corresponding path program 11 times [2019-09-10 02:07:55,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:55,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:55,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:55,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:55,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:55,386 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 126 proven. 222 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 02:07:55,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:55,386 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:55,387 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:55,387 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:07:55,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:55,387 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:55,402 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:07:55,402 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:07:55,425 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-10 02:07:55,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:55,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 02:07:55,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:55,499 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 233 proven. 34 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-10 02:07:55,499 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:55,581 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 233 proven. 34 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-10 02:07:55,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:55,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7, 7] total 20 [2019-09-10 02:07:55,586 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:55,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 02:07:55,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 02:07:55,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2019-09-10 02:07:55,588 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 20 states. [2019-09-10 02:07:55,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:55,883 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2019-09-10 02:07:55,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 02:07:55,884 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 57 [2019-09-10 02:07:55,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:55,885 INFO L225 Difference]: With dead ends: 75 [2019-09-10 02:07:55,885 INFO L226 Difference]: Without dead ends: 75 [2019-09-10 02:07:55,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 102 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=417, Invalid=915, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 02:07:55,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-10 02:07:55,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2019-09-10 02:07:55,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-10 02:07:55,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2019-09-10 02:07:55,890 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 57 [2019-09-10 02:07:55,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:55,891 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2019-09-10 02:07:55,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 02:07:55,891 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2019-09-10 02:07:55,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 02:07:55,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:55,892 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 13, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:55,892 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:55,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:55,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1471912923, now seen corresponding path program 12 times [2019-09-10 02:07:55,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:55,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:55,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:55,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:55,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:56,028 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 177 proven. 260 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 02:07:56,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:56,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:56,029 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:56,029 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:07:56,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:56,029 INFO 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:07:56,043 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:07:56,044 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:07:56,080 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:07:56,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:56,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-10 02:07:56,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:56,093 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 177 proven. 260 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 02:07:56,094 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 177 proven. 260 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 02:07:56,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:56,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2019-09-10 02:07:56,363 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:56,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 02:07:56,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 02:07:56,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-10 02:07:56,365 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 16 states. [2019-09-10 02:07:56,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:56,426 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2019-09-10 02:07:56,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 02:07:56,426 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 63 [2019-09-10 02:07:56,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:56,427 INFO L225 Difference]: With dead ends: 68 [2019-09-10 02:07:56,427 INFO L226 Difference]: Without dead ends: 68 [2019-09-10 02:07:56,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-10 02:07:56,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-10 02:07:56,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-09-10 02:07:56,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-10 02:07:56,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2019-09-10 02:07:56,432 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 63 [2019-09-10 02:07:56,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:56,432 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2019-09-10 02:07:56,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 02:07:56,433 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2019-09-10 02:07:56,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 02:07:56,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:56,433 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 14, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:56,434 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:56,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:56,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1598932952, now seen corresponding path program 13 times [2019-09-10 02:07:56,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:56,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:56,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:56,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:56,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:56,579 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 190 proven. 301 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 02:07:56,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:56,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:56,579 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:56,579 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:07:56,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:56,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:07:56,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:56,592 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:07:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:56,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 02:07:56,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:56,641 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 190 proven. 301 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 02:07:56,642 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:56,939 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 190 proven. 301 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 02:07:56,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:56,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2019-09-10 02:07:56,942 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:56,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 02:07:56,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 02:07:56,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-10 02:07:56,944 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 17 states. [2019-09-10 02:07:56,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:56,995 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2019-09-10 02:07:56,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 02:07:56,996 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-09-10 02:07:56,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:56,997 INFO L225 Difference]: With dead ends: 71 [2019-09-10 02:07:56,997 INFO L226 Difference]: Without dead ends: 71 [2019-09-10 02:07:56,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-10 02:07:56,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-10 02:07:57,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-09-10 02:07:57,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-10 02:07:57,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2019-09-10 02:07:57,001 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 66 [2019-09-10 02:07:57,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:57,002 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2019-09-10 02:07:57,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 02:07:57,002 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2019-09-10 02:07:57,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 02:07:57,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:57,003 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 15, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:57,003 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:57,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:57,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1786429115, now seen corresponding path program 14 times [2019-09-10 02:07:57,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:57,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:57,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:57,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:57,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:57,169 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 203 proven. 345 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 02:07:57,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:57,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:57,170 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:57,170 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:07:57,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:57,170 INFO 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:07:57,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:07:57,192 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:07:57,217 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-10 02:07:57,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:57,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 02:07:57,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:57,306 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 366 proven. 57 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-09-10 02:07:57,306 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:57,428 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 366 proven. 57 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-09-10 02:07:57,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:57,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 8] total 24 [2019-09-10 02:07:57,431 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:57,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 02:07:57,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 02:07:57,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-09-10 02:07:57,433 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 24 states. [2019-09-10 02:07:57,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:57,764 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2019-09-10 02:07:57,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 02:07:57,764 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 69 [2019-09-10 02:07:57,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:57,765 INFO L225 Difference]: With dead ends: 90 [2019-09-10 02:07:57,765 INFO L226 Difference]: Without dead ends: 90 [2019-09-10 02:07:57,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 123 SyntacticMatches, 10 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=604, Invalid=1376, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 02:07:57,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-10 02:07:57,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 76. [2019-09-10 02:07:57,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-10 02:07:57,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2019-09-10 02:07:57,772 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 69 [2019-09-10 02:07:57,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:57,773 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2019-09-10 02:07:57,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 02:07:57,773 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2019-09-10 02:07:57,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 02:07:57,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:57,778 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 16, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:57,779 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:57,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:57,779 INFO L82 PathProgramCache]: Analyzing trace with hash 679355549, now seen corresponding path program 15 times [2019-09-10 02:07:57,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:57,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:57,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:57,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:57,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:57,965 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 266 proven. 392 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-10 02:07:57,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:57,966 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:57,966 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:57,966 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:07:57,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:57,966 INFO 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) [2019-09-10 02:07:57,985 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:07:57,986 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:58,017 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:07:58,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:58,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 02:07:58,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:58,034 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 266 proven. 392 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-10 02:07:58,034 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:58,613 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 266 proven. 392 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-10 02:07:58,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:58,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2019-09-10 02:07:58,617 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:58,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 02:07:58,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 02:07:58,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 02:07:58,621 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 19 states. [2019-09-10 02:07:58,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:58,671 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2019-09-10 02:07:58,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 02:07:58,671 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2019-09-10 02:07:58,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:58,672 INFO L225 Difference]: With dead ends: 80 [2019-09-10 02:07:58,672 INFO L226 Difference]: Without dead ends: 80 [2019-09-10 02:07:58,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 02:07:58,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-10 02:07:58,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-09-10 02:07:58,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-10 02:07:58,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2019-09-10 02:07:58,682 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 75 [2019-09-10 02:07:58,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:58,683 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2019-09-10 02:07:58,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 02:07:58,683 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2019-09-10 02:07:58,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 02:07:58,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:58,684 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 17, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:58,684 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:58,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:58,686 INFO L82 PathProgramCache]: Analyzing trace with hash 514145562, now seen corresponding path program 16 times [2019-09-10 02:07:58,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:58,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:58,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:58,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:58,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:58,886 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 282 proven. 442 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-10 02:07:58,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:58,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:58,887 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:58,887 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:07:58,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:58,887 INFO 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:07:58,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:58,899 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:07:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:58,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 02:07:58,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:58,936 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 282 proven. 442 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-10 02:07:58,936 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:59,472 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 282 proven. 442 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-10 02:07:59,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:59,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 38 [2019-09-10 02:07:59,475 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:59,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 02:07:59,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 02:07:59,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 02:07:59,477 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 20 states. [2019-09-10 02:07:59,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:59,530 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2019-09-10 02:07:59,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 02:07:59,530 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 78 [2019-09-10 02:07:59,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:59,531 INFO L225 Difference]: With dead ends: 83 [2019-09-10 02:07:59,531 INFO L226 Difference]: Without dead ends: 83 [2019-09-10 02:07:59,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 02:07:59,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-10 02:07:59,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-09-10 02:07:59,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-10 02:07:59,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2019-09-10 02:07:59,536 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 78 [2019-09-10 02:07:59,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:59,536 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2019-09-10 02:07:59,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 02:07:59,537 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2019-09-10 02:07:59,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 02:07:59,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:59,538 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 18, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:59,538 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:59,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:59,538 INFO L82 PathProgramCache]: Analyzing trace with hash 775944061, now seen corresponding path program 17 times [2019-09-10 02:07:59,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:59,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:59,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:59,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:59,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:59,753 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 298 proven. 495 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-10 02:07:59,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:59,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:59,754 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:59,754 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:07:59,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:59,754 INFO 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:07:59,775 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:07:59,775 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:07:59,827 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-10 02:07:59,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:59,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 02:07:59,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:00,028 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 529 proven. 86 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-09-10 02:08:00,029 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:00,195 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 529 proven. 86 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:08:00,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:00,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 9, 9] total 28 [2019-09-10 02:08:00,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:00,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 02:08:00,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 02:08:00,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=511, Unknown=0, NotChecked=0, Total=756 [2019-09-10 02:08:00,201 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 28 states. [2019-09-10 02:08:00,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:00,567 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2019-09-10 02:08:00,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 02:08:00,572 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 81 [2019-09-10 02:08:00,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:00,572 INFO L225 Difference]: With dead ends: 105 [2019-09-10 02:08:00,573 INFO L226 Difference]: Without dead ends: 105 [2019-09-10 02:08:00,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 144 SyntacticMatches, 12 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=825, Invalid=1931, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 02:08:00,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-10 02:08:00,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2019-09-10 02:08:00,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-10 02:08:00,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2019-09-10 02:08:00,576 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 81 [2019-09-10 02:08:00,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:00,577 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2019-09-10 02:08:00,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 02:08:00,577 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2019-09-10 02:08:00,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 02:08:00,578 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:00,578 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 19, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:00,578 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:00,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:00,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1028866075, now seen corresponding path program 18 times [2019-09-10 02:08:00,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:00,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:00,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:00,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:00,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:00,783 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 373 proven. 551 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-10 02:08:00,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:00,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:00,784 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:00,784 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:00,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:00,784 INFO 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:08:00,795 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:00,795 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:08:00,828 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:00,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:00,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 02:08:00,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:00,844 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 373 proven. 551 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-10 02:08:00,844 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:01,315 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 373 proven. 551 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-10 02:08:01,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:01,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2019-09-10 02:08:01,319 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:01,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 02:08:01,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 02:08:01,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 02:08:01,322 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 22 states. [2019-09-10 02:08:01,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:01,406 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2019-09-10 02:08:01,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 02:08:01,408 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 87 [2019-09-10 02:08:01,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:01,409 INFO L225 Difference]: With dead ends: 92 [2019-09-10 02:08:01,409 INFO L226 Difference]: Without dead ends: 92 [2019-09-10 02:08:01,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 02:08:01,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-10 02:08:01,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-09-10 02:08:01,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-10 02:08:01,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2019-09-10 02:08:01,415 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 87 [2019-09-10 02:08:01,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:01,415 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2019-09-10 02:08:01,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 02:08:01,416 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2019-09-10 02:08:01,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 02:08:01,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:01,416 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 20, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:01,417 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:01,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:01,417 INFO L82 PathProgramCache]: Analyzing trace with hash -275741416, now seen corresponding path program 19 times [2019-09-10 02:08:01,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:01,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:01,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:01,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:01,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:01,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:01,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 392 proven. 610 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-10 02:08:01,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:01,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:01,630 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:01,630 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:01,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:01,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:08:01,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:01,645 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:08:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:01,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 02:08:01,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:01,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 392 proven. 610 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-10 02:08:01,689 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:02,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 392 proven. 610 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-10 02:08:02,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:02,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2019-09-10 02:08:02,203 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:02,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 02:08:02,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 02:08:02,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 02:08:02,204 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 23 states. [2019-09-10 02:08:02,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:02,285 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2019-09-10 02:08:02,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 02:08:02,286 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 90 [2019-09-10 02:08:02,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:02,287 INFO L225 Difference]: With dead ends: 95 [2019-09-10 02:08:02,287 INFO L226 Difference]: Without dead ends: 95 [2019-09-10 02:08:02,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 02:08:02,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-10 02:08:02,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-09-10 02:08:02,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-09-10 02:08:02,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2019-09-10 02:08:02,291 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 90 [2019-09-10 02:08:02,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:02,291 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2019-09-10 02:08:02,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 02:08:02,291 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2019-09-10 02:08:02,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 02:08:02,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:02,292 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 21, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:02,293 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:02,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:02,293 INFO L82 PathProgramCache]: Analyzing trace with hash -678444293, now seen corresponding path program 20 times [2019-09-10 02:08:02,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:02,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:02,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:02,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:02,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:02,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 411 proven. 672 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-10 02:08:02,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:02,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:02,577 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:02,577 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:02,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:02,577 INFO 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:08:02,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:08:02,612 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:08:02,659 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-10 02:08:02,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:02,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 02:08:02,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:02,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 722 proven. 121 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2019-09-10 02:08:02,807 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:03,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 722 proven. 121 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2019-09-10 02:08:03,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:03,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 10, 10] total 32 [2019-09-10 02:08:03,031 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:03,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 02:08:03,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 02:08:03,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=672, Unknown=0, NotChecked=0, Total=992 [2019-09-10 02:08:03,033 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand 32 states. [2019-09-10 02:08:03,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:03,488 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2019-09-10 02:08:03,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-10 02:08:03,489 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 93 [2019-09-10 02:08:03,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:03,489 INFO L225 Difference]: With dead ends: 120 [2019-09-10 02:08:03,490 INFO L226 Difference]: Without dead ends: 120 [2019-09-10 02:08:03,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 165 SyntacticMatches, 14 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1080, Invalid=2580, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 02:08:03,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-10 02:08:03,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 100. [2019-09-10 02:08:03,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-10 02:08:03,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-09-10 02:08:03,495 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 93 [2019-09-10 02:08:03,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:03,495 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-09-10 02:08:03,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 02:08:03,495 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-09-10 02:08:03,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 02:08:03,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:03,496 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 22, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:03,496 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:03,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:03,497 INFO L82 PathProgramCache]: Analyzing trace with hash 2063122269, now seen corresponding path program 21 times [2019-09-10 02:08:03,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:03,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:03,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:03,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:03,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:03,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 498 proven. 737 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-10 02:08:03,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:03,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:03,749 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:03,749 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:03,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:03,749 INFO 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) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:03,759 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:03,759 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:08:03,788 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:03,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:03,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 02:08:03,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:03,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 498 proven. 737 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-10 02:08:03,807 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:04,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 498 proven. 737 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-10 02:08:04,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:04,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2019-09-10 02:08:04,422 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:04,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 02:08:04,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 02:08:04,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 02:08:04,424 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 25 states. [2019-09-10 02:08:04,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:04,507 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-09-10 02:08:04,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 02:08:04,508 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2019-09-10 02:08:04,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:04,509 INFO L225 Difference]: With dead ends: 104 [2019-09-10 02:08:04,509 INFO L226 Difference]: Without dead ends: 104 [2019-09-10 02:08:04,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 02:08:04,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-10 02:08:04,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-09-10 02:08:04,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-10 02:08:04,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-09-10 02:08:04,513 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 99 [2019-09-10 02:08:04,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:04,514 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-09-10 02:08:04,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 02:08:04,514 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-09-10 02:08:04,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 02:08:04,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:04,515 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 23, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:04,515 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:04,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:04,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1055748314, now seen corresponding path program 22 times [2019-09-10 02:08:04,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:04,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:04,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:04,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:04,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:04,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 520 proven. 805 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-10 02:08:04,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:04,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:04,786 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:04,786 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:04,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:04,786 INFO 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) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:04,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:04,799 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:08:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:04,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 02:08:04,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:04,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 520 proven. 805 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-10 02:08:04,854 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:05,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 520 proven. 805 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-10 02:08:05,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:05,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 50 [2019-09-10 02:08:05,505 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:05,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 02:08:05,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 02:08:05,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 02:08:05,507 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 26 states. [2019-09-10 02:08:05,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:05,591 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2019-09-10 02:08:05,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 02:08:05,592 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 102 [2019-09-10 02:08:05,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:05,593 INFO L225 Difference]: With dead ends: 107 [2019-09-10 02:08:05,593 INFO L226 Difference]: Without dead ends: 107 [2019-09-10 02:08:05,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 02:08:05,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-10 02:08:05,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-09-10 02:08:05,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-09-10 02:08:05,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2019-09-10 02:08:05,597 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 102 [2019-09-10 02:08:05,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:05,598 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2019-09-10 02:08:05,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 02:08:05,598 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2019-09-10 02:08:05,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 02:08:05,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:05,599 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 24, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:05,599 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:05,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:05,599 INFO L82 PathProgramCache]: Analyzing trace with hash -685247939, now seen corresponding path program 23 times [2019-09-10 02:08:05,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:05,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:05,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:05,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:05,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:05,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 542 proven. 876 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-10 02:08:05,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:05,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:05,899 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:05,899 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:05,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:05,899 INFO 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:08:05,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:08:05,910 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:08:05,952 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-10 02:08:05,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:05,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 02:08:05,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:06,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 945 proven. 162 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2019-09-10 02:08:06,105 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:06,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 945 proven. 162 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2019-09-10 02:08:06,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:06,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 11, 11] total 36 [2019-09-10 02:08:06,319 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:06,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 02:08:06,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 02:08:06,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=405, Invalid=855, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 02:08:06,321 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand 36 states. [2019-09-10 02:08:06,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:06,871 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2019-09-10 02:08:06,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-10 02:08:06,872 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 105 [2019-09-10 02:08:06,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:06,873 INFO L225 Difference]: With dead ends: 135 [2019-09-10 02:08:06,873 INFO L226 Difference]: Without dead ends: 135 [2019-09-10 02:08:06,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 186 SyntacticMatches, 16 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1233 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1369, Invalid=3323, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 02:08:06,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-09-10 02:08:06,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 112. [2019-09-10 02:08:06,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-10 02:08:06,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2019-09-10 02:08:06,877 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 105 [2019-09-10 02:08:06,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:06,878 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2019-09-10 02:08:06,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-10 02:08:06,878 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2019-09-10 02:08:06,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 02:08:06,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:06,879 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 25, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:06,879 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:06,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:06,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1450628187, now seen corresponding path program 24 times [2019-09-10 02:08:06,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:06,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:06,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:06,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:06,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:07,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 641 proven. 950 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-10 02:08:07,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:07,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:07,180 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:07,180 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:07,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:07,180 INFO 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:08:07,192 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:07,193 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:08:07,224 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:07,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:07,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-10 02:08:07,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:07,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 641 proven. 950 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-10 02:08:07,244 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:08,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 641 proven. 950 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-10 02:08:08,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:08,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 52 [2019-09-10 02:08:08,011 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:08,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 02:08:08,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 02:08:08,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:08,013 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 28 states. [2019-09-10 02:08:08,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:08,103 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2019-09-10 02:08:08,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 02:08:08,104 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 111 [2019-09-10 02:08:08,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:08,105 INFO L225 Difference]: With dead ends: 116 [2019-09-10 02:08:08,105 INFO L226 Difference]: Without dead ends: 116 [2019-09-10 02:08:08,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 197 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:08,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-10 02:08:08,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-09-10 02:08:08,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-10 02:08:08,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2019-09-10 02:08:08,113 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 111 [2019-09-10 02:08:08,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:08,113 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2019-09-10 02:08:08,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 02:08:08,113 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2019-09-10 02:08:08,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 02:08:08,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:08,114 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 26, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:08,114 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:08,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:08,115 INFO L82 PathProgramCache]: Analyzing trace with hash -639356328, now seen corresponding path program 25 times [2019-09-10 02:08:08,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:08,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:08,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:08,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:08,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:08,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:08,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 666 proven. 1027 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-10 02:08:08,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:08,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:08,541 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:08,541 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:08,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:08,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:08:08,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:08,551 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:08:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:08,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 02:08:08,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:08,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 666 proven. 1027 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-10 02:08:08,605 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:09,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 666 proven. 1027 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-10 02:08:09,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:09,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 52 [2019-09-10 02:08:09,479 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:09,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-10 02:08:09,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-10 02:08:09,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:09,481 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 29 states. [2019-09-10 02:08:09,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:09,547 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2019-09-10 02:08:09,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 02:08:09,547 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 114 [2019-09-10 02:08:09,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:09,548 INFO L225 Difference]: With dead ends: 119 [2019-09-10 02:08:09,548 INFO L226 Difference]: Without dead ends: 119 [2019-09-10 02:08:09,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 202 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:09,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-09-10 02:08:09,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-09-10 02:08:09,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-10 02:08:09,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2019-09-10 02:08:09,554 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 114 [2019-09-10 02:08:09,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:09,554 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2019-09-10 02:08:09,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-10 02:08:09,554 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2019-09-10 02:08:09,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 02:08:09,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:09,555 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 27, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:09,555 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:09,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:09,556 INFO L82 PathProgramCache]: Analyzing trace with hash 772847419, now seen corresponding path program 26 times [2019-09-10 02:08:09,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:09,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:09,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:09,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:09,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:09,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 691 proven. 1107 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-10 02:08:09,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:09,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:09,950 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:09,950 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:09,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:09,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:08:09,963 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:08:09,963 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:08:10,009 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-09-10 02:08:10,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:10,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 02:08:10,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:10,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 1198 proven. 209 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2019-09-10 02:08:10,201 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:10,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 1198 proven. 209 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2019-09-10 02:08:10,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:10,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 12, 12] total 40 [2019-09-10 02:08:10,485 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:10,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-10 02:08:10,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-10 02:08:10,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=1060, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 02:08:10,487 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 40 states. [2019-09-10 02:08:11,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:11,168 INFO L93 Difference]: Finished difference Result 150 states and 168 transitions. [2019-09-10 02:08:11,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-10 02:08:11,169 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 117 [2019-09-10 02:08:11,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:11,170 INFO L225 Difference]: With dead ends: 150 [2019-09-10 02:08:11,170 INFO L226 Difference]: Without dead ends: 150 [2019-09-10 02:08:11,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 207 SyntacticMatches, 18 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1558 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1692, Invalid=4160, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 02:08:11,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-10 02:08:11,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 124. [2019-09-10 02:08:11,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-10 02:08:11,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2019-09-10 02:08:11,175 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 117 [2019-09-10 02:08:11,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:11,176 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2019-09-10 02:08:11,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-10 02:08:11,176 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2019-09-10 02:08:11,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 02:08:11,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:11,177 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 28, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:11,177 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:11,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:11,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1269011939, now seen corresponding path program 27 times [2019-09-10 02:08:11,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:11,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:11,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:11,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:11,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:11,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 802 proven. 1190 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-10 02:08:11,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:11,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:11,534 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:11,534 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:11,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:11,534 INFO 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:11,546 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:11,546 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:08:11,585 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:11,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:11,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 02:08:11,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:11,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 802 proven. 1190 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-10 02:08:11,606 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:12,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 802 proven. 1190 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-10 02:08:12,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:12,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 52 [2019-09-10 02:08:12,399 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:12,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 02:08:12,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 02:08:12,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:12,400 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 31 states. [2019-09-10 02:08:12,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:12,496 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2019-09-10 02:08:12,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 02:08:12,497 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 123 [2019-09-10 02:08:12,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:12,498 INFO L225 Difference]: With dead ends: 128 [2019-09-10 02:08:12,498 INFO L226 Difference]: Without dead ends: 128 [2019-09-10 02:08:12,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 218 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:12,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-10 02:08:12,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-09-10 02:08:12,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-09-10 02:08:12,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2019-09-10 02:08:12,503 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 123 [2019-09-10 02:08:12,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:12,504 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2019-09-10 02:08:12,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 02:08:12,504 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2019-09-10 02:08:12,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 02:08:12,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:12,505 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 29, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:12,505 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:12,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:12,506 INFO L82 PathProgramCache]: Analyzing trace with hash -853298022, now seen corresponding path program 28 times [2019-09-10 02:08:12,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:12,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:12,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:12,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:12,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:12,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 830 proven. 1276 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-10 02:08:12,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:12,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:12,997 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:12,997 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:12,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:12,997 INFO 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) [2019-09-10 02:08:13,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:13,024 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:13,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-10 02:08:13,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:13,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 830 proven. 1276 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-10 02:08:13,111 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:13,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 830 proven. 1276 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-10 02:08:13,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:13,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 52 [2019-09-10 02:08:13,951 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:13,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 02:08:13,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 02:08:13,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:13,953 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand 32 states. [2019-09-10 02:08:14,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:14,064 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2019-09-10 02:08:14,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 02:08:14,064 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 126 [2019-09-10 02:08:14,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:14,065 INFO L225 Difference]: With dead ends: 131 [2019-09-10 02:08:14,066 INFO L226 Difference]: Without dead ends: 131 [2019-09-10 02:08:14,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 223 SyntacticMatches, 10 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:14,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-09-10 02:08:14,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-09-10 02:08:14,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-10 02:08:14,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2019-09-10 02:08:14,069 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 126 [2019-09-10 02:08:14,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:14,070 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2019-09-10 02:08:14,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 02:08:14,070 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2019-09-10 02:08:14,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 02:08:14,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:14,071 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 30, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:14,071 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:14,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:14,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1289288957, now seen corresponding path program 29 times [2019-09-10 02:08:14,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:14,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:14,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:14,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:14,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:14,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:14,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 858 proven. 1365 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-10 02:08:14,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:14,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:14,608 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:14,608 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:14,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:14,608 INFO 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:14,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:08:14,621 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:08:14,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-10 02:08:14,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:14,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 02:08:14,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:14,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 1481 proven. 262 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2019-09-10 02:08:14,868 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:15,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 1481 proven. 262 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2019-09-10 02:08:15,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:15,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 13, 13] total 44 [2019-09-10 02:08:15,230 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:15,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-10 02:08:15,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-10 02:08:15,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=605, Invalid=1287, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 02:08:15,232 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand 44 states. [2019-09-10 02:08:15,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:15,961 INFO L93 Difference]: Finished difference Result 165 states and 185 transitions. [2019-09-10 02:08:15,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-10 02:08:15,962 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 129 [2019-09-10 02:08:15,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:15,963 INFO L225 Difference]: With dead ends: 165 [2019-09-10 02:08:15,963 INFO L226 Difference]: Without dead ends: 165 [2019-09-10 02:08:15,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 228 SyntacticMatches, 20 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1921 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2049, Invalid=5091, Unknown=0, NotChecked=0, Total=7140 [2019-09-10 02:08:15,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-09-10 02:08:15,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 136. [2019-09-10 02:08:15,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-10 02:08:15,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2019-09-10 02:08:15,968 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 129 [2019-09-10 02:08:15,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:15,968 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2019-09-10 02:08:15,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-10 02:08:15,968 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2019-09-10 02:08:15,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 02:08:15,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:15,969 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 31, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:15,970 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:15,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:15,970 INFO L82 PathProgramCache]: Analyzing trace with hash 403855515, now seen corresponding path program 30 times [2019-09-10 02:08:15,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:15,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:15,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:15,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:15,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:16,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 981 proven. 1457 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-09-10 02:08:16,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:16,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:16,395 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:16,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:08:16,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:16,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 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:08:16,405 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:16,406 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:08:16,466 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:16,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:16,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-10 02:08:16,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:16,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 981 proven. 1457 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-09-10 02:08:16,497 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:17,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 981 proven. 1457 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-09-10 02:08:17,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:17,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 52 [2019-09-10 02:08:17,310 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:17,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-10 02:08:17,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-10 02:08:17,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:17,311 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 34 states. [2019-09-10 02:08:17,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:17,442 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2019-09-10 02:08:17,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 02:08:17,443 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 135 [2019-09-10 02:08:17,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:17,444 INFO L225 Difference]: With dead ends: 140 [2019-09-10 02:08:17,444 INFO L226 Difference]: Without dead ends: 140 [2019-09-10 02:08:17,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 239 SyntacticMatches, 14 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:17,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-10 02:08:17,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2019-09-10 02:08:17,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-10 02:08:17,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 150 transitions. [2019-09-10 02:08:17,448 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 150 transitions. Word has length 135 [2019-09-10 02:08:17,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:17,449 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 150 transitions. [2019-09-10 02:08:17,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-10 02:08:17,449 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 150 transitions. [2019-09-10 02:08:17,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 02:08:17,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:17,451 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 32, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:17,451 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:17,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:17,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1808478312, now seen corresponding path program 31 times [2019-09-10 02:08:17,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:17,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:17,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:17,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:17,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:17,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1012 proven. 1552 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-09-10 02:08:17,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:17,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:17,915 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:17,915 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:17,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:17,915 INFO 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:08:17,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:17,924 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:08:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:17,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-10 02:08:17,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:17,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1012 proven. 1552 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-09-10 02:08:17,995 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:18,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1012 proven. 1552 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-09-10 02:08:18,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:18,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 52 [2019-09-10 02:08:18,840 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:18,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-10 02:08:18,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-10 02:08:18,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:18,842 INFO L87 Difference]: Start difference. First operand 139 states and 150 transitions. Second operand 35 states. [2019-09-10 02:08:18,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:18,960 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2019-09-10 02:08:18,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 02:08:18,969 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 138 [2019-09-10 02:08:18,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:18,970 INFO L225 Difference]: With dead ends: 143 [2019-09-10 02:08:18,971 INFO L226 Difference]: Without dead ends: 143 [2019-09-10 02:08:18,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 244 SyntacticMatches, 16 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:18,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-09-10 02:08:18,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2019-09-10 02:08:18,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-09-10 02:08:18,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2019-09-10 02:08:18,975 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 138 [2019-09-10 02:08:18,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:18,975 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2019-09-10 02:08:18,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-10 02:08:18,975 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2019-09-10 02:08:18,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 02:08:18,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:18,976 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 33, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:18,976 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:18,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:18,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1122605947, now seen corresponding path program 32 times [2019-09-10 02:08:18,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:18,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:18,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:18,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:18,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:19,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1043 proven. 1650 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-09-10 02:08:19,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:19,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:19,466 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:19,466 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,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:19,467 INFO 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) [2019-09-10 02:08:19,479 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:08:19,479 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:19,536 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-09-10 02:08:19,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:19,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 02:08:19,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:19,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1794 proven. 321 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2019-09-10 02:08:19,822 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:20,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1794 proven. 321 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2019-09-10 02:08:20,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:20,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 14, 14] total 48 [2019-09-10 02:08:20,217 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:20,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-10 02:08:20,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-10 02:08:20,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=720, Invalid=1536, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 02:08:20,218 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 48 states. [2019-09-10 02:08:21,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:21,054 INFO L93 Difference]: Finished difference Result 180 states and 202 transitions. [2019-09-10 02:08:21,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-10 02:08:21,055 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 141 [2019-09-10 02:08:21,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:21,057 INFO L225 Difference]: With dead ends: 180 [2019-09-10 02:08:21,057 INFO L226 Difference]: Without dead ends: 180 [2019-09-10 02:08:21,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 249 SyntacticMatches, 22 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2322 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2440, Invalid=6116, Unknown=0, NotChecked=0, Total=8556 [2019-09-10 02:08:21,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-10 02:08:21,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 148. [2019-09-10 02:08:21,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-10 02:08:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2019-09-10 02:08:21,061 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 141 [2019-09-10 02:08:21,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:21,062 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2019-09-10 02:08:21,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-10 02:08:21,062 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2019-09-10 02:08:21,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 02:08:21,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:21,063 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 34, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:21,063 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:21,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:21,064 INFO L82 PathProgramCache]: Analyzing trace with hash -415423267, now seen corresponding path program 33 times [2019-09-10 02:08:21,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:21,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:21,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:21,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:21,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:21,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 1178 proven. 1751 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-09-10 02:08:21,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:21,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:21,587 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:21,587 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:21,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:21,587 INFO 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) [2019-09-10 02:08:21,607 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:21,607 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:21,652 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:21,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:21,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 02:08:21,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:21,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 1178 proven. 1751 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-09-10 02:08:21,682 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:22,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 1178 proven. 1751 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-09-10 02:08:22,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:22,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 52 [2019-09-10 02:08:22,475 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:22,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-10 02:08:22,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-10 02:08:22,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:22,476 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 37 states. [2019-09-10 02:08:22,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:22,584 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2019-09-10 02:08:22,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 02:08:22,584 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 147 [2019-09-10 02:08:22,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:22,586 INFO L225 Difference]: With dead ends: 152 [2019-09-10 02:08:22,586 INFO L226 Difference]: Without dead ends: 152 [2019-09-10 02:08:22,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 260 SyntacticMatches, 20 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:22,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-10 02:08:22,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2019-09-10 02:08:22,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-09-10 02:08:22,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 163 transitions. [2019-09-10 02:08:22,591 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 163 transitions. Word has length 147 [2019-09-10 02:08:22,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:22,591 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 163 transitions. [2019-09-10 02:08:22,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-10 02:08:22,591 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 163 transitions. [2019-09-10 02:08:22,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 02:08:22,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:22,592 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 35, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:22,593 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:22,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:22,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1557923930, now seen corresponding path program 34 times [2019-09-10 02:08:22,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:22,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:22,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:22,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:22,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:23,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 1212 proven. 1855 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-09-10 02:08:23,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:23,127 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:23,127 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:23,127 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:23,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:23,127 INFO 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:08:23,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:23,138 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:08:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:23,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-10 02:08:23,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:23,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 1212 proven. 1855 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-09-10 02:08:23,213 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:24,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 1212 proven. 1855 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-09-10 02:08:24,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:24,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 52 [2019-09-10 02:08:24,037 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:24,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-10 02:08:24,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-10 02:08:24,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:24,038 INFO L87 Difference]: Start difference. First operand 151 states and 163 transitions. Second operand 38 states. [2019-09-10 02:08:24,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:24,175 INFO L93 Difference]: Finished difference Result 155 states and 167 transitions. [2019-09-10 02:08:24,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-10 02:08:24,176 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 150 [2019-09-10 02:08:24,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:24,177 INFO L225 Difference]: With dead ends: 155 [2019-09-10 02:08:24,177 INFO L226 Difference]: Without dead ends: 155 [2019-09-10 02:08:24,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 265 SyntacticMatches, 22 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:24,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-10 02:08:24,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2019-09-10 02:08:24,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-10 02:08:24,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2019-09-10 02:08:24,180 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 150 [2019-09-10 02:08:24,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:24,180 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2019-09-10 02:08:24,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-10 02:08:24,181 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2019-09-10 02:08:24,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 02:08:24,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:24,182 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 36, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:24,182 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:24,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:24,182 INFO L82 PathProgramCache]: Analyzing trace with hash 31922109, now seen corresponding path program 35 times [2019-09-10 02:08:24,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:24,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:24,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:24,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:24,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:24,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 1246 proven. 1962 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-09-10 02:08:24,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:24,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:24,752 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:24,752 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:24,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:24,752 INFO 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:08:24,762 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:08:24,762 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:08:24,832 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-09-10 02:08:24,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:24,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-10 02:08:24,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:25,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 2137 proven. 386 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-09-10 02:08:25,113 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:25,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 2137 proven. 386 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-09-10 02:08:25,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:25,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 15, 15] total 52 [2019-09-10 02:08:25,582 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:25,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-10 02:08:25,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-10 02:08:25,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=845, Invalid=1807, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:25,583 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 52 states. [2019-09-10 02:08:26,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:26,551 INFO L93 Difference]: Finished difference Result 195 states and 219 transitions. [2019-09-10 02:08:26,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-10 02:08:26,560 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 153 [2019-09-10 02:08:26,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:26,561 INFO L225 Difference]: With dead ends: 195 [2019-09-10 02:08:26,562 INFO L226 Difference]: Without dead ends: 195 [2019-09-10 02:08:26,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 270 SyntacticMatches, 24 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2761 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2865, Invalid=7235, Unknown=0, NotChecked=0, Total=10100 [2019-09-10 02:08:26,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-10 02:08:26,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 160. [2019-09-10 02:08:26,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-10 02:08:26,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 173 transitions. [2019-09-10 02:08:26,567 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 173 transitions. Word has length 153 [2019-09-10 02:08:26,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:26,567 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 173 transitions. [2019-09-10 02:08:26,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-10 02:08:26,568 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 173 transitions. [2019-09-10 02:08:26,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 02:08:26,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:26,569 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 37, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:26,569 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:26,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:26,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1240347429, now seen corresponding path program 36 times [2019-09-10 02:08:26,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:26,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:26,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:26,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:26,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:27,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 1393 proven. 2072 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-10 02:08:27,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:27,357 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:27,357 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:27,357 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:27,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:27,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:08:27,377 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:27,377 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:27,424 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:27,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:27,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-10 02:08:27,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:27,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 1393 proven. 2072 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-10 02:08:27,459 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:28,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 1393 proven. 2072 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-10 02:08:28,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:28,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 52 [2019-09-10 02:08:28,671 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:28,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-10 02:08:28,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-10 02:08:28,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:28,672 INFO L87 Difference]: Start difference. First operand 160 states and 173 transitions. Second operand 40 states. [2019-09-10 02:08:28,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:28,817 INFO L93 Difference]: Finished difference Result 164 states and 177 transitions. [2019-09-10 02:08:28,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-10 02:08:28,817 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 159 [2019-09-10 02:08:28,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:28,818 INFO L225 Difference]: With dead ends: 164 [2019-09-10 02:08:28,818 INFO L226 Difference]: Without dead ends: 164 [2019-09-10 02:08:28,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 281 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:28,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-10 02:08:28,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2019-09-10 02:08:28,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-10 02:08:28,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 176 transitions. [2019-09-10 02:08:28,823 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 176 transitions. Word has length 159 [2019-09-10 02:08:28,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:28,823 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 176 transitions. [2019-09-10 02:08:28,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-10 02:08:28,823 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 176 transitions. [2019-09-10 02:08:28,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-10 02:08:28,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:28,824 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 38, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:28,825 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:28,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:28,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1399741656, now seen corresponding path program 37 times [2019-09-10 02:08:28,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:28,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:28,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:28,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:28,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:29,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 1430 proven. 2185 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-10 02:08:29,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:29,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:29,667 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:29,667 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:29,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:29,667 INFO 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:08:29,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:29,677 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:08:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:29,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-10 02:08:29,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:29,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 1430 proven. 2185 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-10 02:08:29,757 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:30,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 1430 proven. 2185 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-10 02:08:30,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:30,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 52 [2019-09-10 02:08:30,880 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:30,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-10 02:08:30,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-10 02:08:30,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:30,881 INFO L87 Difference]: Start difference. First operand 163 states and 176 transitions. Second operand 41 states. [2019-09-10 02:08:31,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:31,006 INFO L93 Difference]: Finished difference Result 167 states and 180 transitions. [2019-09-10 02:08:31,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 02:08:31,010 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 162 [2019-09-10 02:08:31,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:31,012 INFO L225 Difference]: With dead ends: 167 [2019-09-10 02:08:31,012 INFO L226 Difference]: Without dead ends: 167 [2019-09-10 02:08:31,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 286 SyntacticMatches, 28 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:31,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-09-10 02:08:31,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2019-09-10 02:08:31,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-09-10 02:08:31,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 179 transitions. [2019-09-10 02:08:31,016 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 179 transitions. Word has length 162 [2019-09-10 02:08:31,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:31,016 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 179 transitions. [2019-09-10 02:08:31,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-10 02:08:31,017 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2019-09-10 02:08:31,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-10 02:08:31,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:31,018 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 39, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:31,018 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:31,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:31,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1442418757, now seen corresponding path program 38 times [2019-09-10 02:08:31,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:31,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:31,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:31,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:31,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:31,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 1467 proven. 2301 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-10 02:08:31,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:31,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:31,713 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:31,713 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:31,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:31,714 INFO 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:08:31,724 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:08:31,724 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:08:31,794 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-09-10 02:08:31,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:31,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 02:08:31,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:32,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 2510 proven. 457 refuted. 0 times theorem prover too weak. 1011 trivial. 0 not checked. [2019-09-10 02:08:32,173 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:32,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 2510 proven. 457 refuted. 0 times theorem prover too weak. 1011 trivial. 0 not checked. [2019-09-10 02:08:32,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:32,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 16, 16] total 56 [2019-09-10 02:08:32,768 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:32,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-10 02:08:32,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-10 02:08:32,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=980, Invalid=2100, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 02:08:32,769 INFO L87 Difference]: Start difference. First operand 166 states and 179 transitions. Second operand 56 states. [2019-09-10 02:08:33,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:33,849 INFO L93 Difference]: Finished difference Result 210 states and 236 transitions. [2019-09-10 02:08:33,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-10 02:08:33,850 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 165 [2019-09-10 02:08:33,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:33,852 INFO L225 Difference]: With dead ends: 210 [2019-09-10 02:08:33,852 INFO L226 Difference]: Without dead ends: 210 [2019-09-10 02:08:33,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 291 SyntacticMatches, 26 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3238 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3324, Invalid=8448, Unknown=0, NotChecked=0, Total=11772 [2019-09-10 02:08:33,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-10 02:08:33,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 172. [2019-09-10 02:08:33,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-10 02:08:33,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 186 transitions. [2019-09-10 02:08:33,857 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 186 transitions. Word has length 165 [2019-09-10 02:08:33,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:33,858 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 186 transitions. [2019-09-10 02:08:33,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-10 02:08:33,858 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 186 transitions. [2019-09-10 02:08:33,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-10 02:08:33,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:33,859 INFO L399 BasicCegarLoop]: trace histogram [54, 53, 40, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:33,859 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:33,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:33,859 INFO L82 PathProgramCache]: Analyzing trace with hash 120516509, now seen corresponding path program 39 times [2019-09-10 02:08:33,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:33,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:33,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:33,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:33,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:34,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 1626 proven. 2420 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-09-10 02:08:34,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:34,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:34,680 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:34,680 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:34,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:34,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:34,690 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:34,690 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:08:34,742 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:34,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:34,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-10 02:08:34,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:34,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 1626 proven. 2420 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-09-10 02:08:34,793 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:35,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 1626 proven. 2420 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-09-10 02:08:35,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:35,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 52 [2019-09-10 02:08:35,671 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:35,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-10 02:08:35,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-10 02:08:35,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:35,672 INFO L87 Difference]: Start difference. First operand 172 states and 186 transitions. Second operand 43 states. [2019-09-10 02:08:35,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:35,823 INFO L93 Difference]: Finished difference Result 176 states and 190 transitions. [2019-09-10 02:08:35,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-10 02:08:35,824 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 171 [2019-09-10 02:08:35,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:35,825 INFO L225 Difference]: With dead ends: 176 [2019-09-10 02:08:35,825 INFO L226 Difference]: Without dead ends: 176 [2019-09-10 02:08:35,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 302 SyntacticMatches, 32 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:35,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-10 02:08:35,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2019-09-10 02:08:35,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-10 02:08:35,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 189 transitions. [2019-09-10 02:08:35,831 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 189 transitions. Word has length 171 [2019-09-10 02:08:35,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:35,831 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 189 transitions. [2019-09-10 02:08:35,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-10 02:08:35,831 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 189 transitions. [2019-09-10 02:08:35,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-10 02:08:35,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:35,832 INFO L399 BasicCegarLoop]: trace histogram [55, 54, 41, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:35,832 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:35,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:35,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1655335962, now seen corresponding path program 40 times [2019-09-10 02:08:35,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:35,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:35,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:35,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:35,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:36,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 1666 proven. 2542 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-09-10 02:08:36,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:36,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:36,585 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:36,585 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:36,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:36,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:36,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:36,596 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:08:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:36,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-10 02:08:36,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:36,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 1666 proven. 2542 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-09-10 02:08:36,693 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:37,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 1666 proven. 2542 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-09-10 02:08:37,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:37,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 52 [2019-09-10 02:08:37,530 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:37,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-10 02:08:37,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-10 02:08:37,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:37,531 INFO L87 Difference]: Start difference. First operand 175 states and 189 transitions. Second operand 44 states. [2019-09-10 02:08:37,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:37,682 INFO L93 Difference]: Finished difference Result 179 states and 193 transitions. [2019-09-10 02:08:37,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-10 02:08:37,682 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 174 [2019-09-10 02:08:37,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:37,684 INFO L225 Difference]: With dead ends: 179 [2019-09-10 02:08:37,684 INFO L226 Difference]: Without dead ends: 179 [2019-09-10 02:08:37,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 307 SyntacticMatches, 34 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:37,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-10 02:08:37,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2019-09-10 02:08:37,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-10 02:08:37,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 192 transitions. [2019-09-10 02:08:37,688 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 192 transitions. Word has length 174 [2019-09-10 02:08:37,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:37,688 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 192 transitions. [2019-09-10 02:08:37,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-10 02:08:37,689 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 192 transitions. [2019-09-10 02:08:37,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-10 02:08:37,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:37,690 INFO L399 BasicCegarLoop]: trace histogram [56, 55, 42, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:37,690 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:37,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:37,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1239827069, now seen corresponding path program 41 times [2019-09-10 02:08:37,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:37,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:37,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:37,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:37,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:38,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 1706 proven. 2667 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-09-10 02:08:38,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:38,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:38,512 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:38,512 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:38,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:38,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:38,524 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:08:38,524 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:08:38,600 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-09-10 02:08:38,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:38,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 02:08:38,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:38,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 2913 proven. 534 refuted. 0 times theorem prover too weak. 1173 trivial. 0 not checked. [2019-09-10 02:08:38,948 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:39,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 2913 proven. 534 refuted. 0 times theorem prover too weak. 1173 trivial. 0 not checked. [2019-09-10 02:08:39,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:39,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 17, 17] total 60 [2019-09-10 02:08:39,585 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:39,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-10 02:08:39,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-10 02:08:39,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1125, Invalid=2415, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 02:08:39,586 INFO L87 Difference]: Start difference. First operand 178 states and 192 transitions. Second operand 60 states. [2019-09-10 02:08:40,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:40,812 INFO L93 Difference]: Finished difference Result 225 states and 253 transitions. [2019-09-10 02:08:40,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-10 02:08:40,813 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 177 [2019-09-10 02:08:40,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:40,814 INFO L225 Difference]: With dead ends: 225 [2019-09-10 02:08:40,814 INFO L226 Difference]: Without dead ends: 225 [2019-09-10 02:08:40,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 312 SyntacticMatches, 28 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3753 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3817, Invalid=9755, Unknown=0, NotChecked=0, Total=13572 [2019-09-10 02:08:40,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-09-10 02:08:40,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 184. [2019-09-10 02:08:40,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-10 02:08:40,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 199 transitions. [2019-09-10 02:08:40,820 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 199 transitions. Word has length 177 [2019-09-10 02:08:40,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:40,821 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 199 transitions. [2019-09-10 02:08:40,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-10 02:08:40,821 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 199 transitions. [2019-09-10 02:08:40,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 02:08:40,822 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:40,822 INFO L399 BasicCegarLoop]: trace histogram [58, 57, 43, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:40,822 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:40,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:40,823 INFO L82 PathProgramCache]: Analyzing trace with hash -480169701, now seen corresponding path program 42 times [2019-09-10 02:08:40,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:40,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:40,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:40,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:40,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:41,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 1877 proven. 2795 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2019-09-10 02:08:41,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:41,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:41,587 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:41,588 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:41,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:41,588 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:41,598 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:41,598 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:08:41,668 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:41,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:41,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-10 02:08:41,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:41,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 1877 proven. 2795 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2019-09-10 02:08:41,709 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:42,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 1877 proven. 2795 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (43)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:08:42,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:42,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 52 [2019-09-10 02:08:42,641 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:42,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-10 02:08:42,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-10 02:08:42,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:42,642 INFO L87 Difference]: Start difference. First operand 184 states and 199 transitions. Second operand 46 states. [2019-09-10 02:08:42,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:42,774 INFO L93 Difference]: Finished difference Result 188 states and 203 transitions. [2019-09-10 02:08:42,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-10 02:08:42,774 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 183 [2019-09-10 02:08:42,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:42,776 INFO L225 Difference]: With dead ends: 188 [2019-09-10 02:08:42,776 INFO L226 Difference]: Without dead ends: 188 [2019-09-10 02:08:42,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 323 SyntacticMatches, 38 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:42,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-10 02:08:42,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2019-09-10 02:08:42,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-09-10 02:08:42,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 202 transitions. [2019-09-10 02:08:42,780 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 202 transitions. Word has length 183 [2019-09-10 02:08:42,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:42,781 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 202 transitions. [2019-09-10 02:08:42,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-10 02:08:42,781 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 202 transitions. [2019-09-10 02:08:42,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 02:08:42,782 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:42,782 INFO L399 BasicCegarLoop]: trace histogram [59, 58, 44, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:42,782 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:42,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:42,782 INFO L82 PathProgramCache]: Analyzing trace with hash -881010152, now seen corresponding path program 43 times [2019-09-10 02:08:42,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:42,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:42,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:42,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:42,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:43,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5133 backedges. 1920 proven. 2926 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2019-09-10 02:08:43,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:43,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:43,917 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:43,917 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:43,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:43,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:43,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:43,929 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:08:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:43,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-10 02:08:43,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:44,027 INFO L134 CoverageAnalysis]: Checked inductivity of 5133 backedges. 1920 proven. 2926 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2019-09-10 02:08:44,027 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:45,001 INFO L134 CoverageAnalysis]: Checked inductivity of 5133 backedges. 1920 proven. 2926 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (44)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:08:45,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:45,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 52 [2019-09-10 02:08:45,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:45,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-10 02:08:45,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-10 02:08:45,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:45,009 INFO L87 Difference]: Start difference. First operand 187 states and 202 transitions. Second operand 47 states. [2019-09-10 02:08:45,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:45,159 INFO L93 Difference]: Finished difference Result 191 states and 206 transitions. [2019-09-10 02:08:45,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-10 02:08:45,159 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 186 [2019-09-10 02:08:45,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:45,160 INFO L225 Difference]: With dead ends: 191 [2019-09-10 02:08:45,161 INFO L226 Difference]: Without dead ends: 191 [2019-09-10 02:08:45,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 328 SyntacticMatches, 40 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:45,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-09-10 02:08:45,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2019-09-10 02:08:45,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-10 02:08:45,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 205 transitions. [2019-09-10 02:08:45,165 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 205 transitions. Word has length 186 [2019-09-10 02:08:45,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:45,166 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 205 transitions. [2019-09-10 02:08:45,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-10 02:08:45,166 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 205 transitions. [2019-09-10 02:08:45,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 02:08:45,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:45,167 INFO L399 BasicCegarLoop]: trace histogram [60, 59, 45, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:45,167 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:45,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:45,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1985164283, now seen corresponding path program 44 times [2019-09-10 02:08:45,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:45,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:45,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:45,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:45,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:45,999 INFO L134 CoverageAnalysis]: Checked inductivity of 5310 backedges. 1963 proven. 3060 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2019-09-10 02:08:45,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:45,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:46,000 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:46,000 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:46,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:46,000 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:46,010 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:08:46,010 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:08:46,100 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-09-10 02:08:46,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:46,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 02:08:46,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:46,498 INFO L134 CoverageAnalysis]: Checked inductivity of 5310 backedges. 3346 proven. 617 refuted. 0 times theorem prover too weak. 1347 trivial. 0 not checked. [2019-09-10 02:08:46,498 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:47,216 INFO L134 CoverageAnalysis]: Checked inductivity of 5310 backedges. 3346 proven. 617 refuted. 0 times theorem prover too weak. 1347 trivial. 0 not checked. [2019-09-10 02:08:47,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:47,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 18, 18] total 64 [2019-09-10 02:08:47,220 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:47,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-10 02:08:47,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-10 02:08:47,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=2752, Unknown=0, NotChecked=0, Total=4032 [2019-09-10 02:08:47,221 INFO L87 Difference]: Start difference. First operand 190 states and 205 transitions. Second operand 64 states. [2019-09-10 02:08:48,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:48,757 INFO L93 Difference]: Finished difference Result 240 states and 270 transitions. [2019-09-10 02:08:48,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-10 02:08:48,758 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 189 [2019-09-10 02:08:48,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:48,759 INFO L225 Difference]: With dead ends: 240 [2019-09-10 02:08:48,759 INFO L226 Difference]: Without dead ends: 240 [2019-09-10 02:08:48,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 333 SyntacticMatches, 30 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4306 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4344, Invalid=11156, Unknown=0, NotChecked=0, Total=15500 [2019-09-10 02:08:48,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-09-10 02:08:48,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 196. [2019-09-10 02:08:48,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-10 02:08:48,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 212 transitions. [2019-09-10 02:08:48,765 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 212 transitions. Word has length 189 [2019-09-10 02:08:48,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:48,765 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 212 transitions. [2019-09-10 02:08:48,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-10 02:08:48,765 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 212 transitions. [2019-09-10 02:08:48,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-10 02:08:48,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:48,767 INFO L399 BasicCegarLoop]: trace histogram [62, 61, 46, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:48,767 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:48,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:48,767 INFO L82 PathProgramCache]: Analyzing trace with hash 684051037, now seen corresponding path program 45 times [2019-09-10 02:08:48,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:48,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:48,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:48,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:48,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:49,640 INFO L134 CoverageAnalysis]: Checked inductivity of 5673 backedges. 2146 proven. 3197 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-09-10 02:08:49,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:49,640 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:49,640 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:49,640 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:49,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:49,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:49,653 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:49,653 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:08:49,712 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:49,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:49,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-10 02:08:49,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:49,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5673 backedges. 2146 proven. 3197 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-09-10 02:08:49,759 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:50,720 INFO L134 CoverageAnalysis]: Checked inductivity of 5673 backedges. 2146 proven. 3197 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-09-10 02:08:50,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:50,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 52 [2019-09-10 02:08:50,724 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:50,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-10 02:08:50,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-10 02:08:50,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:50,725 INFO L87 Difference]: Start difference. First operand 196 states and 212 transitions. Second operand 49 states. [2019-09-10 02:08:50,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:50,878 INFO L93 Difference]: Finished difference Result 200 states and 216 transitions. [2019-09-10 02:08:50,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-10 02:08:50,878 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 195 [2019-09-10 02:08:50,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:50,879 INFO L225 Difference]: With dead ends: 200 [2019-09-10 02:08:50,880 INFO L226 Difference]: Without dead ends: 200 [2019-09-10 02:08:50,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 344 SyntacticMatches, 44 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:50,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-10 02:08:50,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2019-09-10 02:08:50,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-10 02:08:50,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 215 transitions. [2019-09-10 02:08:50,884 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 215 transitions. Word has length 195 [2019-09-10 02:08:50,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:50,885 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 215 transitions. [2019-09-10 02:08:50,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-10 02:08:50,885 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 215 transitions. [2019-09-10 02:08:50,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-10 02:08:50,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:50,886 INFO L399 BasicCegarLoop]: trace histogram [63, 62, 47, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:50,887 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:50,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:50,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1948442586, now seen corresponding path program 46 times [2019-09-10 02:08:50,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:50,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:50,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:50,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:50,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:52,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5859 backedges. 2192 proven. 3337 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-09-10 02:08:52,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:52,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:52,018 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:52,018 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:52,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:52,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:52,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:52,027 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:08:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:52,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-10 02:08:52,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:52,118 INFO L134 CoverageAnalysis]: Checked inductivity of 5859 backedges. 2192 proven. 3337 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-09-10 02:08:52,118 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:52,982 INFO L134 CoverageAnalysis]: Checked inductivity of 5859 backedges. 2192 proven. 3337 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-09-10 02:08:52,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:52,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 52 [2019-09-10 02:08:52,985 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:52,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-10 02:08:52,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-10 02:08:52,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:52,986 INFO L87 Difference]: Start difference. First operand 199 states and 215 transitions. Second operand 50 states. [2019-09-10 02:08:53,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:53,165 INFO L93 Difference]: Finished difference Result 203 states and 219 transitions. [2019-09-10 02:08:53,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-10 02:08:53,165 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 198 [2019-09-10 02:08:53,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:53,166 INFO L225 Difference]: With dead ends: 203 [2019-09-10 02:08:53,167 INFO L226 Difference]: Without dead ends: 203 [2019-09-10 02:08:53,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 349 SyntacticMatches, 46 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:53,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-10 02:08:53,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-09-10 02:08:53,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-10 02:08:53,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 218 transitions. [2019-09-10 02:08:53,170 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 218 transitions. Word has length 198 [2019-09-10 02:08:53,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:53,171 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 218 transitions. [2019-09-10 02:08:53,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-10 02:08:53,171 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 218 transitions. [2019-09-10 02:08:53,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-10 02:08:53,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:53,172 INFO L399 BasicCegarLoop]: trace histogram [64, 63, 48, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:53,172 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:53,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:53,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1721074371, now seen corresponding path program 47 times [2019-09-10 02:08:53,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:53,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:53,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:53,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:53,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:54,123 INFO L134 CoverageAnalysis]: Checked inductivity of 6048 backedges. 2238 proven. 3480 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-09-10 02:08:54,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:54,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:54,124 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:54,124 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:54,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:54,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:54,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:08:54,134 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:08:54,225 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-09-10 02:08:54,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:54,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-10 02:08:54,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:54,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6048 backedges. 3809 proven. 706 refuted. 0 times theorem prover too weak. 1533 trivial. 0 not checked. [2019-09-10 02:08:54,730 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:55,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6048 backedges. 3809 proven. 706 refuted. 0 times theorem prover too weak. 1533 trivial. 0 not checked. [2019-09-10 02:08:55,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:55,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 19, 19] total 68 [2019-09-10 02:08:55,555 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:55,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-10 02:08:55,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-10 02:08:55,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1445, Invalid=3111, Unknown=0, NotChecked=0, Total=4556 [2019-09-10 02:08:55,556 INFO L87 Difference]: Start difference. First operand 202 states and 218 transitions. Second operand 68 states. [2019-09-10 02:08:57,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:57,050 INFO L93 Difference]: Finished difference Result 255 states and 287 transitions. [2019-09-10 02:08:57,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-10 02:08:57,051 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 201 [2019-09-10 02:08:57,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:57,053 INFO L225 Difference]: With dead ends: 255 [2019-09-10 02:08:57,053 INFO L226 Difference]: Without dead ends: 255 [2019-09-10 02:08:57,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 354 SyntacticMatches, 32 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4897 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4905, Invalid=12651, Unknown=0, NotChecked=0, Total=17556 [2019-09-10 02:08:57,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-09-10 02:08:57,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 208. [2019-09-10 02:08:57,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-09-10 02:08:57,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 225 transitions. [2019-09-10 02:08:57,057 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 225 transitions. Word has length 201 [2019-09-10 02:08:57,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:57,057 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 225 transitions. [2019-09-10 02:08:57,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-10 02:08:57,058 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 225 transitions. [2019-09-10 02:08:57,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-10 02:08:57,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:57,059 INFO L399 BasicCegarLoop]: trace histogram [66, 65, 49, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:57,059 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:57,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:57,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1846770341, now seen corresponding path program 48 times [2019-09-10 02:08:57,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:57,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:57,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:57,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:57,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:58,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6435 backedges. 2433 proven. 3626 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2019-09-10 02:08:58,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:58,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:58,087 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:58,087 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:58,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:58,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:58,098 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:58,098 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:08:58,160 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:58,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:58,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-10 02:08:58,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:58,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6435 backedges. 2433 proven. 3626 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2019-09-10 02:08:58,208 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:59,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6435 backedges. 2433 proven. 3626 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2019-09-10 02:08:59,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:59,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2019-09-10 02:08:59,159 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:59,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-10 02:08:59,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-10 02:08:59,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:59,160 INFO L87 Difference]: Start difference. First operand 208 states and 225 transitions. Second operand 52 states. [2019-09-10 02:08:59,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:59,335 INFO L93 Difference]: Finished difference Result 226 states and 243 transitions. [2019-09-10 02:08:59,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-10 02:08:59,335 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 207 [2019-09-10 02:08:59,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:59,337 INFO L225 Difference]: With dead ends: 226 [2019-09-10 02:08:59,337 INFO L226 Difference]: Without dead ends: 226 [2019-09-10 02:08:59,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 365 SyntacticMatches, 50 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:59,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-10 02:08:59,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 211. [2019-09-10 02:08:59,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-10 02:08:59,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 228 transitions. [2019-09-10 02:08:59,341 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 228 transitions. Word has length 207 [2019-09-10 02:08:59,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:59,341 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 228 transitions. [2019-09-10 02:08:59,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-10 02:08:59,342 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 228 transitions. [2019-09-10 02:08:59,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 02:08:59,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:59,343 INFO L399 BasicCegarLoop]: trace histogram [67, 66, 50, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:59,343 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:59,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:59,343 INFO L82 PathProgramCache]: Analyzing trace with hash -280213672, now seen corresponding path program 49 times [2019-09-10 02:08:59,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:59,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:59,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:59,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:59,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:59,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6633 backedges. 4200 proven. 801 refuted. 0 times theorem prover too weak. 1632 trivial. 0 not checked. [2019-09-10 02:08:59,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:59,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:59,723 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:59,723 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:59,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:59,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:59,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:59,733 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:08:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:59,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-10 02:08:59,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:00,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6633 backedges. 5783 proven. 801 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-10 02:09:00,763 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:01,524 INFO L134 CoverageAnalysis]: Checked inductivity of 6633 backedges. 5783 proven. 801 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-10 02:09:01,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:01,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 53, 53] total 86 [2019-09-10 02:09:01,527 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:01,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-10 02:09:01,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-10 02:09:01,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-09-10 02:09:01,529 INFO L87 Difference]: Start difference. First operand 211 states and 228 transitions. Second operand 53 states. [2019-09-10 02:09:01,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:01,916 INFO L93 Difference]: Finished difference Result 1979 states and 2574 transitions. [2019-09-10 02:09:01,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-10 02:09:01,925 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 210 [2019-09-10 02:09:01,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:01,933 INFO L225 Difference]: With dead ends: 1979 [2019-09-10 02:09:01,933 INFO L226 Difference]: Without dead ends: 1979 [2019-09-10 02:09:01,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 338 SyntacticMatches, 34 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4711 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-09-10 02:09:01,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2019-09-10 02:09:01,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 313. [2019-09-10 02:09:01,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-09-10 02:09:01,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 364 transitions. [2019-09-10 02:09:01,946 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 364 transitions. Word has length 210 [2019-09-10 02:09:01,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:01,947 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 364 transitions. [2019-09-10 02:09:01,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-10 02:09:01,947 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 364 transitions. [2019-09-10 02:09:01,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-10 02:09:01,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:01,950 INFO L399 BasicCegarLoop]: trace histogram [101, 100, 51, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:01,950 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:01,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:01,950 INFO L82 PathProgramCache]: Analyzing trace with hash -644776136, now seen corresponding path program 50 times [2019-09-10 02:09:01,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:01,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:01,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:01,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:01,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:05,700 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 0 proven. 15150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:05,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:05,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:05,701 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:05,701 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:05,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:05,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:05,716 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:09:05,716 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:09:05,881 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 77 check-sat command(s) [2019-09-10 02:09:05,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:05,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 109 conjunts are in the unsatisfiable core [2019-09-10 02:09:05,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:05,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:09:06,352 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 7648 proven. 3876 refuted. 0 times theorem prover too weak. 3626 trivial. 0 not checked. [2019-09-10 02:09:06,352 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:06,661 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 7648 proven. 3876 refuted. 0 times theorem prover too weak. 3626 trivial. 0 not checked. [2019-09-10 02:09:06,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:06,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 57, 57] total 108 [2019-09-10 02:09:06,664 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:06,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-09-10 02:09:06,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-09-10 02:09:06,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1491, Invalid=10065, Unknown=0, NotChecked=0, Total=11556 [2019-09-10 02:09:06,666 INFO L87 Difference]: Start difference. First operand 313 states and 364 transitions. Second operand 108 states. [2019-09-10 02:09:13,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:13,335 INFO L93 Difference]: Finished difference Result 4239 states and 4339 transitions. [2019-09-10 02:09:13,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-09-10 02:09:13,335 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 312 [2019-09-10 02:09:13,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:13,357 INFO L225 Difference]: With dead ends: 4239 [2019-09-10 02:09:13,357 INFO L226 Difference]: Without dead ends: 4236 [2019-09-10 02:09:13,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 730 GetRequests, 619 SyntacticMatches, 4 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2860 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1497, Invalid=10275, Unknown=0, NotChecked=0, Total=11772 [2019-09-10 02:09:13,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4236 states. [2019-09-10 02:09:13,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4236 to 4187. [2019-09-10 02:09:13,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4187 states. [2019-09-10 02:09:13,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4187 states to 4187 states and 4287 transitions. [2019-09-10 02:09:13,420 INFO L78 Accepts]: Start accepts. Automaton has 4187 states and 4287 transitions. Word has length 312 [2019-09-10 02:09:13,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:13,421 INFO L475 AbstractCegarLoop]: Abstraction has 4187 states and 4287 transitions. [2019-09-10 02:09:13,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-09-10 02:09:13,421 INFO L276 IsEmpty]: Start isEmpty. Operand 4187 states and 4287 transitions. [2019-09-10 02:09:13,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-09-10 02:09:13,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:13,423 INFO L399 BasicCegarLoop]: trace histogram [102, 101, 52, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:13,424 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:13,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:13,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1847249315, now seen corresponding path program 51 times [2019-09-10 02:09:13,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:13,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:13,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:13,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:13,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:14,981 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7903 proven. 7401 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-09-10 02:09:14,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:14,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:14,982 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:14,982 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:14,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:14,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:14,992 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:09:14,992 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:09:15,088 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:09:15,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:15,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 103 conjunts are in the unsatisfiable core [2019-09-10 02:09:15,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:15,214 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7903 proven. 7401 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-09-10 02:09:15,214 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:17,136 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7903 proven. 7401 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-09-10 02:09:17,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:17,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 54 [2019-09-10 02:09:17,140 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:17,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-10 02:09:17,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-10 02:09:17,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 02:09:17,141 INFO L87 Difference]: Start difference. First operand 4187 states and 4287 transitions. Second operand 54 states. [2019-09-10 02:09:18,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:18,067 INFO L93 Difference]: Finished difference Result 4341 states and 4441 transitions. [2019-09-10 02:09:18,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-10 02:09:18,068 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 315 [2019-09-10 02:09:18,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:18,083 INFO L225 Difference]: With dead ends: 4341 [2019-09-10 02:09:18,084 INFO L226 Difference]: Without dead ends: 4190 [2019-09-10 02:09:18,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 579 SyntacticMatches, 102 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2950 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 02:09:18,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2019-09-10 02:09:18,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 4190. [2019-09-10 02:09:18,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4190 states. [2019-09-10 02:09:18,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 4290 transitions. [2019-09-10 02:09:18,143 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 4290 transitions. Word has length 315 [2019-09-10 02:09:18,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:18,143 INFO L475 AbstractCegarLoop]: Abstraction has 4190 states and 4290 transitions. [2019-09-10 02:09:18,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-10 02:09:18,143 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 4290 transitions. [2019-09-10 02:09:18,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-10 02:09:18,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:18,145 INFO L399 BasicCegarLoop]: trace histogram [103, 102, 52, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:18,146 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:18,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:18,146 INFO L82 PathProgramCache]: Analyzing trace with hash -973780774, now seen corresponding path program 52 times [2019-09-10 02:09:18,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:18,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:18,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:18,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:18,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:19,342 INFO L134 CoverageAnalysis]: Checked inductivity of 15759 backedges. 11729 proven. 0 refuted. 0 times theorem prover too weak. 4030 trivial. 0 not checked. [2019-09-10 02:09:19,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:09:19,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2019-09-10 02:09:19,342 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:09:19,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-10 02:09:19,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-10 02:09:19,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 02:09:19,343 INFO L87 Difference]: Start difference. First operand 4190 states and 4290 transitions. Second operand 53 states. [2019-09-10 02:09:19,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:19,557 INFO L93 Difference]: Finished difference Result 157 states and 156 transitions. [2019-09-10 02:09:19,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-10 02:09:19,558 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 318 [2019-09-10 02:09:19,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:19,558 INFO L225 Difference]: With dead ends: 157 [2019-09-10 02:09:19,559 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:09:19,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 02:09:19,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:09:19,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:09:19,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:09:19,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:09:19,560 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 318 [2019-09-10 02:09:19,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:19,560 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:09:19,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-10 02:09:19,560 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:09:19,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:09:19,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:09:19 BoogieIcfgContainer [2019-09-10 02:09:19,565 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:09:19,567 INFO L168 Benchmark]: Toolchain (without parser) took 89150.76 ms. Allocated memory was 134.7 MB in the beginning and 741.9 MB in the end (delta: 607.1 MB). Free memory was 91.5 MB in the beginning and 369.4 MB in the end (delta: -277.9 MB). Peak memory consumption was 329.3 MB. Max. memory is 7.1 GB. [2019-09-10 02:09:19,568 INFO L168 Benchmark]: CDTParser took 0.91 ms. Allocated memory is still 134.7 MB. Free memory was 109.4 MB in the beginning and 109.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 02:09:19,568 INFO L168 Benchmark]: CACSL2BoogieTranslator took 200.45 ms. Allocated memory is still 134.7 MB. Free memory was 91.1 MB in the beginning and 82.3 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB. [2019-09-10 02:09:19,569 INFO L168 Benchmark]: Boogie Preprocessor took 114.66 ms. Allocated memory was 134.7 MB in the beginning and 201.9 MB in the end (delta: 67.1 MB). Free memory was 82.1 MB in the beginning and 179.0 MB in the end (delta: -96.9 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. [2019-09-10 02:09:19,569 INFO L168 Benchmark]: RCFGBuilder took 207.04 ms. Allocated memory is still 201.9 MB. Free memory was 179.0 MB in the beginning and 167.2 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. [2019-09-10 02:09:19,570 INFO L168 Benchmark]: TraceAbstraction took 88624.03 ms. Allocated memory was 201.9 MB in the beginning and 741.9 MB in the end (delta: 540.0 MB). Free memory was 167.2 MB in the beginning and 369.4 MB in the end (delta: -202.2 MB). Peak memory consumption was 337.8 MB. Max. memory is 7.1 GB. [2019-09-10 02:09:19,573 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.91 ms. Allocated memory is still 134.7 MB. Free memory was 109.4 MB in the beginning and 109.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 200.45 ms. Allocated memory is still 134.7 MB. Free memory was 91.1 MB in the beginning and 82.3 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 114.66 ms. Allocated memory was 134.7 MB in the beginning and 201.9 MB in the end (delta: 67.1 MB). Free memory was 82.1 MB in the beginning and 179.0 MB in the end (delta: -96.9 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 207.04 ms. Allocated memory is still 201.9 MB. Free memory was 179.0 MB in the beginning and 167.2 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 88624.03 ms. Allocated memory was 201.9 MB in the beginning and 741.9 MB in the end (delta: 540.0 MB). Free memory was 167.2 MB in the beginning and 369.4 MB in the end (delta: -202.2 MB). Peak memory consumption was 337.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. SAFE Result, 88.5s OverallTime, 55 OverallIterations, 103 TraceHistogramMax, 22.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1027 SDtfs, 961 SDslu, 27456 SDs, 0 SdLazy, 18683 SolverSat, 1331 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14606 GetRequests, 11072 SyntacticMatches, 844 SemanticMatches, 2690 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49844 ImplicationChecksByTransitivity, 62.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4190occurred in iteration=54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 55 MinimizatonAttempts, 2153 StatesRemovedByMinimization, 51 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 59.8s InterpolantComputationTime, 12778 NumberOfCodeBlocks, 12301 NumberOfCodeBlocksAsserted, 592 NumberOfCheckSat, 18834 ConstructedInterpolants, 0 QuantifiedInterpolants, 7840138 SizeOfPredicates, 68 NumberOfNonLiveVariables, 13384 ConjunctsInSsa, 1465 ConjunctsInUnsatCore, 157 InterpolantComputations, 4 PerfectInterpolantSequences, 250034/448443 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...