java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-acceleration/diamond_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:37:15,004 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:37:15,006 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:37:15,017 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:37:15,018 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:37:15,019 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:37:15,020 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:37:15,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:37:15,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:37:15,024 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:37:15,025 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:37:15,027 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:37:15,027 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:37:15,028 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:37:15,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:37:15,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:37:15,031 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:37:15,032 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:37:15,038 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:37:15,040 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:37:15,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:37:15,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:37:15,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:37:15,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:37:15,049 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:37:15,049 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:37:15,049 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:37:15,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:37:15,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:37:15,051 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:37:15,052 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:37:15,052 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:37:15,053 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:37:15,054 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:37:15,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:37:15,055 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:37:15,056 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:37:15,056 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:37:15,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:37:15,057 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:37:15,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:37:15,058 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-03 20:37:15,073 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:37:15,073 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:37:15,073 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:37:15,073 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:37:15,074 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:37:15,074 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:37:15,074 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:37:15,075 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:37:15,075 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:37:15,075 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:37:15,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:37:15,076 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:37:15,076 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:37:15,076 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:37:15,076 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:37:15,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:37:15,077 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:37:15,077 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:37:15,077 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:37:15,077 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:37:15,078 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:37:15,078 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:37:15,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:37:15,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:37:15,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:37:15,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:37:15,079 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:37:15,079 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:37:15,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:37:15,079 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:37:15,119 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:37:15,133 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:37:15,139 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:37:15,140 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:37:15,141 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:37:15,142 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_1-2.c [2019-09-03 20:37:15,214 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/098fdf1d4/e2876b33c475497d8318fa8ed78634bb/FLAGbf0bd83d8 [2019-09-03 20:37:15,673 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:37:15,673 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_1-2.c [2019-09-03 20:37:15,679 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/098fdf1d4/e2876b33c475497d8318fa8ed78634bb/FLAGbf0bd83d8 [2019-09-03 20:37:16,080 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/098fdf1d4/e2876b33c475497d8318fa8ed78634bb [2019-09-03 20:37:16,089 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:37:16,091 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:37:16,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:37:16,092 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:37:16,096 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:37:16,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:37:16" (1/1) ... [2019-09-03 20:37:16,100 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5194cf01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:16, skipping insertion in model container [2019-09-03 20:37:16,100 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:37:16" (1/1) ... [2019-09-03 20:37:16,107 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:37:16,121 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:37:16,258 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:37:16,261 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:37:16,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:37:16,290 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:37:16,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:16 WrapperNode [2019-09-03 20:37:16,290 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:37:16,291 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:37:16,291 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:37:16,291 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:37:16,390 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:16" (1/1) ... [2019-09-03 20:37:16,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:16" (1/1) ... [2019-09-03 20:37:16,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:16" (1/1) ... [2019-09-03 20:37:16,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:16" (1/1) ... [2019-09-03 20:37:16,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:16" (1/1) ... [2019-09-03 20:37:16,407 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:16" (1/1) ... [2019-09-03 20:37:16,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:16" (1/1) ... [2019-09-03 20:37:16,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:37:16,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:37:16,409 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:37:16,410 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:37:16,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:37:16,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:37:16,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:37:16,463 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:37:16,464 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:37:16,464 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:37:16,464 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-03 20:37:16,464 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:37:16,465 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:37:16,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:37:16,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:37:16,620 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:37:16,620 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 20:37:16,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:37:16 BoogieIcfgContainer [2019-09-03 20:37:16,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:37:16,622 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:37:16,623 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:37:16,626 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:37:16,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:37:16" (1/3) ... [2019-09-03 20:37:16,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618782cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:37:16, skipping insertion in model container [2019-09-03 20:37:16,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:16" (2/3) ... [2019-09-03 20:37:16,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618782cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:37:16, skipping insertion in model container [2019-09-03 20:37:16,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:37:16" (3/3) ... [2019-09-03 20:37:16,629 INFO L109 eAbstractionObserver]: Analyzing ICFG diamond_1-2.c [2019-09-03 20:37:16,638 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:37:16,646 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:37:16,661 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:37:16,687 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:37:16,687 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:37:16,687 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:37:16,687 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:37:16,688 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:37:16,688 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:37:16,688 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:37:16,688 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:37:16,702 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-09-03 20:37:16,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:37:16,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:16,713 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:16,715 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:16,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:16,720 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2019-09-03 20:37:16,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:16,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:16,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:16,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:16,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:16,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:16,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:37:16,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 20:37:16,813 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:37:16,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 20:37:16,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 20:37:16,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:37:16,835 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-09-03 20:37:16,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:16,850 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-09-03 20:37:16,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 20:37:16,851 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 20:37:16,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:16,860 INFO L225 Difference]: With dead ends: 18 [2019-09-03 20:37:16,861 INFO L226 Difference]: Without dead ends: 12 [2019-09-03 20:37:16,863 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-03 20:37:16,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-03 20:37:16,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-03 20:37:16,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-03 20:37:16,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-09-03 20:37:16,897 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-09-03 20:37:16,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:16,898 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-09-03 20:37:16,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 20:37:16,898 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-09-03 20:37:16,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:37:16,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:16,899 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:16,899 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:16,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:16,900 INFO L82 PathProgramCache]: Analyzing trace with hash -730736584, now seen corresponding path program 1 times [2019-09-03 20:37:16,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:16,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:16,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:16,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:16,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:17,182 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 5 [2019-09-03 20:37:17,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:17,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:37:17,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:37:17,190 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:37:17,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:37:17,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:37:17,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:37:17,193 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2019-09-03 20:37:17,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:17,231 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2019-09-03 20:37:17,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:37:17,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-03 20:37:17,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:17,239 INFO L225 Difference]: With dead ends: 14 [2019-09-03 20:37:17,239 INFO L226 Difference]: Without dead ends: 14 [2019-09-03 20:37:17,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:37:17,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-03 20:37:17,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-09-03 20:37:17,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-03 20:37:17,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-09-03 20:37:17,247 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-09-03 20:37:17,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:17,248 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-09-03 20:37:17,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:37:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-09-03 20:37:17,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 20:37:17,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:17,249 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:17,250 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:17,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:17,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1082855947, now seen corresponding path program 1 times [2019-09-03 20:37:17,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:17,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:17,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:17,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:17,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:17,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:17,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:17,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:17,369 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2019-09-03 20:37:17,370 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [25], [28], [30], [36], [37], [38], [40] [2019-09-03 20:37:17,400 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:37:17,400 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:37:17,455 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-03 20:37:17,885 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:37:17,888 INFO L272 AbstractInterpreter]: Visited 12 different actions 47 times. Merged at 3 different actions 15 times. Widened at 1 different actions 3 times. Performed 74 root evaluator evaluations with a maximum evaluation depth of 13. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2019-09-03 20:37:17,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:17,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:37:17,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:17,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:37:17,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:17,920 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:17,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 20:37:17,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:17,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:17,984 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:18,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:18,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:18,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-09-03 20:37:18,025 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:18,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:37:18,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:37:18,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:37:18,027 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 5 states. [2019-09-03 20:37:18,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:18,071 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-09-03 20:37:18,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:37:18,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-03 20:37:18,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:18,073 INFO L225 Difference]: With dead ends: 16 [2019-09-03 20:37:18,073 INFO L226 Difference]: Without dead ends: 16 [2019-09-03 20:37:18,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:37:18,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-03 20:37:18,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-09-03 20:37:18,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-03 20:37:18,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-09-03 20:37:18,077 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2019-09-03 20:37:18,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:18,078 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-09-03 20:37:18,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:37:18,078 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-09-03 20:37:18,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 20:37:18,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:18,079 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:18,079 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:18,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:18,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1025597645, now seen corresponding path program 1 times [2019-09-03 20:37:18,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:18,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:18,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:18,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:18,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:18,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:18,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:18,162 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:18,163 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2019-09-03 20:37:18,163 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [18], [25], [28], [30], [36], [37], [38], [40] [2019-09-03 20:37:18,166 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:37:18,167 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:37:18,169 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-03 20:37:18,456 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:37:18,457 INFO L272 AbstractInterpreter]: Visited 12 different actions 47 times. Merged at 3 different actions 15 times. Widened at 1 different actions 3 times. Performed 74 root evaluator evaluations with a maximum evaluation depth of 13. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 3 variables. [2019-09-03 20:37:18,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:18,457 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:37:18,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:18,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:37:18,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:18,476 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:18,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 20:37:18,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:18,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:18,508 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:18,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:18,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:18,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-09-03 20:37:18,537 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:18,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:37:18,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:37:18,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:37:18,538 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 5 states. [2019-09-03 20:37:18,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:18,579 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2019-09-03 20:37:18,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:37:18,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-03 20:37:18,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:18,580 INFO L225 Difference]: With dead ends: 18 [2019-09-03 20:37:18,580 INFO L226 Difference]: Without dead ends: 18 [2019-09-03 20:37:18,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:37:18,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-03 20:37:18,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2019-09-03 20:37:18,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-03 20:37:18,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-09-03 20:37:18,584 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2019-09-03 20:37:18,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:18,585 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-09-03 20:37:18,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:37:18,585 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-09-03 20:37:18,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 20:37:18,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:18,586 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:18,586 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:18,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:18,587 INFO L82 PathProgramCache]: Analyzing trace with hash -167147406, now seen corresponding path program 2 times [2019-09-03 20:37:18,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:18,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:18,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:18,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:18,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:18,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:18,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:18,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:18,667 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:18,668 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:18,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:18,668 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:37:18,681 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:37:18,681 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:18,698 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 20:37:18,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:18,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 20:37:18,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:18,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:18,729 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:18,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:18,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:18,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-09-03 20:37:18,831 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:18,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:37:18,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:37:18,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:37:18,833 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 6 states. [2019-09-03 20:37:18,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:18,895 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-09-03 20:37:18,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:37:18,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-09-03 20:37:18,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:18,896 INFO L225 Difference]: With dead ends: 19 [2019-09-03 20:37:18,896 INFO L226 Difference]: Without dead ends: 19 [2019-09-03 20:37:18,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:37:18,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-03 20:37:18,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-09-03 20:37:18,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-03 20:37:18,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-09-03 20:37:18,900 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 14 [2019-09-03 20:37:18,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:18,900 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-09-03 20:37:18,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:37:18,901 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-09-03 20:37:18,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 20:37:18,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:18,902 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:18,902 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:18,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:18,902 INFO L82 PathProgramCache]: Analyzing trace with hash -109889104, now seen corresponding path program 1 times [2019-09-03 20:37:18,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:18,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:18,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:18,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:18,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:19,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:19,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:19,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:19,014 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2019-09-03 20:37:19,014 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [18], [25], [28], [30], [36], [37], [38], [40] [2019-09-03 20:37:19,015 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:37:19,016 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:37:19,018 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-03 20:37:19,224 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:37:19,225 INFO L272 AbstractInterpreter]: Visited 13 different actions 53 times. Merged at 4 different actions 15 times. Widened at 2 different actions 3 times. Performed 101 root evaluator evaluations with a maximum evaluation depth of 13. Performed 101 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 7 fixpoints after 2 different actions. Largest state had 4 variables. [2019-09-03 20:37:19,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:19,225 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:37:19,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:19,226 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:19,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:19,243 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:37:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:19,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-03 20:37:19,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:19,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:19,283 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:19,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:19,314 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:37:19,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2019-09-03 20:37:19,314 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:37:19,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:37:19,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:37:19,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:37:19,315 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 3 states. [2019-09-03 20:37:19,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:19,323 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-09-03 20:37:19,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:37:19,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-03 20:37:19,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:19,325 INFO L225 Difference]: With dead ends: 21 [2019-09-03 20:37:19,325 INFO L226 Difference]: Without dead ends: 21 [2019-09-03 20:37:19,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:37:19,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-03 20:37:19,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-09-03 20:37:19,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-03 20:37:19,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-09-03 20:37:19,330 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2019-09-03 20:37:19,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:19,330 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-09-03 20:37:19,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:37:19,330 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-09-03 20:37:19,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 20:37:19,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:19,331 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:19,331 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:19,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:19,332 INFO L82 PathProgramCache]: Analyzing trace with hash -976494032, now seen corresponding path program 2 times [2019-09-03 20:37:19,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:19,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:19,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:19,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:19,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:19,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:19,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:19,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:19,406 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:19,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:19,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:19,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 20:37:19,427 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:37:19,427 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:37:19,438 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 20:37:19,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:19,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-03 20:37:19,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:19,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:19,464 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:19,484 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:19,488 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:37:19,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2019-09-03 20:37:19,488 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:37:19,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:37:19,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:37:19,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:37:19,490 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 3 states. [2019-09-03 20:37:19,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:19,498 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2019-09-03 20:37:19,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:37:19,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-03 20:37:19,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:19,501 INFO L225 Difference]: With dead ends: 21 [2019-09-03 20:37:19,501 INFO L226 Difference]: Without dead ends: 21 [2019-09-03 20:37:19,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:37:19,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-03 20:37:19,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-09-03 20:37:19,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-03 20:37:19,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-09-03 20:37:19,507 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 14 [2019-09-03 20:37:19,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:19,508 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-09-03 20:37:19,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:37:19,509 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-09-03 20:37:19,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 20:37:19,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:19,509 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:19,509 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:19,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:19,510 INFO L82 PathProgramCache]: Analyzing trace with hash -919235730, now seen corresponding path program 2 times [2019-09-03 20:37:19,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:19,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:19,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:19,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:19,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:19,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:19,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:19,598 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:19,599 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:19,599 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:19,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:19,599 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:37:19,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:37:19,621 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:19,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 20:37:19,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:19,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 20:37:19,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:19,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:19,655 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:19,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:19,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:19,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-09-03 20:37:19,699 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:19,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:37:19,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:37:19,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:37:19,701 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 6 states. [2019-09-03 20:37:19,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:19,755 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-09-03 20:37:19,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:37:19,758 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-09-03 20:37:19,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:19,758 INFO L225 Difference]: With dead ends: 23 [2019-09-03 20:37:19,758 INFO L226 Difference]: Without dead ends: 23 [2019-09-03 20:37:19,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:37:19,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-03 20:37:19,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-09-03 20:37:19,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-03 20:37:19,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-09-03 20:37:19,765 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 14 [2019-09-03 20:37:19,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:19,766 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-09-03 20:37:19,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:37:19,766 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-09-03 20:37:19,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 20:37:19,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:19,767 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:19,767 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:19,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:19,768 INFO L82 PathProgramCache]: Analyzing trace with hash -639535185, now seen corresponding path program 3 times [2019-09-03 20:37:19,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:19,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:19,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:19,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:19,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:19,865 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:19,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:19,866 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:19,866 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:19,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:19,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:19,867 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:19,885 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:37:19,885 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:37:19,895 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:37:19,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:19,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 20:37:19,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:19,918 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:19,918 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:20,079 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:20,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:20,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-09-03 20:37:20,084 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:20,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:37:20,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:37:20,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:37:20,085 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 7 states. [2019-09-03 20:37:20,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:20,138 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-09-03 20:37:20,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:37:20,141 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-09-03 20:37:20,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:20,142 INFO L225 Difference]: With dead ends: 25 [2019-09-03 20:37:20,142 INFO L226 Difference]: Without dead ends: 25 [2019-09-03 20:37:20,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:37:20,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-03 20:37:20,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-09-03 20:37:20,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-03 20:37:20,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-09-03 20:37:20,146 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 16 [2019-09-03 20:37:20,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:20,148 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-09-03 20:37:20,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:37:20,148 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-09-03 20:37:20,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 20:37:20,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:20,149 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:20,149 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:20,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:20,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1784650519, now seen corresponding path program 3 times [2019-09-03 20:37:20,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:20,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:20,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:20,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:20,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:20,213 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:20,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:20,213 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:20,214 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:20,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:20,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:20,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:20,232 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:37:20,233 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:37:20,244 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:37:20,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:20,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 20:37:20,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:20,263 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:20,264 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:20,427 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:20,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:20,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-09-03 20:37:20,432 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:20,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:37:20,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:37:20,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:37:20,433 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 7 states. [2019-09-03 20:37:20,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:20,501 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2019-09-03 20:37:20,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:37:20,501 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-09-03 20:37:20,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:20,502 INFO L225 Difference]: With dead ends: 27 [2019-09-03 20:37:20,502 INFO L226 Difference]: Without dead ends: 27 [2019-09-03 20:37:20,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:37:20,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-03 20:37:20,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-09-03 20:37:20,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-03 20:37:20,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-09-03 20:37:20,507 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 16 [2019-09-03 20:37:20,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:20,508 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-09-03 20:37:20,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:37:20,508 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-09-03 20:37:20,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 20:37:20,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:20,509 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:20,509 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:20,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:20,509 INFO L82 PathProgramCache]: Analyzing trace with hash 662342572, now seen corresponding path program 4 times [2019-09-03 20:37:20,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:20,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:20,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:20,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:20,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:20,585 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:20,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:20,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:20,585 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:20,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:20,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:20,586 INFO 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) [2019-09-03 20:37:20,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:20,599 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:20,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 20:37:20,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:20,629 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:20,630 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:20,825 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:20,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:20,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-09-03 20:37:20,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:20,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:37:20,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:37:20,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:37:20,831 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 8 states. [2019-09-03 20:37:20,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:20,918 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2019-09-03 20:37:20,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:37:20,918 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-09-03 20:37:20,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:20,919 INFO L225 Difference]: With dead ends: 29 [2019-09-03 20:37:20,920 INFO L226 Difference]: Without dead ends: 29 [2019-09-03 20:37:20,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:37:20,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-03 20:37:20,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-09-03 20:37:20,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-03 20:37:20,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-09-03 20:37:20,926 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 18 [2019-09-03 20:37:20,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:20,926 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-09-03 20:37:20,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:37:20,927 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-09-03 20:37:20,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 20:37:20,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:20,927 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:20,928 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:20,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:20,928 INFO L82 PathProgramCache]: Analyzing trace with hash -224607324, now seen corresponding path program 4 times [2019-09-03 20:37:20,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:20,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:20,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:20,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:20,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:21,038 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:21,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:21,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:21,038 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:21,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:21,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:21,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:37:21,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:21,067 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:21,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 20:37:21,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:21,102 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:21,102 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:21,392 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:21,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:21,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-09-03 20:37:21,400 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:21,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:37:21,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:37:21,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:37:21,401 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 8 states. [2019-09-03 20:37:21,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:21,491 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2019-09-03 20:37:21,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:37:21,493 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-09-03 20:37:21,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:21,494 INFO L225 Difference]: With dead ends: 31 [2019-09-03 20:37:21,494 INFO L226 Difference]: Without dead ends: 31 [2019-09-03 20:37:21,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:37:21,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-03 20:37:21,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-03 20:37:21,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-03 20:37:21,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-09-03 20:37:21,498 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 18 [2019-09-03 20:37:21,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:21,498 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-09-03 20:37:21,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:37:21,498 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-09-03 20:37:21,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 20:37:21,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:21,499 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:21,499 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:21,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:21,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1931383913, now seen corresponding path program 5 times [2019-09-03 20:37:21,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:21,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:21,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:21,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:21,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:21,587 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:21,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:21,588 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:21,588 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:21,588 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:21,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:21,589 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:37:21,604 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:37:21,604 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:21,633 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 20:37:21,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:21,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 20:37:21,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:21,665 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:21,666 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:21,965 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:21,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:21,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-09-03 20:37:21,970 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:21,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:37:21,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:37:21,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:37:21,972 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 9 states. [2019-09-03 20:37:22,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:22,076 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-09-03 20:37:22,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:37:22,077 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-09-03 20:37:22,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:22,078 INFO L225 Difference]: With dead ends: 33 [2019-09-03 20:37:22,078 INFO L226 Difference]: Without dead ends: 33 [2019-09-03 20:37:22,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:37:22,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-03 20:37:22,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-09-03 20:37:22,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-03 20:37:22,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-09-03 20:37:22,082 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 20 [2019-09-03 20:37:22,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:22,082 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-09-03 20:37:22,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:37:22,083 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-09-03 20:37:22,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 20:37:22,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:22,084 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:22,084 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:22,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:22,084 INFO L82 PathProgramCache]: Analyzing trace with hash 33316767, now seen corresponding path program 5 times [2019-09-03 20:37:22,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:22,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:22,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:22,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:22,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:22,172 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:22,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:22,172 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:22,172 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:22,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:22,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:22,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:22,200 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:37:22,200 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:37:22,231 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 20:37:22,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:22,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 20:37:22,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:22,265 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:22,265 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:22,497 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:22,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:22,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-09-03 20:37:22,501 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:22,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:37:22,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:37:22,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:37:22,502 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 9 states. [2019-09-03 20:37:22,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:22,596 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-09-03 20:37:22,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:37:22,596 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-09-03 20:37:22,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:22,597 INFO L225 Difference]: With dead ends: 35 [2019-09-03 20:37:22,597 INFO L226 Difference]: Without dead ends: 35 [2019-09-03 20:37:22,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:37:22,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-03 20:37:22,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-09-03 20:37:22,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-03 20:37:22,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-09-03 20:37:22,601 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 20 [2019-09-03 20:37:22,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:22,601 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-09-03 20:37:22,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:37:22,602 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-09-03 20:37:22,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 20:37:22,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:22,602 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:22,603 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:22,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:22,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1709400550, now seen corresponding path program 6 times [2019-09-03 20:37:22,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:22,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:22,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:22,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:22,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:22,693 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:22,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:22,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:22,694 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:22,694 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:22,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:22,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:37:22,721 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:37:22,721 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:22,734 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:37:22,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:22,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 20:37:22,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:22,756 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:22,756 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:23,072 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:23,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:23,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-09-03 20:37:23,075 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:23,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:37:23,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:37:23,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:37:23,077 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 10 states. [2019-09-03 20:37:23,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:23,211 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-09-03 20:37:23,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:37:23,212 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-09-03 20:37:23,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:23,213 INFO L225 Difference]: With dead ends: 37 [2019-09-03 20:37:23,213 INFO L226 Difference]: Without dead ends: 37 [2019-09-03 20:37:23,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:37:23,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-03 20:37:23,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-09-03 20:37:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-03 20:37:23,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-09-03 20:37:23,217 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 22 [2019-09-03 20:37:23,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:23,217 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-09-03 20:37:23,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:37:23,217 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-09-03 20:37:23,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 20:37:23,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:23,218 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:23,218 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:23,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:23,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1209734950, now seen corresponding path program 6 times [2019-09-03 20:37:23,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:23,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:23,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:23,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:23,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:23,328 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:23,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:23,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:23,328 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:23,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:23,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:23,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:37:23,346 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:37:23,346 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:23,358 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:37:23,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:23,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 20:37:23,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:23,382 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:23,382 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:23,763 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:37:23,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:23,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-09-03 20:37:23,767 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:23,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:37:23,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:37:23,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:37:23,768 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 10 states. [2019-09-03 20:37:23,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:23,911 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-09-03 20:37:23,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:37:23,914 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-09-03 20:37:23,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:23,915 INFO L225 Difference]: With dead ends: 39 [2019-09-03 20:37:23,915 INFO L226 Difference]: Without dead ends: 39 [2019-09-03 20:37:23,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:37:23,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-03 20:37:23,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-09-03 20:37:23,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-03 20:37:23,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-09-03 20:37:23,919 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 22 [2019-09-03 20:37:23,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:23,919 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-09-03 20:37:23,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:37:23,919 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-09-03 20:37:23,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 20:37:23,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:23,920 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:23,920 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:23,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:23,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1163213789, now seen corresponding path program 7 times [2019-09-03 20:37:23,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:23,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:23,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:23,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:23,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:24,023 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:24,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:24,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:24,024 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:24,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:24,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:24,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:24,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:24,034 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:37:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:24,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 20:37:24,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:24,079 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:24,079 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:24,586 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:24,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:24,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-09-03 20:37:24,590 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:24,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:37:24,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:37:24,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:37:24,591 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 11 states. [2019-09-03 20:37:24,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:24,758 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-09-03 20:37:24,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:37:24,759 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-09-03 20:37:24,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:24,760 INFO L225 Difference]: With dead ends: 41 [2019-09-03 20:37:24,760 INFO L226 Difference]: Without dead ends: 41 [2019-09-03 20:37:24,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:37:24,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-03 20:37:24,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-09-03 20:37:24,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-03 20:37:24,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2019-09-03 20:37:24,771 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 24 [2019-09-03 20:37:24,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:24,773 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2019-09-03 20:37:24,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:37:24,773 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2019-09-03 20:37:24,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 20:37:24,773 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:24,774 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:24,774 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:24,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:24,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1781526699, now seen corresponding path program 7 times [2019-09-03 20:37:24,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:24,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:24,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:24,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:24,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:24,871 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:24,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:24,872 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:24,872 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:24,872 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:24,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:24,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:24,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:24,885 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:37:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:24,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 20:37:24,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:24,926 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:24,926 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:25,233 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:25,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:25,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-09-03 20:37:25,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:25,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:37:25,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:37:25,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:37:25,238 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 11 states. [2019-09-03 20:37:25,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:25,415 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2019-09-03 20:37:25,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:37:25,415 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-09-03 20:37:25,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:25,416 INFO L225 Difference]: With dead ends: 43 [2019-09-03 20:37:25,416 INFO L226 Difference]: Without dead ends: 43 [2019-09-03 20:37:25,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:37:25,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-03 20:37:25,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-09-03 20:37:25,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-03 20:37:25,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-09-03 20:37:25,421 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 24 [2019-09-03 20:37:25,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:25,421 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-09-03 20:37:25,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:37:25,421 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-09-03 20:37:25,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 20:37:25,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:25,422 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:25,422 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:25,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:25,423 INFO L82 PathProgramCache]: Analyzing trace with hash -81622240, now seen corresponding path program 8 times [2019-09-03 20:37:25,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:25,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:25,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:25,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:25,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:25,557 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:25,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:25,557 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:25,557 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:25,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:25,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:25,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:37:25,587 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:37:25,588 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-03 20:37:25,636 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-03 20:37:25,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:25,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 20:37:25,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:25,687 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:25,687 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:26,398 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:26,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:26,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-09-03 20:37:26,406 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:26,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 20:37:26,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 20:37:26,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:37:26,407 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 12 states. [2019-09-03 20:37:26,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:26,608 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2019-09-03 20:37:26,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:37:26,608 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-09-03 20:37:26,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:26,609 INFO L225 Difference]: With dead ends: 45 [2019-09-03 20:37:26,609 INFO L226 Difference]: Without dead ends: 45 [2019-09-03 20:37:26,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:37:26,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-03 20:37:26,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-09-03 20:37:26,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-03 20:37:26,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-09-03 20:37:26,614 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 26 [2019-09-03 20:37:26,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:26,614 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-09-03 20:37:26,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 20:37:26,614 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-09-03 20:37:26,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 20:37:26,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:26,615 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:26,615 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:26,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:26,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1517583600, now seen corresponding path program 8 times [2019-09-03 20:37:26,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:26,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:26,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:26,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:26,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:26,740 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:26,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:26,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:26,741 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:26,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:26,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:26,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:26,757 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:37:26,757 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:37:26,833 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-03 20:37:26,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:26,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 20:37:26,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:26,863 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:26,863 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:27,581 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:27,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:27,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-09-03 20:37:27,585 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:27,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 20:37:27,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 20:37:27,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:37:27,587 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 12 states. [2019-09-03 20:37:27,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:27,761 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2019-09-03 20:37:27,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:37:27,762 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-09-03 20:37:27,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:27,763 INFO L225 Difference]: With dead ends: 47 [2019-09-03 20:37:27,763 INFO L226 Difference]: Without dead ends: 47 [2019-09-03 20:37:27,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:37:27,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-03 20:37:27,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-09-03 20:37:27,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-03 20:37:27,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-09-03 20:37:27,768 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 26 [2019-09-03 20:37:27,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:27,768 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-09-03 20:37:27,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 20:37:27,768 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-09-03 20:37:27,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 20:37:27,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:27,769 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:27,770 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:27,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:27,770 INFO L82 PathProgramCache]: Analyzing trace with hash -54229283, now seen corresponding path program 9 times [2019-09-03 20:37:27,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:27,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:27,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:27,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:27,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:27,925 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:27,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:27,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:27,926 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:27,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:27,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:27,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:27,936 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:37:27,937 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:37:27,949 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:37:27,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:27,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 20:37:27,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:27,980 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:27,980 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:28,628 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:28,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:28,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-09-03 20:37:28,632 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:28,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 20:37:28,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 20:37:28,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:37:28,634 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 13 states. [2019-09-03 20:37:28,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:28,855 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2019-09-03 20:37:28,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:37:28,857 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-09-03 20:37:28,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:28,857 INFO L225 Difference]: With dead ends: 49 [2019-09-03 20:37:28,858 INFO L226 Difference]: Without dead ends: 49 [2019-09-03 20:37:28,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:37:28,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-03 20:37:28,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-09-03 20:37:28,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-03 20:37:28,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2019-09-03 20:37:28,861 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 28 [2019-09-03 20:37:28,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:28,862 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2019-09-03 20:37:28,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 20:37:28,862 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2019-09-03 20:37:28,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 20:37:28,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:28,866 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:28,867 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:28,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:28,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1271335925, now seen corresponding path program 9 times [2019-09-03 20:37:28,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:28,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:28,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:28,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:28,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:29,015 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:29,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:29,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:29,016 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:29,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:29,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:29,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:29,032 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:37:29,033 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:37:29,046 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:37:29,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:29,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 20:37:29,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:29,077 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:29,078 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:29,697 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:29,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:29,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-09-03 20:37:29,701 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:29,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 20:37:29,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 20:37:29,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:37:29,702 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 13 states. [2019-09-03 20:37:29,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:29,894 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2019-09-03 20:37:29,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 20:37:29,896 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-09-03 20:37:29,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:29,897 INFO L225 Difference]: With dead ends: 51 [2019-09-03 20:37:29,897 INFO L226 Difference]: Without dead ends: 51 [2019-09-03 20:37:29,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:37:29,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-03 20:37:29,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-09-03 20:37:29,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-03 20:37:29,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2019-09-03 20:37:29,901 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 28 [2019-09-03 20:37:29,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:29,901 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2019-09-03 20:37:29,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 20:37:29,901 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2019-09-03 20:37:29,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 20:37:29,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:29,902 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:29,902 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:29,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:29,902 INFO L82 PathProgramCache]: Analyzing trace with hash 500598618, now seen corresponding path program 10 times [2019-09-03 20:37:29,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:29,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:29,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:29,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:29,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:30,055 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:30,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:30,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:30,055 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:30,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:30,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:30,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:37:30,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:30,074 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:30,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 20:37:30,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:30,114 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:30,114 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:31,055 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:31,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:31,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-09-03 20:37:31,059 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:31,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 20:37:31,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 20:37:31,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:37:31,061 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 14 states. [2019-09-03 20:37:31,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:31,348 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2019-09-03 20:37:31,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 20:37:31,349 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2019-09-03 20:37:31,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:31,350 INFO L225 Difference]: With dead ends: 53 [2019-09-03 20:37:31,350 INFO L226 Difference]: Without dead ends: 53 [2019-09-03 20:37:31,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:37:31,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-03 20:37:31,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-09-03 20:37:31,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-03 20:37:31,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-09-03 20:37:31,354 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 30 [2019-09-03 20:37:31,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:31,354 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-09-03 20:37:31,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 20:37:31,354 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-09-03 20:37:31,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 20:37:31,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:31,355 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:31,355 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:31,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:31,355 INFO L82 PathProgramCache]: Analyzing trace with hash -850521530, now seen corresponding path program 10 times [2019-09-03 20:37:31,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:31,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:31,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:31,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:31,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:31,504 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:31,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:31,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:31,505 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:31,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:31,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:31,505 INFO 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-03 20:37:31,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:31,516 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:37:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:31,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 20:37:31,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:31,549 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:31,550 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:32,503 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:32,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:32,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-09-03 20:37:32,507 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:32,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 20:37:32,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 20:37:32,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:37:32,508 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 14 states. [2019-09-03 20:37:32,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:32,742 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2019-09-03 20:37:32,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 20:37:32,743 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2019-09-03 20:37:32,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:32,744 INFO L225 Difference]: With dead ends: 55 [2019-09-03 20:37:32,744 INFO L226 Difference]: Without dead ends: 55 [2019-09-03 20:37:32,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:37:32,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-03 20:37:32,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-09-03 20:37:32,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-03 20:37:32,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2019-09-03 20:37:32,748 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 30 [2019-09-03 20:37:32,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:32,748 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2019-09-03 20:37:32,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 20:37:32,748 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2019-09-03 20:37:32,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 20:37:32,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:32,749 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:32,749 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:32,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:32,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1114266775, now seen corresponding path program 11 times [2019-09-03 20:37:32,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:32,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:32,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:32,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:32,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:32,913 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:32,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:32,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:32,913 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:32,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:32,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:32,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 20:37:32,924 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:37:32,924 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:37:32,990 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-03 20:37:32,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:32,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 20:37:32,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:33,013 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:33,013 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:34,119 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:34,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:34,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-09-03 20:37:34,123 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:34,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 20:37:34,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 20:37:34,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-03 20:37:34,124 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 15 states. [2019-09-03 20:37:34,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:34,451 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2019-09-03 20:37:34,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 20:37:34,452 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2019-09-03 20:37:34,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:34,453 INFO L225 Difference]: With dead ends: 57 [2019-09-03 20:37:34,453 INFO L226 Difference]: Without dead ends: 57 [2019-09-03 20:37:34,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-03 20:37:34,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-03 20:37:34,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-09-03 20:37:34,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-03 20:37:34,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-09-03 20:37:34,457 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 32 [2019-09-03 20:37:34,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:34,458 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-09-03 20:37:34,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 20:37:34,458 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-09-03 20:37:34,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 20:37:34,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:34,459 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:34,459 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:34,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:34,460 INFO L82 PathProgramCache]: Analyzing trace with hash -174813759, now seen corresponding path program 11 times [2019-09-03 20:37:34,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:34,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:34,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:34,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:34,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:34,645 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:34,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:34,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:34,646 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:34,646 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:34,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:34,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:34,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:37:34,659 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:37:34,736 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-03 20:37:34,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:34,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 20:37:34,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:34,777 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:34,777 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:36,097 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:36,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:36,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-09-03 20:37:36,100 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:36,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 20:37:36,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 20:37:36,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-03 20:37:36,101 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 15 states. [2019-09-03 20:37:36,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:36,362 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2019-09-03 20:37:36,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 20:37:36,363 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2019-09-03 20:37:36,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:36,364 INFO L225 Difference]: With dead ends: 59 [2019-09-03 20:37:36,364 INFO L226 Difference]: Without dead ends: 59 [2019-09-03 20:37:36,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-03 20:37:36,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-03 20:37:36,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-09-03 20:37:36,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-03 20:37:36,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-09-03 20:37:36,368 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 32 [2019-09-03 20:37:36,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:36,368 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-09-03 20:37:36,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 20:37:36,369 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-09-03 20:37:36,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 20:37:36,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:36,369 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:36,369 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:36,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:36,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1856121196, now seen corresponding path program 12 times [2019-09-03 20:37:36,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:36,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:36,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:36,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:36,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:36,556 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:36,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:36,556 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:36,556 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:36,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:36,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:36,556 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:36,567 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:37:36,567 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:37:36,580 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:37:36,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:36,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 20:37:36,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:36,636 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:36,636 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:38,325 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:38,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:38,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-09-03 20:37:38,329 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:38,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 20:37:38,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 20:37:38,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-03 20:37:38,330 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 16 states. [2019-09-03 20:37:38,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:38,704 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-09-03 20:37:38,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 20:37:38,704 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2019-09-03 20:37:38,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:38,705 INFO L225 Difference]: With dead ends: 61 [2019-09-03 20:37:38,705 INFO L226 Difference]: Without dead ends: 61 [2019-09-03 20:37:38,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-03 20:37:38,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-03 20:37:38,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-09-03 20:37:38,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-03 20:37:38,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-09-03 20:37:38,708 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2019-09-03 20:37:38,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:38,709 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-09-03 20:37:38,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 20:37:38,709 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-09-03 20:37:38,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 20:37:38,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:38,709 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:38,710 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:38,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:38,710 INFO L82 PathProgramCache]: Analyzing trace with hash 640292476, now seen corresponding path program 12 times [2019-09-03 20:37:38,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:38,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:38,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:38,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:38,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:38,938 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:38,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:38,939 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:38,939 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:38,939 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:38,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:38,940 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:37:38,956 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:37:38,956 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:38,971 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:37:38,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:38,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 20:37:38,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:39,009 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:39,009 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:40,375 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:40,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:40,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-09-03 20:37:40,378 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:40,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 20:37:40,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 20:37:40,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-03 20:37:40,379 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 16 states. [2019-09-03 20:37:40,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:40,721 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-09-03 20:37:40,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 20:37:40,724 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2019-09-03 20:37:40,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:40,725 INFO L225 Difference]: With dead ends: 63 [2019-09-03 20:37:40,725 INFO L226 Difference]: Without dead ends: 63 [2019-09-03 20:37:40,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-03 20:37:40,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-03 20:37:40,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-09-03 20:37:40,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-03 20:37:40,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-09-03 20:37:40,728 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 34 [2019-09-03 20:37:40,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:40,728 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-09-03 20:37:40,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 20:37:40,729 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-09-03 20:37:40,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 20:37:40,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:40,729 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:40,729 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:40,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:40,730 INFO L82 PathProgramCache]: Analyzing trace with hash -245709487, now seen corresponding path program 13 times [2019-09-03 20:37:40,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:40,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:40,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:40,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:40,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:40,927 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:40,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:40,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:40,927 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:40,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:40,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:40,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:40,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:40,939 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:37:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:40,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 20:37:40,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:40,979 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:40,979 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:42,672 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:42,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:42,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-09-03 20:37:42,674 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:42,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 20:37:42,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 20:37:42,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:37:42,676 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 17 states. [2019-09-03 20:37:43,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:43,114 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2019-09-03 20:37:43,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 20:37:43,114 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-09-03 20:37:43,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:43,115 INFO L225 Difference]: With dead ends: 65 [2019-09-03 20:37:43,115 INFO L226 Difference]: Without dead ends: 65 [2019-09-03 20:37:43,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:37:43,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-03 20:37:43,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-09-03 20:37:43,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-03 20:37:43,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-09-03 20:37:43,121 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 36 [2019-09-03 20:37:43,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:43,121 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-09-03 20:37:43,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 20:37:43,121 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-09-03 20:37:43,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 20:37:43,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:43,124 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:43,124 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:43,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:43,124 INFO L82 PathProgramCache]: Analyzing trace with hash -2021630857, now seen corresponding path program 13 times [2019-09-03 20:37:43,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:43,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:43,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:43,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:43,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:43,351 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:43,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:43,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:43,352 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:43,352 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:43,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:43,353 INFO 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-03 20:37:43,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:43,370 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-03 20:37:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:43,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 20:37:43,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:43,426 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:43,427 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:45,010 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:45,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:45,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-09-03 20:37:45,012 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:45,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 20:37:45,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 20:37:45,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:37:45,014 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 17 states. [2019-09-03 20:37:45,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:45,353 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2019-09-03 20:37:45,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 20:37:45,354 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-09-03 20:37:45,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:45,355 INFO L225 Difference]: With dead ends: 67 [2019-09-03 20:37:45,355 INFO L226 Difference]: Without dead ends: 67 [2019-09-03 20:37:45,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:37:45,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-03 20:37:45,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-09-03 20:37:45,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-03 20:37:45,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-09-03 20:37:45,358 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 36 [2019-09-03 20:37:45,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:45,358 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-09-03 20:37:45,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 20:37:45,358 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-09-03 20:37:45,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 20:37:45,359 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:45,359 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:45,359 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:45,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:45,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1171716302, now seen corresponding path program 14 times [2019-09-03 20:37:45,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:45,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:45,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:45,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:45,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:45,591 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:45,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:45,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:45,592 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:45,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:45,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:45,592 INFO 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-03 20:37:45,604 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:37:45,605 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-03 20:37:45,921 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-03 20:37:45,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:45,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 20:37:45,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:45,974 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:45,974 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:47,453 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-09-03 20:37:48,787 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-09-03 20:37:57,078 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:57,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:57,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 34 [2019-09-03 20:37:57,082 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:57,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 20:37:57,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 20:37:57,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=784, Unknown=1, NotChecked=0, Total=1122 [2019-09-03 20:37:57,083 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 18 states. [2019-09-03 20:37:57,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:57,528 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2019-09-03 20:37:57,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 20:37:57,528 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-09-03 20:37:57,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:57,529 INFO L225 Difference]: With dead ends: 69 [2019-09-03 20:37:57,529 INFO L226 Difference]: Without dead ends: 69 [2019-09-03 20:37:57,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=337, Invalid=784, Unknown=1, NotChecked=0, Total=1122 [2019-09-03 20:37:57,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-03 20:37:57,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-09-03 20:37:57,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-03 20:37:57,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-09-03 20:37:57,533 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 38 [2019-09-03 20:37:57,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:57,534 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-09-03 20:37:57,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 20:37:57,534 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-09-03 20:37:57,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 20:37:57,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:57,535 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:57,535 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:57,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:57,535 INFO L82 PathProgramCache]: Analyzing trace with hash -329445454, now seen corresponding path program 14 times [2019-09-03 20:37:57,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:57,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:57,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:57,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:57,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:57,797 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:57,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:57,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:57,798 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:57,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:57,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:57,798 INFO 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) [2019-09-03 20:37:57,811 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:37:57,812 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:59,686 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-03 20:37:59,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:59,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 20:37:59,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:59,717 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:59,717 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:38:01,829 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:01,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:38:01,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-09-03 20:38:01,833 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:38:01,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 20:38:01,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 20:38:01,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 20:38:01,834 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 18 states. [2019-09-03 20:38:02,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:02,235 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2019-09-03 20:38:02,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 20:38:02,236 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-09-03 20:38:02,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:02,237 INFO L225 Difference]: With dead ends: 71 [2019-09-03 20:38:02,237 INFO L226 Difference]: Without dead ends: 71 [2019-09-03 20:38:02,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 20:38:02,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-03 20:38:02,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-09-03 20:38:02,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-03 20:38:02,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-09-03 20:38:02,240 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 38 [2019-09-03 20:38:02,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:02,241 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-09-03 20:38:02,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 20:38:02,241 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-09-03 20:38:02,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 20:38:02,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:02,241 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:38:02,241 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:02,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:02,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1813266699, now seen corresponding path program 15 times [2019-09-03 20:38:02,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:02,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:02,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:38:02,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:02,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:02,471 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:02,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:02,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:38:02,472 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:38:02,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:38:02,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:02,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 20:38:02,488 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:38:02,488 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:38:02,504 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:38:02,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:38:02,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 20:38:02,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:38:02,544 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:02,545 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:38:04,662 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:04,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:38:04,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-09-03 20:38:04,665 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:38:04,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 20:38:04,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 20:38:04,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 20:38:04,668 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 19 states. [2019-09-03 20:38:05,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:05,171 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2019-09-03 20:38:05,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 20:38:05,171 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2019-09-03 20:38:05,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:05,172 INFO L225 Difference]: With dead ends: 73 [2019-09-03 20:38:05,172 INFO L226 Difference]: Without dead ends: 73 [2019-09-03 20:38:05,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 20:38:05,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-03 20:38:05,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-09-03 20:38:05,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-03 20:38:05,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2019-09-03 20:38:05,176 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 40 [2019-09-03 20:38:05,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:05,176 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2019-09-03 20:38:05,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 20:38:05,176 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2019-09-03 20:38:05,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 20:38:05,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:05,177 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:38:05,177 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:05,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:05,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1931878355, now seen corresponding path program 15 times [2019-09-03 20:38:05,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:05,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:05,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:38:05,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:05,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:05,428 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:05,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:05,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:38:05,428 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:38:05,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:38:05,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:05,429 INFO 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-03 20:38:05,447 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:38:05,447 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:38:05,462 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:38:05,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:38:05,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 20:38:05,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:38:05,524 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:05,524 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:38:07,456 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:07,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:38:07,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-09-03 20:38:07,459 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:38:07,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 20:38:07,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 20:38:07,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 20:38:07,463 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 19 states. [2019-09-03 20:38:07,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:07,890 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2019-09-03 20:38:07,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 20:38:07,890 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2019-09-03 20:38:07,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:07,891 INFO L225 Difference]: With dead ends: 75 [2019-09-03 20:38:07,891 INFO L226 Difference]: Without dead ends: 75 [2019-09-03 20:38:07,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 20:38:07,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-03 20:38:07,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-09-03 20:38:07,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-03 20:38:07,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2019-09-03 20:38:07,896 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 40 [2019-09-03 20:38:07,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:07,896 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2019-09-03 20:38:07,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 20:38:07,896 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2019-09-03 20:38:07,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 20:38:07,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:07,897 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:38:07,897 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:07,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:07,897 INFO L82 PathProgramCache]: Analyzing trace with hash -132092408, now seen corresponding path program 16 times [2019-09-03 20:38:07,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:07,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:07,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:38:07,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:07,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:08,165 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:08,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:08,165 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:38:08,165 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:38:08,165 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:38:08,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:08,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:38:08,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:38:08,176 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:38:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:08,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 20:38:08,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:38:08,224 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:08,224 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:38:11,092 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:11,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:38:11,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-09-03 20:38:11,095 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:38:11,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 20:38:11,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 20:38:11,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 20:38:11,096 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 20 states. [2019-09-03 20:38:11,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:11,693 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2019-09-03 20:38:11,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 20:38:11,694 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2019-09-03 20:38:11,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:11,695 INFO L225 Difference]: With dead ends: 77 [2019-09-03 20:38:11,695 INFO L226 Difference]: Without dead ends: 77 [2019-09-03 20:38:11,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 20:38:11,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-03 20:38:11,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-09-03 20:38:11,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-03 20:38:11,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2019-09-03 20:38:11,701 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 42 [2019-09-03 20:38:11,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:11,701 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2019-09-03 20:38:11,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 20:38:11,701 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2019-09-03 20:38:11,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 20:38:11,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:11,702 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:38:11,702 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:11,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:11,702 INFO L82 PathProgramCache]: Analyzing trace with hash 23363048, now seen corresponding path program 16 times [2019-09-03 20:38:11,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:11,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:11,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:38:11,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:11,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:12,016 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:12,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:12,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:38:12,017 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:38:12,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:38:12,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:12,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:38:12,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:38:12,038 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:38:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:12,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 20:38:12,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:38:12,107 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:12,107 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:38:14,739 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:14,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:38:14,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-09-03 20:38:14,742 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:38:14,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 20:38:14,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 20:38:14,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 20:38:14,743 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 20 states. [2019-09-03 20:38:15,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:15,217 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-09-03 20:38:15,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 20:38:15,218 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2019-09-03 20:38:15,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:15,219 INFO L225 Difference]: With dead ends: 79 [2019-09-03 20:38:15,219 INFO L226 Difference]: Without dead ends: 79 [2019-09-03 20:38:15,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 20:38:15,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-03 20:38:15,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-09-03 20:38:15,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-03 20:38:15,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2019-09-03 20:38:15,222 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 42 [2019-09-03 20:38:15,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:15,223 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2019-09-03 20:38:15,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 20:38:15,223 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2019-09-03 20:38:15,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 20:38:15,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:15,224 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:38:15,224 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:15,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:15,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1311420475, now seen corresponding path program 17 times [2019-09-03 20:38:15,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:15,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:15,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:38:15,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:15,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:15,498 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:15,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:15,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:38:15,498 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:38:15,499 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:38:15,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:15,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 20:38:15,511 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:38:15,511 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:38:17,850 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-03 20:38:17,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:38:17,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 20:38:17,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:38:17,892 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:17,892 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:38:20,624 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:20,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:38:20,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-09-03 20:38:20,629 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:38:20,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 20:38:20,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 20:38:20,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 20:38:20,630 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 21 states. [2019-09-03 20:38:21,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:21,302 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2019-09-03 20:38:21,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 20:38:21,302 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2019-09-03 20:38:21,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:21,303 INFO L225 Difference]: With dead ends: 81 [2019-09-03 20:38:21,303 INFO L226 Difference]: Without dead ends: 81 [2019-09-03 20:38:21,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 20:38:21,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-03 20:38:21,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-09-03 20:38:21,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-03 20:38:21,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-09-03 20:38:21,308 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 44 [2019-09-03 20:38:21,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:21,308 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-09-03 20:38:21,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 20:38:21,308 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-09-03 20:38:21,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 20:38:21,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:21,309 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:38:21,309 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:21,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:21,310 INFO L82 PathProgramCache]: Analyzing trace with hash 2109642979, now seen corresponding path program 17 times [2019-09-03 20:38:21,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:21,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:21,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:38:21,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:21,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:21,679 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:21,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:21,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:38:21,680 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:38:21,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:38:21,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:21,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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:38:21,696 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:38:21,697 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:38:24,923 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-03 20:38:24,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:38:24,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 20:38:24,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:38:25,007 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:25,007 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:38:43,453 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:43,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:38:43,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 21] total 40 [2019-09-03 20:38:43,458 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:38:43,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 20:38:43,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 20:38:43,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=1101, Unknown=2, NotChecked=0, Total=1560 [2019-09-03 20:38:43,460 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 21 states. [2019-09-03 20:38:44,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:44,023 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2019-09-03 20:38:44,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 20:38:44,023 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2019-09-03 20:38:44,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:44,024 INFO L225 Difference]: With dead ends: 83 [2019-09-03 20:38:44,024 INFO L226 Difference]: Without dead ends: 83 [2019-09-03 20:38:44,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 65 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=457, Invalid=1101, Unknown=2, NotChecked=0, Total=1560 [2019-09-03 20:38:44,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-03 20:38:44,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-09-03 20:38:44,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-03 20:38:44,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2019-09-03 20:38:44,029 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 44 [2019-09-03 20:38:44,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:44,029 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2019-09-03 20:38:44,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 20:38:44,029 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2019-09-03 20:38:44,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 20:38:44,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:44,030 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:38:44,030 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:44,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:44,030 INFO L82 PathProgramCache]: Analyzing trace with hash -774326718, now seen corresponding path program 18 times [2019-09-03 20:38:44,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:44,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:44,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:38:44,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:44,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:44,320 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:44,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:44,321 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:38:44,321 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:38:44,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:38:44,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:44,321 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:38:44,332 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:38:44,332 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:38:44,352 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:38:44,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:38:44,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 20:38:44,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:38:44,387 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:44,387 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:38:47,528 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:47,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:38:47,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-09-03 20:38:47,531 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:38:47,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 20:38:47,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 20:38:47,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 20:38:47,533 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 22 states. [2019-09-03 20:38:48,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:48,290 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2019-09-03 20:38:48,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 20:38:48,291 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2019-09-03 20:38:48,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:48,292 INFO L225 Difference]: With dead ends: 85 [2019-09-03 20:38:48,292 INFO L226 Difference]: Without dead ends: 85 [2019-09-03 20:38:48,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 20:38:48,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-03 20:38:48,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-09-03 20:38:48,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-09-03 20:38:48,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-09-03 20:38:48,296 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 46 [2019-09-03 20:38:48,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:48,296 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-09-03 20:38:48,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 20:38:48,296 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-09-03 20:38:48,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 20:38:48,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:48,297 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:38:48,297 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:48,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:48,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1274929438, now seen corresponding path program 18 times [2019-09-03 20:38:48,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:48,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:48,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:38:48,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:48,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:48,604 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:48,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:48,605 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:38:48,605 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:38:48,605 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:38:48,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:48,605 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:38:48,616 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:38:48,616 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:38:48,632 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:38:48,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:38:48,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 20:38:48,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:38:48,680 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:48,681 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:38:51,511 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:51,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:38:51,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-09-03 20:38:51,514 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:38:51,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 20:38:51,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 20:38:51,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 20:38:51,516 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 22 states. [2019-09-03 20:38:52,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:52,130 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2019-09-03 20:38:52,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 20:38:52,131 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2019-09-03 20:38:52,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:52,132 INFO L225 Difference]: With dead ends: 87 [2019-09-03 20:38:52,132 INFO L226 Difference]: Without dead ends: 87 [2019-09-03 20:38:52,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 20:38:52,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-09-03 20:38:52,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-09-03 20:38:52,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-03 20:38:52,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2019-09-03 20:38:52,137 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 46 [2019-09-03 20:38:52,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:52,137 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2019-09-03 20:38:52,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 20:38:52,137 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2019-09-03 20:38:52,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 20:38:52,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:52,138 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:38:52,138 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:52,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:52,139 INFO L82 PathProgramCache]: Analyzing trace with hash -23301761, now seen corresponding path program 19 times [2019-09-03 20:38:52,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:52,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:52,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:38:52,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:52,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:52,504 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:52,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:52,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:38:52,504 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:38:52,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:38:52,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:52,505 INFO 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) [2019-09-03 20:38:52,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:38:52,534 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:38:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:52,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 20:38:52,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:38:52,620 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:52,621 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:38:56,216 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:56,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:38:56,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-09-03 20:38:56,219 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:38:56,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 20:38:56,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 20:38:56,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 20:38:56,221 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 23 states. [2019-09-03 20:38:56,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:56,986 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2019-09-03 20:38:56,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 20:38:56,986 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-09-03 20:38:56,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:56,988 INFO L225 Difference]: With dead ends: 89 [2019-09-03 20:38:56,988 INFO L226 Difference]: Without dead ends: 89 [2019-09-03 20:38:56,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 20:38:56,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-03 20:38:56,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-09-03 20:38:56,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-03 20:38:56,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2019-09-03 20:38:56,992 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 48 [2019-09-03 20:38:56,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:56,992 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2019-09-03 20:38:56,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 20:38:56,993 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2019-09-03 20:38:56,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 20:38:56,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:56,993 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:38:56,994 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:56,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:56,994 INFO L82 PathProgramCache]: Analyzing trace with hash -2020866407, now seen corresponding path program 19 times [2019-09-03 20:38:56,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:56,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:56,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:38:56,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:56,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:57,308 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:57,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:57,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:38:57,308 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:38:57,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:38:57,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:57,309 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:38:57,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:38:57,321 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:38:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:57,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 20:38:57,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:38:57,370 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:57,371 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:39:00,340 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:39:00,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:39:00,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-09-03 20:39:00,343 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:39:00,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 20:39:00,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 20:39:00,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 20:39:00,345 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 23 states. [2019-09-03 20:39:00,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:39:00,985 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2019-09-03 20:39:00,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 20:39:00,987 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-09-03 20:39:00,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:39:00,988 INFO L225 Difference]: With dead ends: 91 [2019-09-03 20:39:00,988 INFO L226 Difference]: Without dead ends: 91 [2019-09-03 20:39:00,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 20:39:00,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-03 20:39:00,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-09-03 20:39:00,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-03 20:39:00,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2019-09-03 20:39:00,991 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 48 [2019-09-03 20:39:00,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:39:00,992 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2019-09-03 20:39:00,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 20:39:00,992 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2019-09-03 20:39:00,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-03 20:39:00,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:39:00,993 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:39:00,993 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:39:00,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:39:00,993 INFO L82 PathProgramCache]: Analyzing trace with hash 157176188, now seen corresponding path program 20 times [2019-09-03 20:39:00,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:39:00,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:00,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:39:00,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:00,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:39:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:01,445 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:39:01,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:01,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:39:01,446 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:39:01,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:39:01,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:01,447 INFO 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) [2019-09-03 20:39:01,460 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:39:01,460 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:39:02,156 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-03 20:39:02,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:39:02,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 20:39:02,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:39:02,229 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:39:02,229 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:39:04,608 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2019-09-03 20:39:26,379 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-09-03 20:39:39,839 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:39:39,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:39:39,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 25] total 47 [2019-09-03 20:39:39,844 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:39:39,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 20:39:39,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 20:39:39,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=620, Invalid=1533, Unknown=9, NotChecked=0, Total=2162 [2019-09-03 20:39:39,845 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 24 states. [2019-09-03 20:39:40,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:39:40,739 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2019-09-03 20:39:40,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 20:39:40,740 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-09-03 20:39:40,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:39:40,741 INFO L225 Difference]: With dead ends: 93 [2019-09-03 20:39:40,741 INFO L226 Difference]: Without dead ends: 93 [2019-09-03 20:39:40,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 74 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 38.0s TimeCoverageRelationStatistics Valid=620, Invalid=1533, Unknown=9, NotChecked=0, Total=2162 [2019-09-03 20:39:40,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-03 20:39:40,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-09-03 20:39:40,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-03 20:39:40,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2019-09-03 20:39:40,746 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 50 [2019-09-03 20:39:40,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:39:40,746 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2019-09-03 20:39:40,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 20:39:40,746 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2019-09-03 20:39:40,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-03 20:39:40,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:39:40,747 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:39:40,747 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:39:40,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:39:40,747 INFO L82 PathProgramCache]: Analyzing trace with hash 405190996, now seen corresponding path program 20 times [2019-09-03 20:39:40,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:39:40,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:40,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:39:40,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:40,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:39:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:41,108 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:39:41,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:41,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:39:41,108 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:39:41,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:39:41,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:41,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:39:41,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:39:41,119 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:39:57,068 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-03 20:39:57,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:39:57,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 20:39:57,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:39:57,454 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:39:57,454 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:40:01,166 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:40:01,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:40:01,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-09-03 20:40:01,172 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:40:01,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 20:40:01,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 20:40:01,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 20:40:01,174 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 24 states. [2019-09-03 20:40:01,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:40:01,948 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2019-09-03 20:40:01,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 20:40:01,948 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-09-03 20:40:01,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:40:01,950 INFO L225 Difference]: With dead ends: 95 [2019-09-03 20:40:01,950 INFO L226 Difference]: Without dead ends: 95 [2019-09-03 20:40:01,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 20:40:01,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-03 20:40:01,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-09-03 20:40:01,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-09-03 20:40:01,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-09-03 20:40:01,954 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 50 [2019-09-03 20:40:01,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:40:01,954 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-09-03 20:40:01,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 20:40:01,954 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-09-03 20:40:01,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 20:40:01,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:40:01,955 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:40:01,955 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:40:01,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:40:01,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1797793337, now seen corresponding path program 21 times [2019-09-03 20:40:01,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:40:01,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:01,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:40:01,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:01,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:40:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:40:02,308 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:40:02,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:02,309 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:40:02,309 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:40:02,309 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:40:02,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:02,309 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:40:02,323 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:40:02,323 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:40:02,364 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:40:02,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:40:02,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 20:40:02,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:40:02,404 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:40:02,404 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:40:06,403 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:40:06,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:40:06,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-09-03 20:40:06,406 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:40:06,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 20:40:06,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 20:40:06,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 20:40:06,408 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 25 states. [2019-09-03 20:40:07,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:40:07,348 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2019-09-03 20:40:07,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 20:40:07,349 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 52 [2019-09-03 20:40:07,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:40:07,350 INFO L225 Difference]: With dead ends: 97 [2019-09-03 20:40:07,350 INFO L226 Difference]: Without dead ends: 97 [2019-09-03 20:40:07,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 20:40:07,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-03 20:40:07,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-09-03 20:40:07,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-03 20:40:07,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2019-09-03 20:40:07,354 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 52 [2019-09-03 20:40:07,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:40:07,354 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2019-09-03 20:40:07,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 20:40:07,354 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2019-09-03 20:40:07,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 20:40:07,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:40:07,355 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:40:07,355 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:40:07,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:40:07,356 INFO L82 PathProgramCache]: Analyzing trace with hash -320886449, now seen corresponding path program 21 times [2019-09-03 20:40:07,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:40:07,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:07,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:40:07,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:07,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:40:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:40:07,711 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:40:07,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:07,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:40:07,711 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:40:07,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:40:07,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:07,712 INFO 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) [2019-09-03 20:40:07,728 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:40:07,728 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:40:07,747 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:40:07,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:40:07,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 20:40:07,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:40:07,779 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:40:07,779 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:40:11,679 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:40:11,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:40:11,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-09-03 20:40:11,682 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:40:11,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 20:40:11,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 20:40:11,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 20:40:11,683 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 25 states. [2019-09-03 20:40:12,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:40:12,469 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2019-09-03 20:40:12,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 20:40:12,469 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 52 [2019-09-03 20:40:12,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:40:12,470 INFO L225 Difference]: With dead ends: 99 [2019-09-03 20:40:12,471 INFO L226 Difference]: Without dead ends: 99 [2019-09-03 20:40:12,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 20:40:12,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-03 20:40:12,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-09-03 20:40:12,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-03 20:40:12,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-09-03 20:40:12,475 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 52 [2019-09-03 20:40:12,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:40:12,475 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-09-03 20:40:12,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 20:40:12,475 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-09-03 20:40:12,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-03 20:40:12,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:40:12,476 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:40:12,476 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:40:12,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:40:12,477 INFO L82 PathProgramCache]: Analyzing trace with hash -2117091402, now seen corresponding path program 22 times [2019-09-03 20:40:12,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:40:12,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:12,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:40:12,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:12,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:40:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:40:12,879 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:40:12,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:12,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:40:12,880 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:40:12,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:40:12,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:12,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:40:12,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:40:12,892 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:40:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:40:12,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 20:40:12,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:40:12,943 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:40:12,944 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:40:17,077 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:40:17,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:40:17,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-09-03 20:40:17,080 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:40:17,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 20:40:17,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 20:40:17,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 20:40:17,081 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 26 states. [2019-09-03 20:40:18,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:40:18,145 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2019-09-03 20:40:18,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 20:40:18,145 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 54 [2019-09-03 20:40:18,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:40:18,146 INFO L225 Difference]: With dead ends: 101 [2019-09-03 20:40:18,146 INFO L226 Difference]: Without dead ends: 101 [2019-09-03 20:40:18,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 20:40:18,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-03 20:40:18,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-09-03 20:40:18,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-03 20:40:18,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2019-09-03 20:40:18,151 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 54 [2019-09-03 20:40:18,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:40:18,151 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2019-09-03 20:40:18,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 20:40:18,151 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2019-09-03 20:40:18,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-03 20:40:18,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:40:18,152 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:40:18,152 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:40:18,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:40:18,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1998358154, now seen corresponding path program 22 times [2019-09-03 20:40:18,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:40:18,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:18,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:40:18,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:18,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:40:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:40:18,524 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:40:18,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:18,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:40:18,524 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:40:18,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:40:18,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:18,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:40:18,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:40:18,536 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:40:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:40:18,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 20:40:18,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:40:18,588 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:40:18,588 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:40:23,359 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:40:23,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:40:23,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-09-03 20:40:23,362 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:40:23,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 20:40:23,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 20:40:23,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 20:40:23,363 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 26 states. [2019-09-03 20:40:24,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:40:24,225 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2019-09-03 20:40:24,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 20:40:24,226 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 54 [2019-09-03 20:40:24,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:40:24,227 INFO L225 Difference]: With dead ends: 103 [2019-09-03 20:40:24,227 INFO L226 Difference]: Without dead ends: 103 [2019-09-03 20:40:24,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 20:40:24,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-03 20:40:24,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-09-03 20:40:24,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-03 20:40:24,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2019-09-03 20:40:24,231 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 54 [2019-09-03 20:40:24,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:40:24,231 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2019-09-03 20:40:24,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 20:40:24,231 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2019-09-03 20:40:24,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 20:40:24,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:40:24,232 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:40:24,232 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:40:24,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:40:24,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1929974285, now seen corresponding path program 23 times [2019-09-03 20:40:24,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:40:24,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:24,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:40:24,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:24,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:40:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:40:24,606 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:40:24,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:24,606 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:40:24,607 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:40:24,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:40:24,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:24,607 INFO 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-03 20:40:24,620 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:40:24,621 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:40:32,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-03 20:40:32,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:40:33,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 20:40:33,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:40:33,583 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:40:33,584 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:40:38,782 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:40:38,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:40:38,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-09-03 20:40:38,787 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:40:38,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 20:40:38,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 20:40:38,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 20:40:38,788 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand 27 states. [2019-09-03 20:40:40,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:40:40,145 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2019-09-03 20:40:40,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 20:40:40,146 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 56 [2019-09-03 20:40:40,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:40:40,147 INFO L225 Difference]: With dead ends: 105 [2019-09-03 20:40:40,147 INFO L226 Difference]: Without dead ends: 105 [2019-09-03 20:40:40,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 20:40:40,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-03 20:40:40,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-09-03 20:40:40,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-03 20:40:40,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2019-09-03 20:40:40,151 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 56 [2019-09-03 20:40:40,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:40:40,151 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2019-09-03 20:40:40,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 20:40:40,151 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2019-09-03 20:40:40,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 20:40:40,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:40:40,152 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:40:40,152 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:40:40,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:40:40,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1704395013, now seen corresponding path program 23 times [2019-09-03 20:40:40,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:40:40,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:40,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:40:40,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:40,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:40:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:40:40,584 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:40:40,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:40,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:40:40,585 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:40:40,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:40:40,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:40,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 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-03 20:40:40,600 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:40:40,601 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:41:17,318 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-03 20:41:17,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:41:17,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 20:41:17,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:41:17,362 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:17,363 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:41:21,902 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:21,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:41:21,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-09-03 20:41:21,910 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:41:21,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 20:41:21,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 20:41:21,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 20:41:21,911 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 27 states. [2019-09-03 20:41:22,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:41:22,875 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2019-09-03 20:41:22,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 20:41:22,875 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 56 [2019-09-03 20:41:22,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:41:22,876 INFO L225 Difference]: With dead ends: 107 [2019-09-03 20:41:22,876 INFO L226 Difference]: Without dead ends: 107 [2019-09-03 20:41:22,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 20:41:22,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-03 20:41:22,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-09-03 20:41:22,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-09-03 20:41:22,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2019-09-03 20:41:22,880 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 56 [2019-09-03 20:41:22,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:41:22,880 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2019-09-03 20:41:22,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 20:41:22,880 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2019-09-03 20:41:22,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-03 20:41:22,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:41:22,881 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:41:22,881 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:41:22,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:41:22,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1795916016, now seen corresponding path program 24 times [2019-09-03 20:41:22,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:41:22,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:22,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:41:22,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:22,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:41:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:23,377 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:23,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:23,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:41:23,377 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:41:23,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:41:23,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:23,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:41:23,389 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:41:23,389 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:41:23,414 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:41:23,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:41:23,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 20:41:23,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:41:23,462 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:23,463 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:41:28,809 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:28,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:41:28,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-09-03 20:41:28,812 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:41:28,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 20:41:28,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 20:41:28,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 20:41:28,814 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 28 states. [2019-09-03 20:41:30,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:41:30,055 INFO L93 Difference]: Finished difference Result 109 states and 111 transitions. [2019-09-03 20:41:30,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 20:41:30,055 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 58 [2019-09-03 20:41:30,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:41:30,057 INFO L225 Difference]: With dead ends: 109 [2019-09-03 20:41:30,057 INFO L226 Difference]: Without dead ends: 109 [2019-09-03 20:41:30,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 20:41:30,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-03 20:41:30,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-09-03 20:41:30,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-03 20:41:30,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-09-03 20:41:30,061 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 58 [2019-09-03 20:41:30,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:41:30,061 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-09-03 20:41:30,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 20:41:30,061 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-09-03 20:41:30,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-03 20:41:30,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:41:30,062 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:41:30,062 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:41:30,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:41:30,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1621309248, now seen corresponding path program 24 times [2019-09-03 20:41:30,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:41:30,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:30,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:41:30,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:30,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:41:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:30,488 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:30,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:30,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:41:30,488 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:41:30,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:41:30,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:30,489 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 20:41:30,499 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:41:30,499 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:41:30,519 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:41:30,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:41:30,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 20:41:30,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:41:30,567 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:30,567 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:41:36,073 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:36,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:41:36,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-09-03 20:41:36,076 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:41:36,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 20:41:36,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 20:41:36,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 20:41:36,078 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 28 states. [2019-09-03 20:41:37,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:41:37,106 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2019-09-03 20:41:37,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 20:41:37,107 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 58 [2019-09-03 20:41:37,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:41:37,108 INFO L225 Difference]: With dead ends: 111 [2019-09-03 20:41:37,108 INFO L226 Difference]: Without dead ends: 111 [2019-09-03 20:41:37,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 20:41:37,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-03 20:41:37,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-09-03 20:41:37,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-03 20:41:37,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2019-09-03 20:41:37,112 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 58 [2019-09-03 20:41:37,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:41:37,112 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2019-09-03 20:41:37,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 20:41:37,112 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2019-09-03 20:41:37,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-03 20:41:37,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:41:37,113 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:41:37,113 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:41:37,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:41:37,114 INFO L82 PathProgramCache]: Analyzing trace with hash 373770413, now seen corresponding path program 25 times [2019-09-03 20:41:37,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:41:37,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:37,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:41:37,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:37,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:41:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:37,584 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:37,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:37,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:41:37,585 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:41:37,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:41:37,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:37,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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:41:37,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:41:37,596 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:41:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:37,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-03 20:41:37,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:41:37,662 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:37,662 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:41:43,225 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:43,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:41:43,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-09-03 20:41:43,229 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:41:43,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 20:41:43,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 20:41:43,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 20:41:43,229 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 29 states. [2019-09-03 20:41:44,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:41:44,568 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2019-09-03 20:41:44,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 20:41:44,568 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 60 [2019-09-03 20:41:44,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:41:44,569 INFO L225 Difference]: With dead ends: 113 [2019-09-03 20:41:44,570 INFO L226 Difference]: Without dead ends: 113 [2019-09-03 20:41:44,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 20:41:44,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-03 20:41:44,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-09-03 20:41:44,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-03 20:41:44,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-09-03 20:41:44,574 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 60 [2019-09-03 20:41:44,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:41:44,574 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-09-03 20:41:44,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 20:41:44,574 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-09-03 20:41:44,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-03 20:41:44,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:41:44,575 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:41:44,575 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:41:44,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:41:44,575 INFO L82 PathProgramCache]: Analyzing trace with hash 2127531451, now seen corresponding path program 25 times [2019-09-03 20:41:44,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:41:44,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:44,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:41:44,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:44,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:41:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:45,023 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:45,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:45,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:41:45,024 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:41:45,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:41:45,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:45,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:41:45,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:41:45,036 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:41:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:45,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-03 20:41:45,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:41:45,113 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:45,113 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:41:50,596 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:50,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:41:50,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-09-03 20:41:50,599 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:41:50,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 20:41:50,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 20:41:50,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=833, Invalid=2137, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 20:41:50,600 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 29 states. [2019-09-03 20:41:51,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:41:51,701 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2019-09-03 20:41:51,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 20:41:51,702 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 60 [2019-09-03 20:41:51,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:41:51,703 INFO L225 Difference]: With dead ends: 115 [2019-09-03 20:41:51,703 INFO L226 Difference]: Without dead ends: 115 [2019-09-03 20:41:51,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=833, Invalid=2137, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 20:41:51,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-09-03 20:41:51,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-09-03 20:41:51,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-03 20:41:51,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 116 transitions. [2019-09-03 20:41:51,707 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 116 transitions. Word has length 60 [2019-09-03 20:41:51,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:41:51,707 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 116 transitions. [2019-09-03 20:41:51,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 20:41:51,707 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2019-09-03 20:41:51,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-03 20:41:51,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:41:51,708 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:41:51,708 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:41:51,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:41:51,708 INFO L82 PathProgramCache]: Analyzing trace with hash -508553942, now seen corresponding path program 26 times [2019-09-03 20:41:51,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:41:51,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:51,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:41:51,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:51,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:41:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:52,174 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:52,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:52,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:41:52,175 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:41:52,175 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:41:52,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:52,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:41:52,185 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:41:52,185 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:41:59,250 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-09-03 20:41:59,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:41:59,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-03 20:41:59,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:41:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:59,310 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:42:05,934 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:05,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:42:05,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-09-03 20:42:05,939 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:42:05,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 20:42:05,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 20:42:05,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=894, Invalid=2298, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 20:42:05,943 INFO L87 Difference]: Start difference. First operand 114 states and 116 transitions. Second operand 30 states. [2019-09-03 20:42:07,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:42:07,354 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2019-09-03 20:42:07,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 20:42:07,354 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 62 [2019-09-03 20:42:07,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:42:07,355 INFO L225 Difference]: With dead ends: 117 [2019-09-03 20:42:07,356 INFO L226 Difference]: Without dead ends: 117 [2019-09-03 20:42:07,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=894, Invalid=2298, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 20:42:07,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-03 20:42:07,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2019-09-03 20:42:07,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-03 20:42:07,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2019-09-03 20:42:07,360 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 62 [2019-09-03 20:42:07,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:42:07,360 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2019-09-03 20:42:07,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 20:42:07,361 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2019-09-03 20:42:07,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-03 20:42:07,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:42:07,361 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:42:07,362 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:42:07,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:42:07,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1285881846, now seen corresponding path program 26 times [2019-09-03 20:42:07,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:42:07,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:07,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:42:07,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:07,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:42:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:07,849 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:07,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:07,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:42:07,850 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:42:07,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:42:07,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:07,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:42:07,860 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:42:07,860 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:42:36,936 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-09-03 20:42:36,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:42:36,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-03 20:42:36,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:42:37,022 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:37,022 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:42:41,716 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:41,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:42:41,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-09-03 20:42:41,722 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:42:41,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 20:42:41,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 20:42:41,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=885, Invalid=2307, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 20:42:41,723 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand 30 states. [2019-09-03 20:42:42,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:42:42,899 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2019-09-03 20:42:42,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 20:42:42,899 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 62 [2019-09-03 20:42:42,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:42:42,900 INFO L225 Difference]: With dead ends: 119 [2019-09-03 20:42:42,900 INFO L226 Difference]: Without dead ends: 119 [2019-09-03 20:42:42,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=885, Invalid=2307, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 20:42:42,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-09-03 20:42:42,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-09-03 20:42:42,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-03 20:42:42,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 120 transitions. [2019-09-03 20:42:42,904 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 120 transitions. Word has length 62 [2019-09-03 20:42:42,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:42:42,904 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 120 transitions. [2019-09-03 20:42:42,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 20:42:42,905 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 120 transitions. [2019-09-03 20:42:42,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 20:42:42,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:42:42,905 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:42:42,906 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:42:42,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:42:42,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1981265511, now seen corresponding path program 27 times [2019-09-03 20:42:42,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:42:42,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:42,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:42:42,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:42,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:42:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:43,455 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:43,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:43,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:42:43,455 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:42:43,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:42:43,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:43,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:42:43,465 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:42:43,465 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:42:43,491 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:42:43,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:42:43,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-03 20:42:43,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:42:43,530 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:43,530 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:42:50,483 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:50,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:42:50,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-09-03 20:42:50,486 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:42:50,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 20:42:50,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 20:42:50,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 20:42:50,487 INFO L87 Difference]: Start difference. First operand 118 states and 120 transitions. Second operand 31 states. [2019-09-03 20:42:52,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:42:52,012 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2019-09-03 20:42:52,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 20:42:52,013 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 64 [2019-09-03 20:42:52,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:42:52,014 INFO L225 Difference]: With dead ends: 121 [2019-09-03 20:42:52,014 INFO L226 Difference]: Without dead ends: 121 [2019-09-03 20:42:52,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 20:42:52,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-03 20:42:52,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2019-09-03 20:42:52,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-03 20:42:52,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 122 transitions. [2019-09-03 20:42:52,019 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 122 transitions. Word has length 64 [2019-09-03 20:42:52,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:42:52,019 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 122 transitions. [2019-09-03 20:42:52,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 20:42:52,019 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2019-09-03 20:42:52,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 20:42:52,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:42:52,020 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:42:52,020 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:42:52,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:42:52,020 INFO L82 PathProgramCache]: Analyzing trace with hash -85536911, now seen corresponding path program 27 times [2019-09-03 20:42:52,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:42:52,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:52,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:42:52,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:52,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:42:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:52,657 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:52,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:52,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:42:52,657 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:42:52,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:42:52,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:52,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:42:52,667 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:42:52,667 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:42:52,688 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:42:52,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:42:52,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-03 20:42:52,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:42:52,729 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:52,730 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:42:57,570 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:57,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:42:57,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-09-03 20:42:57,573 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:42:57,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 20:42:57,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 20:42:57,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=935, Invalid=2487, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 20:42:57,574 INFO L87 Difference]: Start difference. First operand 120 states and 122 transitions. Second operand 31 states. [2019-09-03 20:42:58,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:42:58,830 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2019-09-03 20:42:58,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 20:42:58,831 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 64 [2019-09-03 20:42:58,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:42:58,832 INFO L225 Difference]: With dead ends: 123 [2019-09-03 20:42:58,832 INFO L226 Difference]: Without dead ends: 123 [2019-09-03 20:42:58,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=935, Invalid=2487, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 20:42:58,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-03 20:42:58,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-09-03 20:42:58,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-03 20:42:58,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2019-09-03 20:42:58,836 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 64 [2019-09-03 20:42:58,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:42:58,836 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2019-09-03 20:42:58,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 20:42:58,836 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2019-09-03 20:42:58,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-03 20:42:58,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:42:58,837 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:42:58,837 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:42:58,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:42:58,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1893991324, now seen corresponding path program 28 times [2019-09-03 20:42:58,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:42:58,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:58,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:42:58,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:58,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:42:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:59,358 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:59,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:59,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:42:59,358 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:42:59,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:42:59,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:59,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:42:59,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:42:59,372 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:42:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:59,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-03 20:42:59,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:42:59,439 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:59,439 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:43:07,397 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:43:07,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:43:07,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-09-03 20:43:07,400 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:43:07,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 20:43:07,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 20:43:07,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 20:43:07,401 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 32 states. [2019-09-03 20:43:09,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:43:09,079 INFO L93 Difference]: Finished difference Result 125 states and 127 transitions. [2019-09-03 20:43:09,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 20:43:09,080 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 66 [2019-09-03 20:43:09,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:43:09,081 INFO L225 Difference]: With dead ends: 125 [2019-09-03 20:43:09,081 INFO L226 Difference]: Without dead ends: 125 [2019-09-03 20:43:09,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 20:43:09,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-03 20:43:09,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-09-03 20:43:09,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-03 20:43:09,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2019-09-03 20:43:09,084 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 66 [2019-09-03 20:43:09,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:43:09,085 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2019-09-03 20:43:09,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 20:43:09,085 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2019-09-03 20:43:09,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-03 20:43:09,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:43:09,085 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:43:09,086 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:43:09,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:43:09,086 INFO L82 PathProgramCache]: Analyzing trace with hash 535997484, now seen corresponding path program 28 times [2019-09-03 20:43:09,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:43:09,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:43:09,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:43:09,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:43:09,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:43:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:43:09,635 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:43:09,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:43:09,635 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:43:09,635 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:43:09,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:43:09,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:43:09,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:43:09,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:43:09,647 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:43:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:43:09,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-03 20:43:09,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:43:09,711 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:43:09,711 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:43:14,385 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:43:14,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:43:14,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-09-03 20:43:14,388 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:43:14,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 20:43:14,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 20:43:14,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=983, Invalid=2677, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 20:43:14,389 INFO L87 Difference]: Start difference. First operand 124 states and 126 transitions. Second operand 32 states. [2019-09-03 20:43:15,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:43:15,745 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2019-09-03 20:43:15,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 20:43:15,745 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 66 [2019-09-03 20:43:15,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:43:15,746 INFO L225 Difference]: With dead ends: 127 [2019-09-03 20:43:15,747 INFO L226 Difference]: Without dead ends: 127 [2019-09-03 20:43:15,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=983, Invalid=2677, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 20:43:15,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-03 20:43:15,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-09-03 20:43:15,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-09-03 20:43:15,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2019-09-03 20:43:15,749 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 66 [2019-09-03 20:43:15,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:43:15,749 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2019-09-03 20:43:15,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 20:43:15,750 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2019-09-03 20:43:15,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-03 20:43:15,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:43:15,750 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:43:15,750 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:43:15,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:43:15,751 INFO L82 PathProgramCache]: Analyzing trace with hash 2015803169, now seen corresponding path program 29 times [2019-09-03 20:43:15,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:43:15,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:43:15,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:43:15,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:43:15,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:43:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:43:16,365 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:43:16,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:43:16,365 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:43:16,365 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:43:16,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:43:16,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:43:16,365 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:43:16,375 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:43:16,375 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:43:40,709 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-03 20:43:40,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:43:40,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-03 20:43:40,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:43:40,794 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:43:40,794 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:43:47,689 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-09-03 20:43:55,276 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-09-03 20:44:39,990 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:44:39,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:44:39,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 33] total 64 [2019-09-03 20:44:39,997 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:44:39,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 20:44:39,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 20:44:39,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1117, Invalid=2901, Unknown=14, NotChecked=0, Total=4032 [2019-09-03 20:44:39,998 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 33 states. [2019-09-03 20:44:41,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:44:41,767 INFO L93 Difference]: Finished difference Result 129 states and 131 transitions. [2019-09-03 20:44:41,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 20:44:41,768 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 68 [2019-09-03 20:44:41,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:44:41,769 INFO L225 Difference]: With dead ends: 129 [2019-09-03 20:44:41,769 INFO L226 Difference]: Without dead ends: 129 [2019-09-03 20:44:41,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 59.7s TimeCoverageRelationStatistics Valid=1117, Invalid=2901, Unknown=14, NotChecked=0, Total=4032 [2019-09-03 20:44:41,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-09-03 20:44:41,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2019-09-03 20:44:41,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-03 20:44:41,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2019-09-03 20:44:41,773 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 68 [2019-09-03 20:44:41,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:44:41,773 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2019-09-03 20:44:41,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 20:44:41,773 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2019-09-03 20:44:41,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-03 20:44:41,773 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:44:41,774 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:44:41,774 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:44:41,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:44:41,774 INFO L82 PathProgramCache]: Analyzing trace with hash 830096935, now seen corresponding path program 29 times [2019-09-03 20:44:41,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:44:41,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:44:41,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:44:41,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:44:41,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:44:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:44:42,656 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:44:42,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:44:42,656 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:44:42,657 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:44:42,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:44:42,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:44:42,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:44:42,695 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:44:42,695 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:46:01,415 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-03 20:46:01,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:46:01,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-03 20:46:01,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:46:01,508 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:46:01,508 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:46:05,889 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:46:05,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:46:05,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-09-03 20:46:05,898 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:46:05,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 20:46:05,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 20:46:05,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1029, Invalid=2877, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 20:46:05,899 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand 33 states. [2019-09-03 20:46:07,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:46:07,325 INFO L93 Difference]: Finished difference Result 131 states and 133 transitions. [2019-09-03 20:46:07,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 20:46:07,326 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 68 [2019-09-03 20:46:07,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:46:07,327 INFO L225 Difference]: With dead ends: 131 [2019-09-03 20:46:07,327 INFO L226 Difference]: Without dead ends: 131 [2019-09-03 20:46:07,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1029, Invalid=2877, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 20:46:07,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-09-03 20:46:07,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-09-03 20:46:07,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-03 20:46:07,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 132 transitions. [2019-09-03 20:46:07,330 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 132 transitions. Word has length 68 [2019-09-03 20:46:07,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:46:07,331 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 132 transitions. [2019-09-03 20:46:07,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 20:46:07,331 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 132 transitions. [2019-09-03 20:46:07,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-03 20:46:07,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:46:07,332 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:46:07,332 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:46:07,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:46:07,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1231926942, now seen corresponding path program 30 times [2019-09-03 20:46:07,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:46:07,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:46:07,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:46:07,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:46:07,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:46:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:46:07,944 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:46:07,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:46:07,945 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:46:07,945 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:46:07,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:46:07,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:46:07,945 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:46:07,957 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:46:07,957 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:46:07,985 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:46:07,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:46:07,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-03 20:46:07,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:46:08,041 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:46:08,041 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:46:16,523 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:46:16,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:46:16,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-09-03 20:46:16,526 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:46:16,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 20:46:16,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 20:46:16,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1150, Invalid=3010, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 20:46:16,527 INFO L87 Difference]: Start difference. First operand 130 states and 132 transitions. Second operand 34 states. [2019-09-03 20:46:18,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:46:18,433 INFO L93 Difference]: Finished difference Result 133 states and 135 transitions. [2019-09-03 20:46:18,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 20:46:18,433 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 70 [2019-09-03 20:46:18,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:46:18,434 INFO L225 Difference]: With dead ends: 133 [2019-09-03 20:46:18,434 INFO L226 Difference]: Without dead ends: 133 [2019-09-03 20:46:18,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=1150, Invalid=3010, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 20:46:18,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-03 20:46:18,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-09-03 20:46:18,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-03 20:46:18,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 134 transitions. [2019-09-03 20:46:18,439 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 134 transitions. Word has length 70 [2019-09-03 20:46:18,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:46:18,439 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 134 transitions. [2019-09-03 20:46:18,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 20:46:18,440 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2019-09-03 20:46:18,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-03 20:46:18,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:46:18,442 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:46:18,442 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:46:18,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:46:18,443 INFO L82 PathProgramCache]: Analyzing trace with hash -8172190, now seen corresponding path program 30 times [2019-09-03 20:46:18,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:46:18,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:46:18,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:46:18,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:46:18,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:46:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:46:19,146 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:46:19,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:46:19,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:46:19,147 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:46:19,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:46:19,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:46:19,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:46:19,162 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:46:19,162 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:46:19,188 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:46:19,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:46:19,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-03 20:46:19,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:46:19,263 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:46:19,264 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:46:23,558 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:46:23,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:46:23,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-09-03 20:46:23,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:46:23,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 20:46:23,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 20:46:23,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1073, Invalid=3087, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 20:46:23,565 INFO L87 Difference]: Start difference. First operand 132 states and 134 transitions. Second operand 34 states. [2019-09-03 20:46:25,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:46:25,082 INFO L93 Difference]: Finished difference Result 135 states and 137 transitions. [2019-09-03 20:46:25,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 20:46:25,083 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 70 [2019-09-03 20:46:25,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:46:25,084 INFO L225 Difference]: With dead ends: 135 [2019-09-03 20:46:25,084 INFO L226 Difference]: Without dead ends: 135 [2019-09-03 20:46:25,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1073, Invalid=3087, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 20:46:25,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-09-03 20:46:25,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2019-09-03 20:46:25,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-09-03 20:46:25,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 136 transitions. [2019-09-03 20:46:25,088 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 136 transitions. Word has length 70 [2019-09-03 20:46:25,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:46:25,088 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 136 transitions. [2019-09-03 20:46:25,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 20:46:25,088 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 136 transitions. [2019-09-03 20:46:25,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 20:46:25,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:46:25,089 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:46:25,089 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:46:25,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:46:25,090 INFO L82 PathProgramCache]: Analyzing trace with hash -453850405, now seen corresponding path program 31 times [2019-09-03 20:46:25,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:46:25,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:46:25,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:46:25,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:46:25,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:46:25,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:46:25,825 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:46:25,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:46:25,826 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:46:25,826 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:46:25,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:46:25,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:46:25,826 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:46:25,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:46:25,843 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:46:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:46:25,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-03 20:46:25,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:46:25,917 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:46:25,918 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:46:34,873 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (64)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:46:34,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:46:34,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-09-03 20:46:34,876 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:46:34,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 20:46:34,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 20:46:34,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1219, Invalid=3203, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 20:46:34,877 INFO L87 Difference]: Start difference. First operand 134 states and 136 transitions. Second operand 35 states. [2019-09-03 20:46:36,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:46:36,906 INFO L93 Difference]: Finished difference Result 137 states and 139 transitions. [2019-09-03 20:46:36,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 20:46:36,908 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 72 [2019-09-03 20:46:36,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:46:36,909 INFO L225 Difference]: With dead ends: 137 [2019-09-03 20:46:36,909 INFO L226 Difference]: Without dead ends: 137 [2019-09-03 20:46:36,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=1219, Invalid=3203, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 20:46:36,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-09-03 20:46:36,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2019-09-03 20:46:36,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-03 20:46:36,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2019-09-03 20:46:36,911 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 72 [2019-09-03 20:46:36,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:46:36,911 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2019-09-03 20:46:36,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 20:46:36,911 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2019-09-03 20:46:36,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 20:46:36,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:46:36,912 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:46:36,912 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:46:36,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:46:36,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1869050333, now seen corresponding path program 31 times [2019-09-03 20:46:36,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:46:36,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:46:36,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:46:36,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:46:36,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:46:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:46:37,566 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:46:37,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:46:37,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:46:37,567 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:46:37,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:46:37,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:46:37,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:46:37,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:46:37,578 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:46:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:46:37,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-03 20:46:37,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:46:37,659 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:46:37,659 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:46:41,653 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:46:41,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:46:41,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-09-03 20:46:41,658 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:46:41,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 20:46:41,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 20:46:41,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1115, Invalid=3307, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 20:46:41,659 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 35 states. [2019-09-03 20:46:43,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:46:43,310 INFO L93 Difference]: Finished difference Result 139 states and 141 transitions. [2019-09-03 20:46:43,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 20:46:43,310 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 72 [2019-09-03 20:46:43,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:46:43,311 INFO L225 Difference]: With dead ends: 139 [2019-09-03 20:46:43,311 INFO L226 Difference]: Without dead ends: 139 [2019-09-03 20:46:43,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1115, Invalid=3307, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 20:46:43,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-03 20:46:43,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2019-09-03 20:46:43,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-09-03 20:46:43,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 140 transitions. [2019-09-03 20:46:43,315 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 140 transitions. Word has length 72 [2019-09-03 20:46:43,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:46:43,315 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 140 transitions. [2019-09-03 20:46:43,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 20:46:43,315 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 140 transitions. [2019-09-03 20:46:43,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-03 20:46:43,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:46:43,316 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:46:43,316 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:46:43,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:46:43,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1283210280, now seen corresponding path program 32 times [2019-09-03 20:46:43,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:46:43,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:46:43,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:46:43,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:46:43,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:46:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:46:43,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:46:43,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:46:43,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:46:43,970 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:46:43,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:46:43,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:46:43,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:46:43,979 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:46:43,979 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:47:17,967 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-09-03 20:47:17,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:47:17,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-03 20:47:17,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:47:18,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:47:18,124 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:47:29,803 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-09-03 20:47:37,095 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-09-03 20:47:40,473 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-09-03 20:48:02,582 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-09-03 20:48:35,276 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-09-03 20:48:35,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1022 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:48:35,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:48:35,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 36] total 70 [2019-09-03 20:48:35,298 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:48:35,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 20:48:35,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 20:48:35,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1327, Invalid=3485, Unknown=18, NotChecked=0, Total=4830 [2019-09-03 20:48:35,299 INFO L87 Difference]: Start difference. First operand 138 states and 140 transitions. Second operand 36 states. [2019-09-03 20:48:37,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:48:37,446 INFO L93 Difference]: Finished difference Result 141 states and 143 transitions. [2019-09-03 20:48:37,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 20:48:37,446 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 74 [2019-09-03 20:48:37,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:48:37,448 INFO L225 Difference]: With dead ends: 141 [2019-09-03 20:48:37,448 INFO L226 Difference]: Without dead ends: 141 [2019-09-03 20:48:37,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 108 SyntacticMatches, 7 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 77.8s TimeCoverageRelationStatistics Valid=1327, Invalid=3485, Unknown=18, NotChecked=0, Total=4830 [2019-09-03 20:48:37,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-09-03 20:48:37,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2019-09-03 20:48:37,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-03 20:48:37,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2019-09-03 20:48:37,451 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 74 [2019-09-03 20:48:37,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:48:37,451 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2019-09-03 20:48:37,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 20:48:37,451 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2019-09-03 20:48:37,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-03 20:48:37,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:48:37,452 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:48:37,452 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:48:37,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:48:37,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1993630616, now seen corresponding path program 32 times [2019-09-03 20:48:37,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:48:37,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:48:37,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:48:37,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:48:37,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:48:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:48:38,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:48:38,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:48:38,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:48:38,114 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:48:38,114 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:48:38,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:48:38,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:48:38,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:48:38,127 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:50:16,294 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-09-03 20:50:16,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:50:16,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-03 20:50:16,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:50:16,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:16,399 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:50:20,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:20,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:50:20,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-09-03 20:50:20,163 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:50:20,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 20:50:20,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 20:50:20,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3537, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 20:50:20,164 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 36 states. [2019-09-03 20:50:21,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:50:21,888 INFO L93 Difference]: Finished difference Result 143 states and 145 transitions. [2019-09-03 20:50:21,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 20:50:21,889 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 74 [2019-09-03 20:50:21,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:50:21,890 INFO L225 Difference]: With dead ends: 143 [2019-09-03 20:50:21,890 INFO L226 Difference]: Without dead ends: 143 [2019-09-03 20:50:21,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 114 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1155, Invalid=3537, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 20:50:21,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-09-03 20:50:21,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2019-09-03 20:50:21,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-09-03 20:50:21,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 144 transitions. [2019-09-03 20:50:21,894 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 144 transitions. Word has length 74 [2019-09-03 20:50:21,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:50:21,894 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 144 transitions. [2019-09-03 20:50:21,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 20:50:21,894 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 144 transitions. [2019-09-03 20:50:21,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-03 20:50:21,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:50:21,895 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:50:21,895 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:50:21,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:50:21,895 INFO L82 PathProgramCache]: Analyzing trace with hash 565866901, now seen corresponding path program 33 times [2019-09-03 20:50:21,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:50:21,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:21,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:50:21,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:21,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:50:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:50:22,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:22,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:22,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:50:22,776 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:50:22,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:50:22,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:22,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:50:22,787 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:50:22,787 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:50:22,818 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:50:22,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:50:22,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-03 20:50:22,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:50:22,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:22,883 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:50:33,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:33,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:50:33,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-09-03 20:50:33,525 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:50:33,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 20:50:33,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 20:50:33,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1363, Invalid=3607, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 20:50:33,526 INFO L87 Difference]: Start difference. First operand 142 states and 144 transitions. Second operand 37 states. [2019-09-03 20:50:35,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:50:35,772 INFO L93 Difference]: Finished difference Result 145 states and 147 transitions. [2019-09-03 20:50:35,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 20:50:35,773 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 76 [2019-09-03 20:50:35,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:50:35,774 INFO L225 Difference]: With dead ends: 145 [2019-09-03 20:50:35,774 INFO L226 Difference]: Without dead ends: 145 [2019-09-03 20:50:35,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=1363, Invalid=3607, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 20:50:35,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-09-03 20:50:35,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2019-09-03 20:50:35,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-09-03 20:50:35,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 146 transitions. [2019-09-03 20:50:35,777 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 146 transitions. Word has length 76 [2019-09-03 20:50:35,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:50:35,778 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 146 transitions. [2019-09-03 20:50:35,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 20:50:35,778 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 146 transitions. [2019-09-03 20:50:35,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-03 20:50:35,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:50:35,779 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:50:35,779 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:50:35,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:50:35,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1456198291, now seen corresponding path program 33 times [2019-09-03 20:50:35,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:50:35,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:35,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:50:35,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:35,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:50:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:50:36,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:36,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:36,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:50:36,614 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:50:36,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:50:36,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:36,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:50:36,628 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:50:36,628 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:50:36,652 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:50:36,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:50:36,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-03 20:50:36,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:50:36,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:36,706 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:50:40,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:40,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:50:40,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-09-03 20:50:40,365 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:50:40,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 20:50:40,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 20:50:40,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1193, Invalid=3777, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 20:50:40,366 INFO L87 Difference]: Start difference. First operand 144 states and 146 transitions. Second operand 37 states. [2019-09-03 20:50:42,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:50:42,221 INFO L93 Difference]: Finished difference Result 147 states and 149 transitions. [2019-09-03 20:50:42,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 20:50:42,221 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 76 [2019-09-03 20:50:42,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:50:42,222 INFO L225 Difference]: With dead ends: 147 [2019-09-03 20:50:42,223 INFO L226 Difference]: Without dead ends: 147 [2019-09-03 20:50:42,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1193, Invalid=3777, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 20:50:42,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-03 20:50:42,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2019-09-03 20:50:42,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-03 20:50:42,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 148 transitions. [2019-09-03 20:50:42,226 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 148 transitions. Word has length 76 [2019-09-03 20:50:42,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:50:42,226 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 148 transitions. [2019-09-03 20:50:42,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 20:50:42,227 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 148 transitions. [2019-09-03 20:50:42,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-03 20:50:42,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:50:42,227 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:50:42,228 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:50:42,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:50:42,228 INFO L82 PathProgramCache]: Analyzing trace with hash -587422702, now seen corresponding path program 34 times [2019-09-03 20:50:42,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:50:42,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:42,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:50:42,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:42,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:50:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:50:42,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:42,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:42,946 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:50:42,946 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:50:42,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:50:42,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:42,946 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:50:42,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:50:42,955 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:50:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:50:42,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-03 20:50:42,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:50:43,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:43,039 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:50:53,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:53,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:50:53,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-09-03 20:50:53,718 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:50:53,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 20:50:53,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 20:50:53,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1438, Invalid=3818, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 20:50:53,720 INFO L87 Difference]: Start difference. First operand 146 states and 148 transitions. Second operand 38 states. [2019-09-03 20:50:56,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:50:56,062 INFO L93 Difference]: Finished difference Result 149 states and 151 transitions. [2019-09-03 20:50:56,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 20:50:56,063 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 78 [2019-09-03 20:50:56,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:50:56,064 INFO L225 Difference]: With dead ends: 149 [2019-09-03 20:50:56,064 INFO L226 Difference]: Without dead ends: 149 [2019-09-03 20:50:56,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 120 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=1438, Invalid=3818, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 20:50:56,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-03 20:50:56,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2019-09-03 20:50:56,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-03 20:50:56,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2019-09-03 20:50:56,068 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 150 transitions. Word has length 78 [2019-09-03 20:50:56,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:50:56,069 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 150 transitions. [2019-09-03 20:50:56,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 20:50:56,069 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2019-09-03 20:50:56,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-03 20:50:56,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:50:56,070 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:50:56,070 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:50:56,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:50:56,070 INFO L82 PathProgramCache]: Analyzing trace with hash 379809486, now seen corresponding path program 34 times [2019-09-03 20:50:56,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:50:56,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:56,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:50:56,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:56,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:50:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:50:56,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:56,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:56,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:50:56,784 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:50:56,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:50:56,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:56,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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:50:56,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:50:56,795 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:50:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:50:56,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-03 20:50:56,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:50:56,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:56,892 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:51:00,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:00,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:51:00,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-09-03 20:51:00,106 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:51:00,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 20:51:00,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 20:51:00,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1229, Invalid=4027, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 20:51:00,107 INFO L87 Difference]: Start difference. First operand 148 states and 150 transitions. Second operand 38 states. [2019-09-03 20:51:02,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:02,047 INFO L93 Difference]: Finished difference Result 151 states and 153 transitions. [2019-09-03 20:51:02,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-03 20:51:02,048 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 78 [2019-09-03 20:51:02,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:02,049 INFO L225 Difference]: With dead ends: 151 [2019-09-03 20:51:02,049 INFO L226 Difference]: Without dead ends: 151 [2019-09-03 20:51:02,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 120 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1229, Invalid=4027, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 20:51:02,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-09-03 20:51:02,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2019-09-03 20:51:02,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 20:51:02,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2019-09-03 20:51:02,053 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 78 [2019-09-03 20:51:02,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:02,054 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2019-09-03 20:51:02,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 20:51:02,054 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2019-09-03 20:51:02,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 20:51:02,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:02,055 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:02,055 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:02,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:02,055 INFO L82 PathProgramCache]: Analyzing trace with hash -797168817, now seen corresponding path program 35 times [2019-09-03 20:51:02,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:02,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:02,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:02,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:02,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:02,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:02,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:51:02,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:51:02,973 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:51:02,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:51:02,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:51:02,974 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:51:02,984 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:51:02,984 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:51:08,643 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-09-03 20:51:08,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:51:08,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-03 20:51:08,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:51:08,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:08,744 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:51:09,456 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-09-03 20:51:16,199 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 12