java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-lit/gj2007.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:07:43,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:07:43,938 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:07:43,957 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:07:43,958 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:07:43,959 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:07:43,962 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:07:43,975 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:07:43,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:07:43,979 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:07:43,982 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:07:43,985 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:07:43,986 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:07:43,988 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:07:43,991 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:07:43,994 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:07:43,996 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:07:43,998 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:07:44,001 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:07:44,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:07:44,010 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:07:44,012 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:07:44,015 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:07:44,016 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:07:44,019 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:07:44,019 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:07:44,019 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:07:44,021 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:07:44,023 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:07:44,025 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:07:44,026 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:07:44,026 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:07:44,027 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:07:44,028 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:07:44,030 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:07:44,030 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:07:44,031 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:07:44,031 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:07:44,032 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:07:44,032 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:07:44,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:07:44,034 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:07:44,059 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:07:44,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:07:44,060 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:07:44,061 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:07:44,061 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:07:44,062 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:07:44,062 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:07:44,062 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:07:44,062 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:07:44,063 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:07:44,065 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:07:44,065 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:07:44,066 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:07:44,066 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:07:44,066 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:07:44,067 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:07:44,067 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:07:44,067 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:07:44,067 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:07:44,068 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:07:44,068 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:07:44,068 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:07:44,068 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:07:44,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:07:44,069 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:07:44,069 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:07:44,069 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:07:44,070 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:07:44,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:07:44,070 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:07:44,123 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:07:44,143 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:07:44,147 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:07:44,149 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:07:44,149 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:07:44,150 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007.i [2019-09-10 02:07:44,224 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57e2a4b9d/93ad6bb3c9d14758a27601aa8816931f/FLAGe0d38861e [2019-09-10 02:07:44,667 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:07:44,668 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.i [2019-09-10 02:07:44,675 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57e2a4b9d/93ad6bb3c9d14758a27601aa8816931f/FLAGe0d38861e [2019-09-10 02:07:45,037 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57e2a4b9d/93ad6bb3c9d14758a27601aa8816931f [2019-09-10 02:07:45,049 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:07:45,051 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:07:45,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:07:45,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:07:45,056 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:07:45,057 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:07:45" (1/1) ... [2019-09-10 02:07:45,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f1cff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:07:45, skipping insertion in model container [2019-09-10 02:07:45,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:07:45" (1/1) ... [2019-09-10 02:07:45,069 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:07:45,090 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:07:45,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:07:45,281 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:07:45,300 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:07:45,313 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:07:45,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:07:45 WrapperNode [2019-09-10 02:07:45,314 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:07:45,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:07:45,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:07:45,315 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:07:45,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:07:45" (1/1) ... [2019-09-10 02:07:45,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:07:45" (1/1) ... [2019-09-10 02:07:45,336 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:07:45" (1/1) ... [2019-09-10 02:07:45,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:07:45" (1/1) ... [2019-09-10 02:07:45,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:07:45" (1/1) ... [2019-09-10 02:07:45,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:07:45" (1/1) ... [2019-09-10 02:07:45,436 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:07:45" (1/1) ... [2019-09-10 02:07:45,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:07:45,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:07:45,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:07:45,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:07:45,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:07:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:07:45,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:07:45,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:07:45,499 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-10 02:07:45,499 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:07:45,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:07:45,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 02:07:45,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 02:07:45,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:07:45,500 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:07:45,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:07:45,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:07:45,652 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:07:45,653 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 02:07:45,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:07:45 BoogieIcfgContainer [2019-09-10 02:07:45,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:07:45,655 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:07:45,655 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:07:45,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:07:45,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:07:45" (1/3) ... [2019-09-10 02:07:45,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7965105c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:07:45, skipping insertion in model container [2019-09-10 02:07:45,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:07:45" (2/3) ... [2019-09-10 02:07:45,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7965105c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:07:45, skipping insertion in model container [2019-09-10 02:07:45,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:07:45" (3/3) ... [2019-09-10 02:07:45,661 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007.i [2019-09-10 02:07:45,671 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:07:45,678 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:07:45,690 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:07:45,715 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:07:45,716 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:07:45,716 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:07:45,716 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:07:45,716 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:07:45,717 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:07:45,717 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:07:45,717 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:07:45,732 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-09-10 02:07:45,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 02:07:45,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:45,743 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:45,745 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:45,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:45,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1712329921, now seen corresponding path program 1 times [2019-09-10 02:07:45,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:45,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:45,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:45,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:45,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:45,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:45,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:07:45,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 02:07:45,855 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:07:45,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:07:45,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:07:45,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:07:45,877 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-09-10 02:07:45,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:45,892 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-09-10 02:07:45,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:07:45,894 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-10 02:07:45,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:45,901 INFO L225 Difference]: With dead ends: 19 [2019-09-10 02:07:45,901 INFO L226 Difference]: Without dead ends: 12 [2019-09-10 02:07:45,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:07:45,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-10 02:07:45,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-10 02:07:45,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-10 02:07:45,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-09-10 02:07:45,934 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-09-10 02:07:45,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:45,934 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-09-10 02:07:45,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:07:45,935 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-09-10 02:07:45,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 02:07:45,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:45,935 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:45,936 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:45,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:45,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1703094711, now seen corresponding path program 1 times [2019-09-10 02:07:45,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:45,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:45,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:45,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:45,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:46,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:46,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:07:46,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:07:46,004 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:07:46,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:07:46,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:07:46,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:07:46,006 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2019-09-10 02:07:46,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:46,067 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-09-10 02:07:46,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:07:46,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-10 02:07:46,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:46,069 INFO L225 Difference]: With dead ends: 14 [2019-09-10 02:07:46,069 INFO L226 Difference]: Without dead ends: 14 [2019-09-10 02:07:46,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:07:46,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-10 02:07:46,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-10 02:07:46,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-10 02:07:46,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-09-10 02:07:46,075 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-09-10 02:07:46,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:46,075 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-09-10 02:07:46,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:07:46,076 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-09-10 02:07:46,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-10 02:07:46,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:46,077 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:46,077 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:46,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:46,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1337256884, now seen corresponding path program 1 times [2019-09-10 02:07:46,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:46,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:46,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:46,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:46,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:46,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:46,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:46,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:46,113 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2019-09-10 02:07:46,114 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [26], [29], [31], [37], [38], [39], [41] [2019-09-10 02:07:46,149 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:07:46,149 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:07:46,242 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 02:07:46,245 INFO L272 AbstractInterpreter]: Visited 8 different actions 23 times. Merged at 2 different actions 10 times. Widened at 1 different actions 1 times. Performed 42 root evaluator evaluations with a maximum evaluation depth of 4. Performed 42 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2019-09-10 02:07:46,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:46,249 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 02:07:46,281 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 02:07:46,281 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 02:07:46,295 INFO L420 sIntCurrentIteration]: We unified 11 AI predicates to 11 [2019-09-10 02:07:46,295 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 02:07:46,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:07:46,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-10 02:07:46,297 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:07:46,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:07:46,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:07:46,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:07:46,299 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 3 states. [2019-09-10 02:07:46,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:46,332 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2019-09-10 02:07:46,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:07:46,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-09-10 02:07:46,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:46,333 INFO L225 Difference]: With dead ends: 16 [2019-09-10 02:07:46,333 INFO L226 Difference]: Without dead ends: 16 [2019-09-10 02:07:46,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:07:46,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-10 02:07:46,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-10 02:07:46,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-10 02:07:46,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-09-10 02:07:46,338 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2019-09-10 02:07:46,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:46,338 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-09-10 02:07:46,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:07:46,338 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-09-10 02:07:46,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-10 02:07:46,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:46,339 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:46,340 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:46,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:46,340 INFO L82 PathProgramCache]: Analyzing trace with hash 2011681711, now seen corresponding path program 1 times [2019-09-10 02:07:46,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:46,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:46,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:46,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:46,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:46,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:46,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:46,386 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:46,387 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2019-09-10 02:07:46,387 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [18], [26], [29], [31], [37], [38], [39], [41] [2019-09-10 02:07:46,389 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:07:46,389 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:07:46,423 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:07:46,423 INFO L272 AbstractInterpreter]: Visited 13 different actions 45 times. Merged at 4 different actions 15 times. Widened at 2 different actions 3 times. Performed 84 root evaluator evaluations with a maximum evaluation depth of 4. Performed 84 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 4 fixpoints after 2 different actions. Largest state had 2 variables. [2019-09-10 02:07:46,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:46,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:07:46,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:46,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:46,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:46,447 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:07:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:46,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-10 02:07:46,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:46,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:46,490 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:46,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:46,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:46,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-10 02:07:46,538 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:46,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:07:46,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:07:46,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:07:46,540 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 4 states. [2019-09-10 02:07:46,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:46,570 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-09-10 02:07:46,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:07:46,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-09-10 02:07:46,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:46,571 INFO L225 Difference]: With dead ends: 18 [2019-09-10 02:07:46,572 INFO L226 Difference]: Without dead ends: 18 [2019-09-10 02:07:46,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:07:46,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-10 02:07:46,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-10 02:07:46,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-10 02:07:46,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-09-10 02:07:46,576 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2019-09-10 02:07:46,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:46,576 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-09-10 02:07:46,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:07:46,577 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-09-10 02:07:46,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-10 02:07:46,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:46,577 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:46,578 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:46,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:46,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1891741908, now seen corresponding path program 2 times [2019-09-10 02:07:46,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:46,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:46,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:46,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:46,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:46,635 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:46,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:46,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:46,636 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:46,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:46,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:46,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:07:46,656 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:07:46,656 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:46,678 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-10 02:07:46,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:46,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 02:07:46,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:46,728 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:46,728 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:46,778 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:46,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:46,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2019-09-10 02:07:46,783 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:46,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:07:46,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:07:46,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:07:46,784 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 8 states. [2019-09-10 02:07:46,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:46,856 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2019-09-10 02:07:46,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:07:46,857 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-09-10 02:07:46,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:46,864 INFO L225 Difference]: With dead ends: 26 [2019-09-10 02:07:46,865 INFO L226 Difference]: Without dead ends: 26 [2019-09-10 02:07:46,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:07:46,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-10 02:07:46,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2019-09-10 02:07:46,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-10 02:07:46,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-09-10 02:07:46,879 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 16 [2019-09-10 02:07:46,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:46,879 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-09-10 02:07:46,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:07:46,880 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-09-10 02:07:46,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 02:07:46,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:46,884 INFO L399 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:46,884 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:46,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:46,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1567930911, now seen corresponding path program 3 times [2019-09-10 02:07:46,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:46,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:46,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:46,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:46,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:46,984 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:07:46,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:46,985 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:46,985 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:46,985 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:46,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:46,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:07:47,000 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:07:47,000 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:47,041 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:07:47,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:47,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 02:07:47,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:47,059 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:07:47,060 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:47,119 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:07:47,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:47,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2019-09-10 02:07:47,123 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:47,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:07:47,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:07:47,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:07:47,125 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 6 states. [2019-09-10 02:07:47,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:47,152 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-09-10 02:07:47,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:07:47,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-09-10 02:07:47,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:47,153 INFO L225 Difference]: With dead ends: 25 [2019-09-10 02:07:47,153 INFO L226 Difference]: Without dead ends: 25 [2019-09-10 02:07:47,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:07:47,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-10 02:07:47,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-10 02:07:47,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-10 02:07:47,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-09-10 02:07:47,158 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 22 [2019-09-10 02:07:47,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:47,158 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-09-10 02:07:47,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:07:47,158 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-09-10 02:07:47,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-10 02:07:47,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:47,159 INFO L399 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:47,160 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:47,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:47,160 INFO L82 PathProgramCache]: Analyzing trace with hash 92956828, now seen corresponding path program 4 times [2019-09-10 02:07:47,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:47,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:47,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:47,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:47,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:47,223 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:07:47,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:47,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:47,224 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:47,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:47,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:47,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:47,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:47,243 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:07:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:47,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 02:07:47,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:47,277 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:07:47,277 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:47,349 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:07:47,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:47,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2019-09-10 02:07:47,354 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:47,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:07:47,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:07:47,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:07:47,356 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 7 states. [2019-09-10 02:07:47,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:47,393 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-09-10 02:07:47,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:07:47,394 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-09-10 02:07:47,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:47,395 INFO L225 Difference]: With dead ends: 27 [2019-09-10 02:07:47,395 INFO L226 Difference]: Without dead ends: 27 [2019-09-10 02:07:47,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:07:47,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-10 02:07:47,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-10 02:07:47,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-10 02:07:47,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-09-10 02:07:47,400 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 24 [2019-09-10 02:07:47,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:47,400 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-09-10 02:07:47,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:07:47,401 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-09-10 02:07:47,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-10 02:07:47,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:47,402 INFO L399 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:47,402 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:47,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:47,402 INFO L82 PathProgramCache]: Analyzing trace with hash -17929255, now seen corresponding path program 5 times [2019-09-10 02:07:47,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:47,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:47,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:47,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:47,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:47,477 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:07:47,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:47,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:47,479 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:47,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:47,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:47,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:07:47,494 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:07:47,494 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:47,513 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-10 02:07:47,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:47,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 02:07:47,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:47,566 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 02:07:47,567 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:47,641 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 02:07:47,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:47,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2019-09-10 02:07:47,646 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:47,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:07:47,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:07:47,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:07:47,648 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 12 states. [2019-09-10 02:07:47,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:47,730 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2019-09-10 02:07:47,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:07:47,730 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-09-10 02:07:47,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:47,731 INFO L225 Difference]: With dead ends: 32 [2019-09-10 02:07:47,731 INFO L226 Difference]: Without dead ends: 32 [2019-09-10 02:07:47,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:07:47,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-10 02:07:47,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-10 02:07:47,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-10 02:07:47,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-09-10 02:07:47,736 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 26 [2019-09-10 02:07:47,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:47,736 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-09-10 02:07:47,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:07:47,737 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-09-10 02:07:47,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-10 02:07:47,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:47,738 INFO L399 BasicCegarLoop]: trace histogram [10, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:47,738 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:47,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:47,738 INFO L82 PathProgramCache]: Analyzing trace with hash 331873105, now seen corresponding path program 6 times [2019-09-10 02:07:47,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:47,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:47,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:47,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:47,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:47,827 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 02:07:47,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:47,827 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:47,828 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:47,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:47,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:47,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:47,841 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:07:47,842 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:07:47,861 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:07:47,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:47,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 02:07:47,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:47,872 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 02:07:47,873 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:47,980 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 02:07:47,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:47,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2019-09-10 02:07:47,984 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:47,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:07:47,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:07:47,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:07:47,987 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 9 states. [2019-09-10 02:07:48,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:48,032 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-09-10 02:07:48,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:07:48,033 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-09-10 02:07:48,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:48,034 INFO L225 Difference]: With dead ends: 33 [2019-09-10 02:07:48,034 INFO L226 Difference]: Without dead ends: 33 [2019-09-10 02:07:48,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:07:48,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-10 02:07:48,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-10 02:07:48,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-10 02:07:48,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-10 02:07:48,040 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 30 [2019-09-10 02:07:48,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:48,040 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-10 02:07:48,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:07:48,040 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-10 02:07:48,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-10 02:07:48,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:48,042 INFO L399 BasicCegarLoop]: trace histogram [11, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:48,042 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:48,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:48,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1078338354, now seen corresponding path program 7 times [2019-09-10 02:07:48,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:48,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:48,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:48,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:48,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:48,160 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 02:07:48,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:48,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:48,161 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:48,161 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:48,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:48,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:07:48,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:48,176 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:48,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-10 02:07:48,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:48,198 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 02:07:48,198 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:48,341 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 02:07:48,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:48,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2019-09-10 02:07:48,345 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:48,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:07:48,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:07:48,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:07:48,347 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 10 states. [2019-09-10 02:07:48,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:48,393 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-09-10 02:07:48,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:07:48,394 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-09-10 02:07:48,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:48,395 INFO L225 Difference]: With dead ends: 35 [2019-09-10 02:07:48,395 INFO L226 Difference]: Without dead ends: 35 [2019-09-10 02:07:48,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:07:48,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-10 02:07:48,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-10 02:07:48,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-10 02:07:48,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-10 02:07:48,403 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 32 [2019-09-10 02:07:48,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:48,404 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-10 02:07:48,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:07:48,404 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-10 02:07:48,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-10 02:07:48,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:48,408 INFO L399 BasicCegarLoop]: trace histogram [12, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:48,408 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:48,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:48,408 INFO L82 PathProgramCache]: Analyzing trace with hash 918115083, now seen corresponding path program 8 times [2019-09-10 02:07:48,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:48,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:48,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:48,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:48,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:48,527 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 63 proven. 72 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 02:07:48,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:48,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:48,528 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:48,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:48,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:48,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:48,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:07:48,553 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:07:48,568 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-10 02:07:48,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:48,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 02:07:48,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:48,648 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-10 02:07:48,648 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:48,736 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-10 02:07:48,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:48,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 21 [2019-09-10 02:07:48,741 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:48,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 02:07:48,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 02:07:48,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-10 02:07:48,742 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 16 states. [2019-09-10 02:07:48,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:48,835 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2019-09-10 02:07:48,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 02:07:48,835 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2019-09-10 02:07:48,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:48,836 INFO L225 Difference]: With dead ends: 40 [2019-09-10 02:07:48,836 INFO L226 Difference]: Without dead ends: 40 [2019-09-10 02:07:48,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-10 02:07:48,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-10 02:07:48,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-09-10 02:07:48,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-10 02:07:48,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2019-09-10 02:07:48,841 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 34 [2019-09-10 02:07:48,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:48,842 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-09-10 02:07:48,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 02:07:48,842 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2019-09-10 02:07:48,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-10 02:07:48,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:48,843 INFO L399 BasicCegarLoop]: trace histogram [14, 9, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:48,843 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:48,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:48,844 INFO L82 PathProgramCache]: Analyzing trace with hash 287297795, now seen corresponding path program 9 times [2019-09-10 02:07:48,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:48,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:48,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:48,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:48,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:48,965 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 02:07:48,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:48,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:48,967 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:48,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:48,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:48,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:48,978 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:07:48,979 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:07:48,996 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:07:48,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:48,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-10 02:07:49,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:49,008 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 02:07:49,008 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:49,213 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 02:07:49,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:49,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2019-09-10 02:07:49,217 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:49,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:07:49,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:07:49,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-10 02:07:49,219 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 12 states. [2019-09-10 02:07:49,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:49,262 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2019-09-10 02:07:49,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:07:49,263 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-09-10 02:07:49,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:49,264 INFO L225 Difference]: With dead ends: 41 [2019-09-10 02:07:49,264 INFO L226 Difference]: Without dead ends: 41 [2019-09-10 02:07:49,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-10 02:07:49,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-10 02:07:49,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-10 02:07:49,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-10 02:07:49,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2019-09-10 02:07:49,268 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 38 [2019-09-10 02:07:49,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:49,269 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2019-09-10 02:07:49,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:07:49,269 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2019-09-10 02:07:49,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-10 02:07:49,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:49,270 INFO L399 BasicCegarLoop]: trace histogram [15, 10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:49,270 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:49,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:49,271 INFO L82 PathProgramCache]: Analyzing trace with hash -955587200, now seen corresponding path program 10 times [2019-09-10 02:07:49,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:49,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:49,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:49,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:49,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:49,363 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 02:07:49,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:49,364 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:49,364 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:49,364 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:49,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:49,364 INFO 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-10 02:07:49,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:49,381 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-10 02:07:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:49,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 02:07:49,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:49,406 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 02:07:49,406 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:49,603 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 02:07:49,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:49,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2019-09-10 02:07:49,607 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:49,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 02:07:49,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 02:07:49,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-10 02:07:49,608 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 13 states. [2019-09-10 02:07:49,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:49,662 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-09-10 02:07:49,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 02:07:49,663 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-09-10 02:07:49,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:49,664 INFO L225 Difference]: With dead ends: 43 [2019-09-10 02:07:49,665 INFO L226 Difference]: Without dead ends: 43 [2019-09-10 02:07:49,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-10 02:07:49,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-10 02:07:49,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-10 02:07:49,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-10 02:07:49,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-09-10 02:07:49,669 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 40 [2019-09-10 02:07:49,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:49,670 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-09-10 02:07:49,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 02:07:49,670 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2019-09-10 02:07:49,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-10 02:07:49,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:49,671 INFO L399 BasicCegarLoop]: trace histogram [16, 11, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:49,671 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:49,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:49,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1367159107, now seen corresponding path program 11 times [2019-09-10 02:07:49,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:49,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:49,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:49,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:49,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:49,796 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 108 proven. 132 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 02:07:49,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:49,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:49,797 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:49,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:49,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:49,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:07:49,820 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:07:49,821 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:49,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-10 02:07:49,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:49,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 02:07:49,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:49,954 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 121 proven. 25 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-10 02:07:49,954 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:50,085 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 121 proven. 25 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:07:50,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:50,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 26 [2019-09-10 02:07:50,090 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:50,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 02:07:50,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 02:07:50,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-10 02:07:50,091 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 20 states. [2019-09-10 02:07:50,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:50,193 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2019-09-10 02:07:50,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 02:07:50,194 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2019-09-10 02:07:50,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:50,195 INFO L225 Difference]: With dead ends: 48 [2019-09-10 02:07:50,195 INFO L226 Difference]: Without dead ends: 48 [2019-09-10 02:07:50,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-10 02:07:50,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-10 02:07:50,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-09-10 02:07:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-10 02:07:50,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2019-09-10 02:07:50,199 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 42 [2019-09-10 02:07:50,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:50,200 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2019-09-10 02:07:50,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 02:07:50,200 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2019-09-10 02:07:50,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-10 02:07:50,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:50,201 INFO L399 BasicCegarLoop]: trace histogram [18, 12, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:50,201 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:50,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:50,201 INFO L82 PathProgramCache]: Analyzing trace with hash -2055201995, now seen corresponding path program 12 times [2019-09-10 02:07:50,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:50,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:50,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:50,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:50,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:50,312 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 02:07:50,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:50,313 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:50,313 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:50,313 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:50,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:50,313 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:50,324 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:07:50,324 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:07:50,342 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:07:50,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:50,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 02:07:50,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:50,352 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 02:07:50,353 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:50,596 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 02:07:50,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:50,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2019-09-10 02:07:50,600 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:50,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 02:07:50,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 02:07:50,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-10 02:07:50,601 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 15 states. [2019-09-10 02:07:50,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:50,654 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2019-09-10 02:07:50,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 02:07:50,654 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2019-09-10 02:07:50,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:50,656 INFO L225 Difference]: With dead ends: 49 [2019-09-10 02:07:50,656 INFO L226 Difference]: Without dead ends: 49 [2019-09-10 02:07:50,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-10 02:07:50,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-10 02:07:50,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-09-10 02:07:50,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-10 02:07:50,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2019-09-10 02:07:50,662 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 46 [2019-09-10 02:07:50,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:50,662 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2019-09-10 02:07:50,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 02:07:50,662 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2019-09-10 02:07:50,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-10 02:07:50,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:50,663 INFO L399 BasicCegarLoop]: trace histogram [19, 13, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:50,664 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:50,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:50,664 INFO L82 PathProgramCache]: Analyzing trace with hash -561945934, now seen corresponding path program 13 times [2019-09-10 02:07:50,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:50,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:50,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:50,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:50,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:50,806 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 02:07:50,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:50,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:50,807 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:50,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:50,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:50,808 INFO 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-10 02:07:50,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:50,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:50,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-10 02:07:50,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:50,853 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 02:07:50,853 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:51,195 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 02:07:51,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:51,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2019-09-10 02:07:51,199 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:51,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 02:07:51,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 02:07:51,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-10 02:07:51,200 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 16 states. [2019-09-10 02:07:51,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:51,262 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2019-09-10 02:07:51,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 02:07:51,262 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 48 [2019-09-10 02:07:51,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:51,263 INFO L225 Difference]: With dead ends: 51 [2019-09-10 02:07:51,263 INFO L226 Difference]: Without dead ends: 51 [2019-09-10 02:07:51,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-10 02:07:51,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-10 02:07:51,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-09-10 02:07:51,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-10 02:07:51,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2019-09-10 02:07:51,268 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 48 [2019-09-10 02:07:51,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:51,268 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2019-09-10 02:07:51,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 02:07:51,268 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2019-09-10 02:07:51,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-10 02:07:51,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:51,269 INFO L399 BasicCegarLoop]: trace histogram [20, 14, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:51,269 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:51,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:51,270 INFO L82 PathProgramCache]: Analyzing trace with hash -61948177, now seen corresponding path program 14 times [2019-09-10 02:07:51,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:51,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:51,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:51,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:51,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:51,403 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 165 proven. 210 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 02:07:51,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:51,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:51,404 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:51,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:51,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:51,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:51,415 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:07:51,415 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:07:51,443 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-10 02:07:51,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:51,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-10 02:07:51,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:51,619 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 182 proven. 36 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-09-10 02:07:51,619 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:51,765 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 182 proven. 36 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-09-10 02:07:51,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:51,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9, 9] total 31 [2019-09-10 02:07:51,769 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:51,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 02:07:51,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 02:07:51,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-10 02:07:51,770 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 24 states. [2019-09-10 02:07:51,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:51,888 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2019-09-10 02:07:51,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 02:07:51,888 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-09-10 02:07:51,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:51,889 INFO L225 Difference]: With dead ends: 56 [2019-09-10 02:07:51,889 INFO L226 Difference]: Without dead ends: 56 [2019-09-10 02:07:51,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-10 02:07:51,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-10 02:07:51,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-09-10 02:07:51,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-10 02:07:51,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2019-09-10 02:07:51,895 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 50 [2019-09-10 02:07:51,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:51,895 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2019-09-10 02:07:51,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 02:07:51,895 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2019-09-10 02:07:51,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 02:07:51,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:51,896 INFO L399 BasicCegarLoop]: trace histogram [22, 15, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:51,896 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:51,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:51,897 INFO L82 PathProgramCache]: Analyzing trace with hash -395003417, now seen corresponding path program 15 times [2019-09-10 02:07:51,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:51,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:51,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:51,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:51,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:52,042 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:07:52,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:52,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:52,043 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:52,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:52,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:52,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:52,053 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:07:52,053 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:07:52,069 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:07:52,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:52,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 02:07:52,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:52,078 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:07:52,078 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:52,465 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:07:52,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:52,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2019-09-10 02:07:52,470 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:52,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 02:07:52,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 02:07:52,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 02:07:52,472 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 18 states. [2019-09-10 02:07:52,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:52,546 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2019-09-10 02:07:52,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 02:07:52,546 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2019-09-10 02:07:52,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:52,547 INFO L225 Difference]: With dead ends: 57 [2019-09-10 02:07:52,547 INFO L226 Difference]: Without dead ends: 57 [2019-09-10 02:07:52,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 02:07:52,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-10 02:07:52,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-09-10 02:07:52,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-10 02:07:52,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2019-09-10 02:07:52,556 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 54 [2019-09-10 02:07:52,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:52,557 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2019-09-10 02:07:52,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 02:07:52,558 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2019-09-10 02:07:52,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 02:07:52,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:52,559 INFO L399 BasicCegarLoop]: trace histogram [23, 16, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:52,560 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:52,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:52,560 INFO L82 PathProgramCache]: Analyzing trace with hash 279524452, now seen corresponding path program 16 times [2019-09-10 02:07:52,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:52,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:52,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:52,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:52,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:52,830 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:07:52,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:52,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:52,831 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:52,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:52,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:52,831 INFO 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) [2019-09-10 02:07:52,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:52,857 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:52,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 02:07:52,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:52,898 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:07:52,898 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:53,611 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:07:53,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:53,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2019-09-10 02:07:53,615 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:53,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 02:07:53,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 02:07:53,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 02:07:53,616 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 19 states. [2019-09-10 02:07:53,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:53,664 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2019-09-10 02:07:53,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 02:07:53,665 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2019-09-10 02:07:53,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:53,666 INFO L225 Difference]: With dead ends: 59 [2019-09-10 02:07:53,666 INFO L226 Difference]: Without dead ends: 59 [2019-09-10 02:07:53,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 02:07:53,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-10 02:07:53,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-09-10 02:07:53,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-10 02:07:53,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2019-09-10 02:07:53,671 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 56 [2019-09-10 02:07:53,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:53,671 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2019-09-10 02:07:53,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 02:07:53,671 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2019-09-10 02:07:53,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 02:07:53,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:53,672 INFO L399 BasicCegarLoop]: trace histogram [24, 17, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:53,672 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:53,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:53,673 INFO L82 PathProgramCache]: Analyzing trace with hash -39255135, now seen corresponding path program 17 times [2019-09-10 02:07:53,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:53,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:53,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:53,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:53,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:53,878 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 234 proven. 306 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:07:53,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:53,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:53,879 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:53,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:53,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:53,879 INFO 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) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:53,889 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:07:53,890 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:07:53,910 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-10 02:07:53,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:53,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 02:07:53,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:54,110 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 255 proven. 49 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-09-10 02:07:54,111 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:54,358 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 255 proven. 49 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-09-10 02:07:54,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:54,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 10] total 36 [2019-09-10 02:07:54,362 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:54,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 02:07:54,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 02:07:54,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 02:07:54,363 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 28 states. [2019-09-10 02:07:54,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:54,464 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2019-09-10 02:07:54,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 02:07:54,464 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 58 [2019-09-10 02:07:54,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:54,465 INFO L225 Difference]: With dead ends: 64 [2019-09-10 02:07:54,465 INFO L226 Difference]: Without dead ends: 64 [2019-09-10 02:07:54,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 02:07:54,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-10 02:07:54,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-09-10 02:07:54,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-10 02:07:54,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2019-09-10 02:07:54,473 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 58 [2019-09-10 02:07:54,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:54,475 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2019-09-10 02:07:54,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 02:07:54,475 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2019-09-10 02:07:54,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 02:07:54,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:54,476 INFO L399 BasicCegarLoop]: trace histogram [26, 18, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:54,476 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:54,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:54,477 INFO L82 PathProgramCache]: Analyzing trace with hash 923897113, now seen corresponding path program 18 times [2019-09-10 02:07:54,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:54,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:54,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:54,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:54,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:54,688 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-10 02:07:54,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:54,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:54,689 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:54,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:54,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:54,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:54,699 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:07:54,699 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:07:54,721 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:07:54,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:54,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 02:07:54,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:54,733 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-10 02:07:54,733 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:55,203 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-10 02:07:55,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:55,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2019-09-10 02:07:55,206 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:55,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 02:07:55,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 02:07:55,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 02:07:55,208 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 21 states. [2019-09-10 02:07:55,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:55,266 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2019-09-10 02:07:55,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 02:07:55,266 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2019-09-10 02:07:55,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:55,267 INFO L225 Difference]: With dead ends: 65 [2019-09-10 02:07:55,267 INFO L226 Difference]: Without dead ends: 65 [2019-09-10 02:07:55,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 02:07:55,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-10 02:07:55,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-09-10 02:07:55,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-10 02:07:55,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2019-09-10 02:07:55,271 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 62 [2019-09-10 02:07:55,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:55,271 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2019-09-10 02:07:55,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 02:07:55,271 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2019-09-10 02:07:55,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 02:07:55,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:55,272 INFO L399 BasicCegarLoop]: trace histogram [27, 19, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:55,272 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:55,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:55,273 INFO L82 PathProgramCache]: Analyzing trace with hash -308921706, now seen corresponding path program 19 times [2019-09-10 02:07:55,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:55,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:55,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:55,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:55,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:55,496 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-10 02:07:55,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:55,496 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:55,496 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:55,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:55,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:55,496 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:55,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:55,507 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:07:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:55,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 02:07:55,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:55,537 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-10 02:07:55,537 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-10 02:07:55,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:55,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2019-09-10 02:07:55,989 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:55,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 02:07:55,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 02:07:55,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 02:07:55,991 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 22 states. [2019-09-10 02:07:56,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:56,077 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2019-09-10 02:07:56,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 02:07:56,081 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 64 [2019-09-10 02:07:56,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:56,082 INFO L225 Difference]: With dead ends: 67 [2019-09-10 02:07:56,082 INFO L226 Difference]: Without dead ends: 67 [2019-09-10 02:07:56,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 02:07:56,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-10 02:07:56,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-09-10 02:07:56,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-10 02:07:56,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2019-09-10 02:07:56,086 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 64 [2019-09-10 02:07:56,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:56,086 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2019-09-10 02:07:56,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 02:07:56,087 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2019-09-10 02:07:56,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 02:07:56,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:56,087 INFO L399 BasicCegarLoop]: trace histogram [28, 20, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:56,088 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:56,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:56,088 INFO L82 PathProgramCache]: Analyzing trace with hash 363166931, now seen corresponding path program 20 times [2019-09-10 02:07:56,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:56,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:56,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:56,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:56,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:56,330 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 315 proven. 420 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-10 02:07:56,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:56,330 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:56,330 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:56,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:56,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:56,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10 02:07:56,348 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:07:56,348 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:07:56,370 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-10 02:07:56,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:56,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-10 02:07:56,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:56,549 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 340 proven. 64 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-09-10 02:07:56,549 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:56,791 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 340 proven. 64 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-09-10 02:07:56,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:56,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 11, 11] total 41 [2019-09-10 02:07:56,794 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:56,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 02:07:56,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 02:07:56,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 02:07:56,796 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand 32 states. [2019-09-10 02:07:56,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:56,892 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2019-09-10 02:07:56,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 02:07:56,892 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 66 [2019-09-10 02:07:56,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:56,893 INFO L225 Difference]: With dead ends: 72 [2019-09-10 02:07:56,893 INFO L226 Difference]: Without dead ends: 72 [2019-09-10 02:07:56,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 02:07:56,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-10 02:07:56,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-09-10 02:07:56,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-10 02:07:56,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2019-09-10 02:07:56,901 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 66 [2019-09-10 02:07:56,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:56,901 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2019-09-10 02:07:56,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 02:07:56,901 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2019-09-10 02:07:56,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 02:07:56,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:56,907 INFO L399 BasicCegarLoop]: trace histogram [30, 21, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:56,908 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:56,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:56,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1309510453, now seen corresponding path program 21 times [2019-09-10 02:07:56,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:56,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:56,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:56,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:56,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:57,171 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-10 02:07:57,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:57,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:57,171 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:57,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:57,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:57,172 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:57,182 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:07:57,183 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:07:57,203 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:07:57,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:57,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-10 02:07:57,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:57,218 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-10 02:07:57,219 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:57,747 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-10 02:07:57,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:57,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 46 [2019-09-10 02:07:57,751 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:57,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 02:07:57,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 02:07:57,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 02:07:57,753 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand 24 states. [2019-09-10 02:07:57,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:57,852 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2019-09-10 02:07:57,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 02:07:57,852 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 70 [2019-09-10 02:07:57,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:57,853 INFO L225 Difference]: With dead ends: 73 [2019-09-10 02:07:57,853 INFO L226 Difference]: Without dead ends: 73 [2019-09-10 02:07:57,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 02:07:57,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-10 02:07:57,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-09-10 02:07:57,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-10 02:07:57,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2019-09-10 02:07:57,858 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 70 [2019-09-10 02:07:57,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:57,858 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2019-09-10 02:07:57,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 02:07:57,858 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2019-09-10 02:07:57,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 02:07:57,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:57,859 INFO L399 BasicCegarLoop]: trace histogram [31, 22, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:57,860 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:57,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:57,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1222923592, now seen corresponding path program 22 times [2019-09-10 02:07:57,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:57,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:57,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:57,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:57,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:58,109 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-10 02:07:58,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:58,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:58,110 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:58,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:58,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:58,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:58,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:58,124 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:07:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:58,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 02:07:58,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:58,155 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-10 02:07:58,155 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:58,748 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (23)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:07:58,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:58,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2019-09-10 02:07:58,753 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:58,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 02:07:58,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 02:07:58,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 02:07:58,755 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand 25 states. [2019-09-10 02:07:58,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:58,860 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2019-09-10 02:07:58,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 02:07:58,861 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 72 [2019-09-10 02:07:58,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:58,862 INFO L225 Difference]: With dead ends: 75 [2019-09-10 02:07:58,863 INFO L226 Difference]: Without dead ends: 75 [2019-09-10 02:07:58,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 02:07:58,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-10 02:07:58,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-09-10 02:07:58,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-10 02:07:58,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2019-09-10 02:07:58,866 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 72 [2019-09-10 02:07:58,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:58,866 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2019-09-10 02:07:58,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 02:07:58,866 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2019-09-10 02:07:58,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 02:07:58,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:58,867 INFO L399 BasicCegarLoop]: trace histogram [32, 23, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:58,867 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:58,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:58,868 INFO L82 PathProgramCache]: Analyzing trace with hash -354415995, now seen corresponding path program 23 times [2019-09-10 02:07:58,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:58,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:58,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:58,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:58,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:58,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:59,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 408 proven. 552 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-10 02:07:59,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:59,120 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:59,120 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:59,120 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:59,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:59,121 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:59,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:07:59,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:07:59,155 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-10 02:07:59,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:59,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 02:07:59,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:59,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 437 proven. 81 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-09-10 02:07:59,359 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:59,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 437 proven. 81 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-09-10 02:07:59,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:59,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 12, 12] total 46 [2019-09-10 02:07:59,633 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:59,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 02:07:59,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 02:07:59,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 02:07:59,636 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand 36 states. [2019-09-10 02:07:59,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:59,826 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2019-09-10 02:07:59,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 02:07:59,826 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 74 [2019-09-10 02:07:59,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:59,827 INFO L225 Difference]: With dead ends: 80 [2019-09-10 02:07:59,827 INFO L226 Difference]: Without dead ends: 80 [2019-09-10 02:07:59,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 02:07:59,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-10 02:07:59,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-09-10 02:07:59,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-10 02:07:59,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2019-09-10 02:07:59,831 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 74 [2019-09-10 02:07:59,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:59,832 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2019-09-10 02:07:59,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-10 02:07:59,832 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2019-09-10 02:07:59,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 02:07:59,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:59,833 INFO L399 BasicCegarLoop]: trace histogram [34, 24, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:59,833 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:59,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:59,833 INFO L82 PathProgramCache]: Analyzing trace with hash 456872189, now seen corresponding path program 24 times [2019-09-10 02:07:59,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:59,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:59,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:59,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:59,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:00,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-10 02:08:00,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:00,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:00,136 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:00,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:00,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:00,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:00,158 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:00,158 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:08:00,182 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:00,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:00,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-10 02:08:00,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:00,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-10 02:08:00,196 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:00,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-10 02:08:00,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:00,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 52 [2019-09-10 02:08:00,878 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:00,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 02:08:00,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 02:08:00,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:00,880 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 27 states. [2019-09-10 02:08:00,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:00,978 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2019-09-10 02:08:00,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 02:08:00,979 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 78 [2019-09-10 02:08:00,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:00,980 INFO L225 Difference]: With dead ends: 81 [2019-09-10 02:08:00,980 INFO L226 Difference]: Without dead ends: 81 [2019-09-10 02:08:00,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:00,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-10 02:08:00,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-09-10 02:08:00,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-10 02:08:00,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2019-09-10 02:08:00,985 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 78 [2019-09-10 02:08:00,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:00,985 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2019-09-10 02:08:00,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 02:08:00,985 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2019-09-10 02:08:00,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 02:08:00,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:00,986 INFO L399 BasicCegarLoop]: trace histogram [35, 25, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:00,986 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:00,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:00,986 INFO L82 PathProgramCache]: Analyzing trace with hash 2008507514, now seen corresponding path program 25 times [2019-09-10 02:08:00,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:00,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:00,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:00,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:00,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:01,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-10 02:08:01,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:01,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:01,279 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:01,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:01,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:01,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:01,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:01,295 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:08:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:01,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-10 02:08:01,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:01,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-10 02:08:01,330 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:02,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-10 02:08:02,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:02,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 52 [2019-09-10 02:08:02,062 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:02,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 02:08:02,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 02:08:02,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:02,064 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 28 states. [2019-09-10 02:08:02,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:02,171 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2019-09-10 02:08:02,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 02:08:02,172 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 80 [2019-09-10 02:08:02,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:02,173 INFO L225 Difference]: With dead ends: 83 [2019-09-10 02:08:02,173 INFO L226 Difference]: Without dead ends: 83 [2019-09-10 02:08:02,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:02,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-10 02:08:02,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-09-10 02:08:02,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-10 02:08:02,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2019-09-10 02:08:02,177 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 80 [2019-09-10 02:08:02,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:02,177 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2019-09-10 02:08:02,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 02:08:02,177 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2019-09-10 02:08:02,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 02:08:02,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:02,178 INFO L399 BasicCegarLoop]: trace histogram [36, 26, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:02,178 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:02,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:02,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1518564169, now seen corresponding path program 26 times [2019-09-10 02:08:02,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:02,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:02,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:02,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:02,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:02,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 513 proven. 702 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-10 02:08:02,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:02,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:02,610 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:02,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:02,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:02,610 INFO 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-10 02:08:02,635 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:08:02,635 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:02,668 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-10 02:08:02,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:02,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 02:08:02,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:03,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 546 proven. 100 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2019-09-10 02:08:03,011 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:03,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 546 proven. 100 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2019-09-10 02:08:03,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:03,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 13, 13] total 51 [2019-09-10 02:08:03,621 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:03,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-10 02:08:03,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-10 02:08:03,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 02:08:03,624 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 40 states. [2019-09-10 02:08:03,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:03,787 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2019-09-10 02:08:03,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-10 02:08:03,788 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 82 [2019-09-10 02:08:03,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:03,788 INFO L225 Difference]: With dead ends: 88 [2019-09-10 02:08:03,788 INFO L226 Difference]: Without dead ends: 88 [2019-09-10 02:08:03,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 02:08:03,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-10 02:08:03,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-09-10 02:08:03,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-10 02:08:03,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2019-09-10 02:08:03,792 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 82 [2019-09-10 02:08:03,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:03,793 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2019-09-10 02:08:03,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-10 02:08:03,793 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2019-09-10 02:08:03,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 02:08:03,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:03,794 INFO L399 BasicCegarLoop]: trace histogram [38, 27, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:03,794 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:03,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:03,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1956118959, now seen corresponding path program 27 times [2019-09-10 02:08:03,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:03,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:03,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:03,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:03,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:03,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:04,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-10 02:08:04,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:04,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:04,135 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:04,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:04,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:04,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:04,148 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:04,148 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:08:04,174 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:04,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:04,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-10 02:08:04,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:04,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-10 02:08:04,191 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:05,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (28)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:08:05,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:05,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 52 [2019-09-10 02:08:05,052 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:05,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 02:08:05,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 02:08:05,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:05,055 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand 30 states. [2019-09-10 02:08:05,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:05,155 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2019-09-10 02:08:05,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 02:08:05,155 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 86 [2019-09-10 02:08:05,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:05,157 INFO L225 Difference]: With dead ends: 89 [2019-09-10 02:08:05,157 INFO L226 Difference]: Without dead ends: 89 [2019-09-10 02:08:05,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 145 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:05,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-10 02:08:05,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-09-10 02:08:05,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-10 02:08:05,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2019-09-10 02:08:05,168 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 86 [2019-09-10 02:08:05,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:05,168 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2019-09-10 02:08:05,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 02:08:05,169 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2019-09-10 02:08:05,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 02:08:05,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:05,170 INFO L399 BasicCegarLoop]: trace histogram [39, 28, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:05,171 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:05,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:05,172 INFO L82 PathProgramCache]: Analyzing trace with hash 247154732, now seen corresponding path program 28 times [2019-09-10 02:08:05,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:05,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:05,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:05,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:05,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:05,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-10 02:08:05,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:05,766 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:05,766 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:05,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:05,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:05,766 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:08:05,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:05,780 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:05,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 02:08:05,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:05,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-10 02:08:05,823 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:06,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-10 02:08:06,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:06,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 52 [2019-09-10 02:08:06,552 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:06,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 02:08:06,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 02:08:06,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:06,553 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand 31 states. [2019-09-10 02:08:06,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:06,664 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2019-09-10 02:08:06,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 02:08:06,665 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 88 [2019-09-10 02:08:06,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:06,666 INFO L225 Difference]: With dead ends: 91 [2019-09-10 02:08:06,666 INFO L226 Difference]: Without dead ends: 91 [2019-09-10 02:08:06,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 148 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:06,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-10 02:08:06,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-09-10 02:08:06,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-10 02:08:06,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2019-09-10 02:08:06,670 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 88 [2019-09-10 02:08:06,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:06,671 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2019-09-10 02:08:06,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 02:08:06,671 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2019-09-10 02:08:06,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 02:08:06,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:06,672 INFO L399 BasicCegarLoop]: trace histogram [40, 29, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:06,672 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:06,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:06,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1389960343, now seen corresponding path program 29 times [2019-09-10 02:08:06,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:06,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:06,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:06,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:06,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:07,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 630 proven. 870 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-10 02:08:07,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:07,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:07,094 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:07,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:07,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:07,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:07,104 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:08:07,104 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:08:07,127 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-10 02:08:07,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:07,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 02:08:07,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:07,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 667 proven. 121 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2019-09-10 02:08:07,444 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:07,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 667 proven. 121 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2019-09-10 02:08:07,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:07,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 14, 14] total 56 [2019-09-10 02:08:07,904 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:07,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-10 02:08:07,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-10 02:08:07,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 02:08:07,907 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 44 states. [2019-09-10 02:08:08,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:08,141 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2019-09-10 02:08:08,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-10 02:08:08,141 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 90 [2019-09-10 02:08:08,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:08,142 INFO L225 Difference]: With dead ends: 96 [2019-09-10 02:08:08,143 INFO L226 Difference]: Without dead ends: 96 [2019-09-10 02:08:08,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 02:08:08,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-10 02:08:08,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-09-10 02:08:08,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-10 02:08:08,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2019-09-10 02:08:08,150 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 90 [2019-09-10 02:08:08,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:08,150 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2019-09-10 02:08:08,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-10 02:08:08,150 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2019-09-10 02:08:08,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 02:08:08,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:08,151 INFO L399 BasicCegarLoop]: trace histogram [42, 30, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:08,151 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:08,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:08,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1027368673, now seen corresponding path program 30 times [2019-09-10 02:08:08,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:08,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:08,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:08,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:08,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:08,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:08:08,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:08,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:08,601 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:08,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:08,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:08,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:08,610 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:08,611 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:08:08,641 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:08,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:08,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 02:08:08,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:08,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:08:08,656 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:09,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:08:09,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:09,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 52 [2019-09-10 02:08:09,409 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:09,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-10 02:08:09,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-10 02:08:09,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:09,410 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 33 states. [2019-09-10 02:08:09,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:09,516 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2019-09-10 02:08:09,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 02:08:09,516 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 94 [2019-09-10 02:08:09,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:09,517 INFO L225 Difference]: With dead ends: 97 [2019-09-10 02:08:09,517 INFO L226 Difference]: Without dead ends: 97 [2019-09-10 02:08:09,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 158 SyntacticMatches, 12 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:09,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-10 02:08:09,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-09-10 02:08:09,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-10 02:08:09,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2019-09-10 02:08:09,521 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 94 [2019-09-10 02:08:09,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:09,521 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2019-09-10 02:08:09,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-10 02:08:09,521 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2019-09-10 02:08:09,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 02:08:09,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:09,522 INFO L399 BasicCegarLoop]: trace histogram [43, 31, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:09,522 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:09,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:09,523 INFO L82 PathProgramCache]: Analyzing trace with hash 539222110, now seen corresponding path program 31 times [2019-09-10 02:08:09,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:09,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:09,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:09,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:09,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:09,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:08:09,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:09,946 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:09,946 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:09,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:09,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:09,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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:09,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:09,957 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:08:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:09,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-10 02:08:09,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:09,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:08:09,997 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:10,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:08:10,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:10,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 52 [2019-09-10 02:08:10,744 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:10,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-10 02:08:10,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-10 02:08:10,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:10,745 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 34 states. [2019-09-10 02:08:10,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:10,866 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2019-09-10 02:08:10,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 02:08:10,866 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 96 [2019-09-10 02:08:10,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:10,868 INFO L225 Difference]: With dead ends: 99 [2019-09-10 02:08:10,868 INFO L226 Difference]: Without dead ends: 99 [2019-09-10 02:08:10,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 161 SyntacticMatches, 14 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:10,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-10 02:08:10,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-09-10 02:08:10,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-10 02:08:10,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2019-09-10 02:08:10,872 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 96 [2019-09-10 02:08:10,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:10,872 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2019-09-10 02:08:10,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-10 02:08:10,872 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2019-09-10 02:08:10,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 02:08:10,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:10,873 INFO L399 BasicCegarLoop]: trace histogram [44, 32, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:10,873 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:10,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:10,874 INFO L82 PathProgramCache]: Analyzing trace with hash -418189669, now seen corresponding path program 32 times [2019-09-10 02:08:10,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:10,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:10,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:10,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:10,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 759 proven. 1056 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:08:11,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:11,330 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:11,330 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:11,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:11,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:11,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:11,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:08:11,341 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:08:11,368 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-09-10 02:08:11,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:11,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-10 02:08:11,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:11,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 800 proven. 144 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2019-09-10 02:08:11,738 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:12,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 800 proven. 144 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2019-09-10 02:08:12,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:12,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 15, 15] total 61 [2019-09-10 02:08:12,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:12,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-10 02:08:12,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-10 02:08:12,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 02:08:12,239 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 48 states. [2019-09-10 02:08:12,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:12,479 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2019-09-10 02:08:12,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-10 02:08:12,480 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 98 [2019-09-10 02:08:12,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:12,481 INFO L225 Difference]: With dead ends: 104 [2019-09-10 02:08:12,481 INFO L226 Difference]: Without dead ends: 104 [2019-09-10 02:08:12,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 02:08:12,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-10 02:08:12,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-09-10 02:08:12,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-10 02:08:12,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2019-09-10 02:08:12,485 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 98 [2019-09-10 02:08:12,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:12,485 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2019-09-10 02:08:12,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-10 02:08:12,485 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2019-09-10 02:08:12,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 02:08:12,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:12,486 INFO L399 BasicCegarLoop]: trace histogram [46, 33, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:12,486 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:12,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:12,487 INFO L82 PathProgramCache]: Analyzing trace with hash 803496083, now seen corresponding path program 33 times [2019-09-10 02:08:12,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:12,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:12,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:12,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:12,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:12,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:08:12,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:12,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:12,954 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:12,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:12,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:12,955 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:12,965 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:12,965 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:08:12,995 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:12,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:12,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-10 02:08:12,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:13,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:08:13,015 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:13,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:08:13,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:13,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 52 [2019-09-10 02:08:13,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:13,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 02:08:13,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 02:08:13,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:13,827 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 36 states. [2019-09-10 02:08:13,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:13,972 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2019-09-10 02:08:13,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 02:08:13,973 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 102 [2019-09-10 02:08:13,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:13,974 INFO L225 Difference]: With dead ends: 105 [2019-09-10 02:08:13,974 INFO L226 Difference]: Without dead ends: 105 [2019-09-10 02:08:13,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 171 SyntacticMatches, 18 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:13,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-10 02:08:13,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-09-10 02:08:13,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-10 02:08:13,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2019-09-10 02:08:13,978 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 102 [2019-09-10 02:08:13,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:13,979 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2019-09-10 02:08:13,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-10 02:08:13,979 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2019-09-10 02:08:13,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 02:08:13,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:13,980 INFO L399 BasicCegarLoop]: trace histogram [47, 34, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:13,980 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:13,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:13,980 INFO L82 PathProgramCache]: Analyzing trace with hash -106099440, now seen corresponding path program 34 times [2019-09-10 02:08:13,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:13,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:13,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:13,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:13,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:14,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:08:14,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:14,721 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:14,722 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:14,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:14,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:14,722 INFO 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) [2019-09-10 02:08:14,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:14,737 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:14,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 02:08:14,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:14,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:08:14,788 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:15,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:08:15,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:15,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 52 [2019-09-10 02:08:15,659 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:15,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-10 02:08:15,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-10 02:08:15,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:15,660 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand 37 states. [2019-09-10 02:08:15,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:15,776 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2019-09-10 02:08:15,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 02:08:15,777 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 104 [2019-09-10 02:08:15,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:15,778 INFO L225 Difference]: With dead ends: 107 [2019-09-10 02:08:15,778 INFO L226 Difference]: Without dead ends: 107 [2019-09-10 02:08:15,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 174 SyntacticMatches, 20 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:15,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-10 02:08:15,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-09-10 02:08:15,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-10 02:08:15,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2019-09-10 02:08:15,782 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 104 [2019-09-10 02:08:15,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:15,783 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2019-09-10 02:08:15,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-10 02:08:15,783 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2019-09-10 02:08:15,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 02:08:15,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:15,784 INFO L399 BasicCegarLoop]: trace histogram [48, 35, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:15,784 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:15,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:15,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1945931341, now seen corresponding path program 35 times [2019-09-10 02:08:15,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:15,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:15,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:15,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:15,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:16,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 900 proven. 1260 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:08:16,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:16,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:16,323 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:16,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:16,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:16,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:16,333 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:08:16,334 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:08:16,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-09-10 02:08:16,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:16,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 02:08:16,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:16,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 945 proven. 169 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2019-09-10 02:08:16,786 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:17,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 945 proven. 169 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2019-09-10 02:08:17,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:17,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 16, 16] total 66 [2019-09-10 02:08:17,327 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:17,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-10 02:08:17,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-10 02:08:17,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 02:08:17,329 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand 52 states. [2019-09-10 02:08:17,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:17,557 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2019-09-10 02:08:17,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-10 02:08:17,558 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 106 [2019-09-10 02:08:17,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:17,558 INFO L225 Difference]: With dead ends: 112 [2019-09-10 02:08:17,559 INFO L226 Difference]: Without dead ends: 112 [2019-09-10 02:08:17,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 02:08:17,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-10 02:08:17,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-09-10 02:08:17,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-10 02:08:17,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2019-09-10 02:08:17,563 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 106 [2019-09-10 02:08:17,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:17,564 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2019-09-10 02:08:17,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-10 02:08:17,564 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2019-09-10 02:08:17,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 02:08:17,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:17,565 INFO L399 BasicCegarLoop]: trace histogram [50, 36, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:17,565 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:17,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:17,565 INFO L82 PathProgramCache]: Analyzing trace with hash -2133602619, now seen corresponding path program 36 times [2019-09-10 02:08:17,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:17,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:17,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:17,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:17,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:18,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-10 02:08:18,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:18,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:18,208 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:18,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:18,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:18,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:18,222 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:18,222 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:08:18,254 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:18,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:18,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-10 02:08:18,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:18,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-10 02:08:18,272 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:19,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (37)] Exception during sending of exit command (exit): Stream closed [2019-09-10 02:08:19,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:19,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 52 [2019-09-10 02:08:19,141 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:19,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-10 02:08:19,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-10 02:08:19,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:19,142 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand 39 states. [2019-09-10 02:08:19,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:19,285 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2019-09-10 02:08:19,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-10 02:08:19,286 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 110 [2019-09-10 02:08:19,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:19,287 INFO L225 Difference]: With dead ends: 113 [2019-09-10 02:08:19,287 INFO L226 Difference]: Without dead ends: 113 [2019-09-10 02:08:19,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 184 SyntacticMatches, 24 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:19,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-10 02:08:19,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-09-10 02:08:19,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-10 02:08:19,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2019-09-10 02:08:19,290 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 110 [2019-09-10 02:08:19,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:19,291 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2019-09-10 02:08:19,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-10 02:08:19,291 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2019-09-10 02:08:19,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 02:08:19,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:19,292 INFO L399 BasicCegarLoop]: trace histogram [51, 37, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:19,292 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:19,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:19,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1654304322, now seen corresponding path program 37 times [2019-09-10 02:08:19,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:19,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:19,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:19,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:19,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:19,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-10 02:08:19,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:19,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:19,915 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:19,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:19,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:19,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:19,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:19,926 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:08:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:19,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-10 02:08:19,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:19,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-10 02:08:19,978 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:20,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (38)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:08:20,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:20,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 52 [2019-09-10 02:08:20,940 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:20,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-10 02:08:20,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-10 02:08:20,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:20,941 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 40 states. [2019-09-10 02:08:21,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:21,057 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2019-09-10 02:08:21,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-10 02:08:21,057 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 112 [2019-09-10 02:08:21,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:21,058 INFO L225 Difference]: With dead ends: 115 [2019-09-10 02:08:21,058 INFO L226 Difference]: Without dead ends: 115 [2019-09-10 02:08:21,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 187 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:21,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-09-10 02:08:21,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-09-10 02:08:21,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-10 02:08:21,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2019-09-10 02:08:21,067 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 112 [2019-09-10 02:08:21,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:21,067 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2019-09-10 02:08:21,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-10 02:08:21,068 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2019-09-10 02:08:21,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 02:08:21,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:21,069 INFO L399 BasicCegarLoop]: trace histogram [52, 38, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:21,069 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:21,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:21,069 INFO L82 PathProgramCache]: Analyzing trace with hash -299392385, now seen corresponding path program 38 times [2019-09-10 02:08:21,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:21,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:21,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:21,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:21,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:21,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1053 proven. 1482 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-10 02:08:21,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:21,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:21,725 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:21,725 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:21,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:21,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:21,736 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:08:21,736 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:08:21,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-10 02:08:21,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:21,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 02:08:21,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:22,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1102 proven. 196 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2019-09-10 02:08:22,259 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:22,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1102 proven. 196 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2019-09-10 02:08:22,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:22,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 17, 17] total 71 [2019-09-10 02:08:22,894 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:22,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-10 02:08:22,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-10 02:08:22,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 02:08:22,896 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand 56 states. [2019-09-10 02:08:23,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:23,166 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2019-09-10 02:08:23,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-10 02:08:23,167 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 114 [2019-09-10 02:08:23,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:23,168 INFO L225 Difference]: With dead ends: 120 [2019-09-10 02:08:23,168 INFO L226 Difference]: Without dead ends: 120 [2019-09-10 02:08:23,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 02:08:23,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-10 02:08:23,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-09-10 02:08:23,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-10 02:08:23,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2019-09-10 02:08:23,172 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 114 [2019-09-10 02:08:23,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:23,172 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2019-09-10 02:08:23,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-10 02:08:23,173 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2019-09-10 02:08:23,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 02:08:23,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:23,174 INFO L399 BasicCegarLoop]: trace histogram [54, 39, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:23,174 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:23,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:23,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1680436873, now seen corresponding path program 39 times [2019-09-10 02:08:23,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:23,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:23,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:23,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:23,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:24,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-10 02:08:24,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:24,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:24,094 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:24,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:24,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:24,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:24,104 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:24,104 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:08:24,147 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:24,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:24,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-10 02:08:24,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:24,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-10 02:08:24,195 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:25,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-10 02:08:25,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:25,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 52 [2019-09-10 02:08:25,218 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:25,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-10 02:08:25,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-10 02:08:25,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:25,219 INFO L87 Difference]: Start difference. First operand 119 states and 134 transitions. Second operand 42 states. [2019-09-10 02:08:25,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:25,381 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2019-09-10 02:08:25,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-10 02:08:25,386 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 118 [2019-09-10 02:08:25,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:25,387 INFO L225 Difference]: With dead ends: 121 [2019-09-10 02:08:25,387 INFO L226 Difference]: Without dead ends: 121 [2019-09-10 02:08:25,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 197 SyntacticMatches, 30 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:25,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-10 02:08:25,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-09-10 02:08:25,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-10 02:08:25,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 136 transitions. [2019-09-10 02:08:25,391 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 136 transitions. Word has length 118 [2019-09-10 02:08:25,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:25,392 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 136 transitions. [2019-09-10 02:08:25,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-10 02:08:25,392 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2019-09-10 02:08:25,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 02:08:25,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:25,393 INFO L399 BasicCegarLoop]: trace histogram [55, 40, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:25,393 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:25,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:25,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1505272820, now seen corresponding path program 40 times [2019-09-10 02:08:25,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:25,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:25,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:25,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:25,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:26,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-10 02:08:26,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:26,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:26,058 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:26,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:26,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:26,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:26,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:26,068 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:08:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:26,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-10 02:08:26,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:26,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-10 02:08:26,140 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:26,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-10 02:08:26,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:26,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 52 [2019-09-10 02:08:26,985 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:26,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-10 02:08:26,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-10 02:08:26,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:26,991 INFO L87 Difference]: Start difference. First operand 121 states and 136 transitions. Second operand 43 states. [2019-09-10 02:08:27,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:27,133 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2019-09-10 02:08:27,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-10 02:08:27,133 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 120 [2019-09-10 02:08:27,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:27,135 INFO L225 Difference]: With dead ends: 123 [2019-09-10 02:08:27,135 INFO L226 Difference]: Without dead ends: 123 [2019-09-10 02:08:27,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 200 SyntacticMatches, 32 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:27,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-10 02:08:27,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-09-10 02:08:27,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-09-10 02:08:27,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 138 transitions. [2019-09-10 02:08:27,140 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 138 transitions. Word has length 120 [2019-09-10 02:08:27,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:27,141 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 138 transitions. [2019-09-10 02:08:27,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-10 02:08:27,144 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 138 transitions. [2019-09-10 02:08:27,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 02:08:27,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:27,145 INFO L399 BasicCegarLoop]: trace histogram [56, 41, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:27,146 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:27,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:27,146 INFO L82 PathProgramCache]: Analyzing trace with hash 660605745, now seen corresponding path program 41 times [2019-09-10 02:08:27,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:27,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:27,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:27,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:27,148 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:27,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1218 proven. 1722 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-10 02:08:27,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:27,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:27,830 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:27,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:27,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:27,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:27,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:08:27,846 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:08:27,879 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-09-10 02:08:27,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:27,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 02:08:27,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:28,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1271 proven. 225 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-10 02:08:28,442 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:29,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1271 proven. 225 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-10 02:08:29,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:29,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 18, 18] total 76 [2019-09-10 02:08:29,167 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:29,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-10 02:08:29,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-10 02:08:29,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-10 02:08:29,169 INFO L87 Difference]: Start difference. First operand 123 states and 138 transitions. Second operand 60 states. [2019-09-10 02:08:29,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:29,435 INFO L93 Difference]: Finished difference Result 128 states and 145 transitions. [2019-09-10 02:08:29,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-10 02:08:29,436 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 122 [2019-09-10 02:08:29,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:29,437 INFO L225 Difference]: With dead ends: 128 [2019-09-10 02:08:29,437 INFO L226 Difference]: Without dead ends: 128 [2019-09-10 02:08:29,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-10 02:08:29,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-10 02:08:29,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-09-10 02:08:29,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-09-10 02:08:29,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 143 transitions. [2019-09-10 02:08:29,442 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 143 transitions. Word has length 122 [2019-09-10 02:08:29,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:29,443 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 143 transitions. [2019-09-10 02:08:29,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-10 02:08:29,443 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 143 transitions. [2019-09-10 02:08:29,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 02:08:29,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:29,444 INFO L399 BasicCegarLoop]: trace histogram [58, 42, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:29,444 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:29,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:29,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1648396457, now seen corresponding path program 42 times [2019-09-10 02:08:29,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:29,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:29,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:29,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:29,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:30,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-10 02:08:30,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:30,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:30,198 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:30,198 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:30,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:30,199 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:30,209 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:30,209 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:08:30,246 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:30,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:30,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 02:08:30,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:30,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-10 02:08:30,267 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:31,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-10 02:08:31,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:31,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 52 [2019-09-10 02:08:31,188 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:31,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-10 02:08:31,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-10 02:08:31,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:31,189 INFO L87 Difference]: Start difference. First operand 127 states and 143 transitions. Second operand 45 states. [2019-09-10 02:08:31,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:31,362 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2019-09-10 02:08:31,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 02:08:31,363 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 126 [2019-09-10 02:08:31,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:31,365 INFO L225 Difference]: With dead ends: 129 [2019-09-10 02:08:31,365 INFO L226 Difference]: Without dead ends: 129 [2019-09-10 02:08:31,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 210 SyntacticMatches, 36 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:31,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-09-10 02:08:31,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-09-10 02:08:31,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-10 02:08:31,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 145 transitions. [2019-09-10 02:08:31,369 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 145 transitions. Word has length 126 [2019-09-10 02:08:31,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:31,370 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 145 transitions. [2019-09-10 02:08:31,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-10 02:08:31,370 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 145 transitions. [2019-09-10 02:08:31,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 02:08:31,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:31,371 INFO L399 BasicCegarLoop]: trace histogram [59, 43, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:31,371 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:31,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:31,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1398459942, now seen corresponding path program 43 times [2019-09-10 02:08:31,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:31,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:31,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:31,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:31,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:32,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-10 02:08:32,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:32,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:32,133 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:32,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:32,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:32,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:32,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:32,146 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:08:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:32,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-10 02:08:32,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:32,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-10 02:08:32,209 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:33,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-10 02:08:33,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:33,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 52 [2019-09-10 02:08:33,089 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:33,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-10 02:08:33,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-10 02:08:33,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:33,090 INFO L87 Difference]: Start difference. First operand 129 states and 145 transitions. Second operand 46 states. [2019-09-10 02:08:33,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:33,232 INFO L93 Difference]: Finished difference Result 131 states and 147 transitions. [2019-09-10 02:08:33,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-10 02:08:33,233 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 128 [2019-09-10 02:08:33,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:33,234 INFO L225 Difference]: With dead ends: 131 [2019-09-10 02:08:33,234 INFO L226 Difference]: Without dead ends: 131 [2019-09-10 02:08:33,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 213 SyntacticMatches, 38 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:33,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-09-10 02:08:33,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-09-10 02:08:33,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-09-10 02:08:33,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 147 transitions. [2019-09-10 02:08:33,240 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 147 transitions. Word has length 128 [2019-09-10 02:08:33,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:33,241 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 147 transitions. [2019-09-10 02:08:33,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-10 02:08:33,241 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 147 transitions. [2019-09-10 02:08:33,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 02:08:33,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:33,242 INFO L399 BasicCegarLoop]: trace histogram [60, 44, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:33,242 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:33,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:33,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1727637603, now seen corresponding path program 44 times [2019-09-10 02:08:33,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:33,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:33,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:33,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:33,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:34,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1395 proven. 1980 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-10 02:08:34,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:34,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:34,429 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:34,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:34,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:34,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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:34,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:08:34,440 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:08:34,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-09-10 02:08:34,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:34,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 02:08:34,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:35,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1452 proven. 256 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2019-09-10 02:08:35,579 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:36,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1452 proven. 256 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2019-09-10 02:08:36,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:36,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 19, 19] total 81 [2019-09-10 02:08:36,441 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:36,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-10 02:08:36,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-10 02:08:36,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-09-10 02:08:36,443 INFO L87 Difference]: Start difference. First operand 131 states and 147 transitions. Second operand 64 states. [2019-09-10 02:08:36,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:36,814 INFO L93 Difference]: Finished difference Result 136 states and 154 transitions. [2019-09-10 02:08:36,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-10 02:08:36,814 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 130 [2019-09-10 02:08:36,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:36,815 INFO L225 Difference]: With dead ends: 136 [2019-09-10 02:08:36,815 INFO L226 Difference]: Without dead ends: 136 [2019-09-10 02:08:36,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-09-10 02:08:36,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-10 02:08:36,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2019-09-10 02:08:36,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-10 02:08:36,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 152 transitions. [2019-09-10 02:08:36,819 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 152 transitions. Word has length 130 [2019-09-10 02:08:36,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:36,819 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 152 transitions. [2019-09-10 02:08:36,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-10 02:08:36,820 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 152 transitions. [2019-09-10 02:08:36,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 02:08:36,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:36,820 INFO L399 BasicCegarLoop]: trace histogram [62, 45, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:36,821 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:36,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:36,821 INFO L82 PathProgramCache]: Analyzing trace with hash -387083173, now seen corresponding path program 45 times [2019-09-10 02:08:36,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:36,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:36,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:36,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:36,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:37,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-10 02:08:37,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:37,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:37,662 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:37,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:37,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:37,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:37,674 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:37,674 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:08:37,732 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:37,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:37,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-10 02:08:37,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:37,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-10 02:08:37,754 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:38,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-10 02:08:38,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:38,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 52 [2019-09-10 02:08:38,634 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:38,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-10 02:08:38,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-10 02:08:38,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:38,635 INFO L87 Difference]: Start difference. First operand 135 states and 152 transitions. Second operand 48 states. [2019-09-10 02:08:38,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:38,825 INFO L93 Difference]: Finished difference Result 137 states and 154 transitions. [2019-09-10 02:08:38,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-10 02:08:38,825 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 134 [2019-09-10 02:08:38,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:38,826 INFO L225 Difference]: With dead ends: 137 [2019-09-10 02:08:38,827 INFO L226 Difference]: Without dead ends: 137 [2019-09-10 02:08:38,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 223 SyntacticMatches, 42 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:38,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-09-10 02:08:38,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-09-10 02:08:38,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-09-10 02:08:38,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 154 transitions. [2019-09-10 02:08:38,833 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 154 transitions. Word has length 134 [2019-09-10 02:08:38,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:38,834 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 154 transitions. [2019-09-10 02:08:38,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-10 02:08:38,834 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 154 transitions. [2019-09-10 02:08:38,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 02:08:38,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:38,835 INFO L399 BasicCegarLoop]: trace histogram [63, 46, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:38,835 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:38,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:38,836 INFO L82 PathProgramCache]: Analyzing trace with hash -144896808, now seen corresponding path program 46 times [2019-09-10 02:08:38,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:38,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:38,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:38,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:38,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:39,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-10 02:08:39,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:39,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:39,652 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:39,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:39,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:39,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:39,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:39,663 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:08:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:39,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-10 02:08:39,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:39,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-10 02:08:39,722 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:40,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-10 02:08:40,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:40,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 52 [2019-09-10 02:08:40,639 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:40,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-10 02:08:40,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-10 02:08:40,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:40,640 INFO L87 Difference]: Start difference. First operand 137 states and 154 transitions. Second operand 49 states. [2019-09-10 02:08:40,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:40,803 INFO L93 Difference]: Finished difference Result 139 states and 156 transitions. [2019-09-10 02:08:40,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-10 02:08:40,804 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 136 [2019-09-10 02:08:40,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:40,805 INFO L225 Difference]: With dead ends: 139 [2019-09-10 02:08:40,805 INFO L226 Difference]: Without dead ends: 139 [2019-09-10 02:08:40,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 226 SyntacticMatches, 44 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:40,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-10 02:08:40,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-09-10 02:08:40,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-10 02:08:40,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 156 transitions. [2019-09-10 02:08:40,809 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 156 transitions. Word has length 136 [2019-09-10 02:08:40,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:40,809 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 156 transitions. [2019-09-10 02:08:40,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-10 02:08:40,810 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 156 transitions. [2019-09-10 02:08:40,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 02:08:40,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:40,810 INFO L399 BasicCegarLoop]: trace histogram [64, 47, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:40,810 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:40,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:40,811 INFO L82 PathProgramCache]: Analyzing trace with hash 667965973, now seen corresponding path program 47 times [2019-09-10 02:08:40,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:40,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:40,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:40,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:40,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:42,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1584 proven. 2256 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-10 02:08:42,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:42,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:42,103 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:42,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:42,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:42,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:08:42,132 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:08:42,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:42,194 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-09-10 02:08:42,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:42,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 02:08:42,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:42,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1645 proven. 289 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2019-09-10 02:08:42,950 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1645 proven. 289 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2019-09-10 02:08:43,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:43,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 20, 20] total 86 [2019-09-10 02:08:43,859 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:43,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-10 02:08:43,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-10 02:08:43,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-09-10 02:08:43,860 INFO L87 Difference]: Start difference. First operand 139 states and 156 transitions. Second operand 68 states. [2019-09-10 02:08:44,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:44,213 INFO L93 Difference]: Finished difference Result 144 states and 163 transitions. [2019-09-10 02:08:44,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-10 02:08:44,213 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 138 [2019-09-10 02:08:44,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:44,214 INFO L225 Difference]: With dead ends: 144 [2019-09-10 02:08:44,214 INFO L226 Difference]: Without dead ends: 144 [2019-09-10 02:08:44,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-09-10 02:08:44,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-10 02:08:44,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2019-09-10 02:08:44,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-10 02:08:44,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 161 transitions. [2019-09-10 02:08:44,219 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 161 transitions. Word has length 138 [2019-09-10 02:08:44,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:44,219 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 161 transitions. [2019-09-10 02:08:44,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-10 02:08:44,219 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 161 transitions. [2019-09-10 02:08:44,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 02:08:44,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:44,220 INFO L399 BasicCegarLoop]: trace histogram [66, 48, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:44,221 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:44,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:44,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1237216115, now seen corresponding path program 48 times [2019-09-10 02:08:44,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:44,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:44,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:44,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:44,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:45,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-10 02:08:45,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:45,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:45,733 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:45,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:45,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:45,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:45,755 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:45,755 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:08:45,814 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:45,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:45,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-10 02:08:45,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:45,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-10 02:08:45,863 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:47,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-10 02:08:47,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:47,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 52 [2019-09-10 02:08:47,213 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:47,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-10 02:08:47,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-10 02:08:47,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:47,214 INFO L87 Difference]: Start difference. First operand 143 states and 161 transitions. Second operand 51 states. [2019-09-10 02:08:47,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:47,362 INFO L93 Difference]: Finished difference Result 145 states and 163 transitions. [2019-09-10 02:08:47,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-10 02:08:47,362 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 142 [2019-09-10 02:08:47,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:47,364 INFO L225 Difference]: With dead ends: 145 [2019-09-10 02:08:47,364 INFO L226 Difference]: Without dead ends: 145 [2019-09-10 02:08:47,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 236 SyntacticMatches, 48 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:47,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-09-10 02:08:47,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-09-10 02:08:47,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-10 02:08:47,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 163 transitions. [2019-09-10 02:08:47,368 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 163 transitions. Word has length 142 [2019-09-10 02:08:47,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:47,368 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 163 transitions. [2019-09-10 02:08:47,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-10 02:08:47,369 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 163 transitions. [2019-09-10 02:08:47,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 02:08:47,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:47,370 INFO L399 BasicCegarLoop]: trace histogram [67, 49, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:47,370 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:47,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:47,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1596145674, now seen corresponding path program 49 times [2019-09-10 02:08:47,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:47,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:47,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:47,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:47,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:48,433 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-10 02:08:48,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:48,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:48,433 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:48,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:48,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:48,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:48,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:48,445 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:08:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:48,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-10 02:08:48,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:48,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-10 02:08:48,508 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:49,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-10 02:08:49,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:49,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2019-09-10 02:08:49,368 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:49,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-10 02:08:49,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-10 02:08:49,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:49,370 INFO L87 Difference]: Start difference. First operand 145 states and 163 transitions. Second operand 52 states. [2019-09-10 02:08:49,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:49,571 INFO L93 Difference]: Finished difference Result 147 states and 165 transitions. [2019-09-10 02:08:49,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-10 02:08:49,572 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 144 [2019-09-10 02:08:49,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:49,574 INFO L225 Difference]: With dead ends: 147 [2019-09-10 02:08:49,574 INFO L226 Difference]: Without dead ends: 147 [2019-09-10 02:08:49,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 239 SyntacticMatches, 50 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:49,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-10 02:08:49,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-09-10 02:08:49,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-10 02:08:49,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 165 transitions. [2019-09-10 02:08:49,578 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 165 transitions. Word has length 144 [2019-09-10 02:08:49,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:49,579 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 165 transitions. [2019-09-10 02:08:49,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-10 02:08:49,579 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 165 transitions. [2019-09-10 02:08:49,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 02:08:49,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:49,580 INFO L399 BasicCegarLoop]: trace histogram [68, 50, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:49,580 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:49,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:49,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1447559239, now seen corresponding path program 50 times [2019-09-10 02:08:49,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:49,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:49,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:49,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:49,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:51,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:51,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:51,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:51,333 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:51,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:51,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:51,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:51,345 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:08:51,346 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:08:51,390 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-09-10 02:08:51,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:51,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 02:08:51,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:51,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 1850 proven. 324 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-10 02:08:51,410 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:52,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 1850 proven. 324 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-10 02:08:52,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:52,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 21, 21] total 90 [2019-09-10 02:08:52,455 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:52,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-10 02:08:52,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-10 02:08:52,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-09-10 02:08:52,457 INFO L87 Difference]: Start difference. First operand 147 states and 165 transitions. Second operand 71 states. [2019-09-10 02:08:52,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:52,913 INFO L93 Difference]: Finished difference Result 150 states and 170 transitions. [2019-09-10 02:08:52,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-10 02:08:52,914 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 146 [2019-09-10 02:08:52,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:52,916 INFO L225 Difference]: With dead ends: 150 [2019-09-10 02:08:52,916 INFO L226 Difference]: Without dead ends: 150 [2019-09-10 02:08:52,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-09-10 02:08:52,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-10 02:08:52,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-09-10 02:08:52,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-10 02:08:52,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 168 transitions. [2019-09-10 02:08:52,920 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 168 transitions. Word has length 146 [2019-09-10 02:08:52,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:52,920 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 168 transitions. [2019-09-10 02:08:52,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-10 02:08:52,920 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 168 transitions. [2019-09-10 02:08:52,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 02:08:52,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:52,924 INFO L399 BasicCegarLoop]: trace histogram [69, 50, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:52,924 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:52,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:52,925 INFO L82 PathProgramCache]: Analyzing trace with hash 638062466, now seen corresponding path program 51 times [2019-09-10 02:08:52,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:52,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:52,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:52,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:52,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:54,711 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:54,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:54,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:54,712 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:54,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:54,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:54,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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:54,723 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:54,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:08:54,765 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:54,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:54,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-10 02:08:54,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:54,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:54,800 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:57,855 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:57,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:57,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 102 [2019-09-10 02:08:57,858 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:57,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-10 02:08:57,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-10 02:08:57,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:57,860 INFO L87 Difference]: Start difference. First operand 149 states and 168 transitions. Second operand 72 states. [2019-09-10 02:08:58,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:58,295 INFO L93 Difference]: Finished difference Result 152 states and 173 transitions. [2019-09-10 02:08:58,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-10 02:08:58,295 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 148 [2019-09-10 02:08:58,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:58,297 INFO L225 Difference]: With dead ends: 152 [2019-09-10 02:08:58,297 INFO L226 Difference]: Without dead ends: 152 [2019-09-10 02:08:58,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 227 SyntacticMatches, 40 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:58,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-10 02:08:58,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2019-09-10 02:08:58,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-09-10 02:08:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 171 transitions. [2019-09-10 02:08:58,300 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 171 transitions. Word has length 148 [2019-09-10 02:08:58,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:58,301 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 171 transitions. [2019-09-10 02:08:58,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-10 02:08:58,301 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 171 transitions. [2019-09-10 02:08:58,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 02:08:58,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:58,302 INFO L399 BasicCegarLoop]: trace histogram [70, 50, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:58,302 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:58,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:58,303 INFO L82 PathProgramCache]: Analyzing trace with hash 100744189, now seen corresponding path program 52 times [2019-09-10 02:08:58,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:58,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:58,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:58,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:58,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:01,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:01,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:01,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:01,743 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:01,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:01,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:01,744 INFO 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-10 02:09:01,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:01,766 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:09:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:01,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-10 02:09:01,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:01,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:01,897 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:06,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:06,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:06,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 102 [2019-09-10 02:09:06,031 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:06,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-10 02:09:06,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-10 02:09:06,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:06,034 INFO L87 Difference]: Start difference. First operand 151 states and 171 transitions. Second operand 73 states. [2019-09-10 02:09:06,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:06,493 INFO L93 Difference]: Finished difference Result 154 states and 176 transitions. [2019-09-10 02:09:06,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-10 02:09:06,493 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 150 [2019-09-10 02:09:06,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:06,497 INFO L225 Difference]: With dead ends: 154 [2019-09-10 02:09:06,497 INFO L226 Difference]: Without dead ends: 154 [2019-09-10 02:09:06,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 230 SyntacticMatches, 42 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2079 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:06,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-10 02:09:06,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-09-10 02:09:06,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-10 02:09:06,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 174 transitions. [2019-09-10 02:09:06,501 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 174 transitions. Word has length 150 [2019-09-10 02:09:06,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:06,501 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 174 transitions. [2019-09-10 02:09:06,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-10 02:09:06,502 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 174 transitions. [2019-09-10 02:09:06,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 02:09:06,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:06,503 INFO L399 BasicCegarLoop]: trace histogram [71, 50, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:06,503 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:06,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:06,503 INFO L82 PathProgramCache]: Analyzing trace with hash -866044488, now seen corresponding path program 53 times [2019-09-10 02:09:06,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:06,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:06,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:06,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:06,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:08,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:08,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:08,647 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:08,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:08,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:08,647 INFO 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-10 02:09:08,658 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:09:08,658 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:09:08,715 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-09-10 02:09:08,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:08,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 02:09:08,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:08,730 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2150 proven. 441 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-10 02:09:08,730 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:09,986 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2150 proven. 441 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-10 02:09:09,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:09,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 24, 24] total 96 [2019-09-10 02:09:09,990 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:09,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-10 02:09:09,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-10 02:09:09,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-10 02:09:09,991 INFO L87 Difference]: Start difference. First operand 153 states and 174 transitions. Second operand 74 states. [2019-09-10 02:09:10,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:10,454 INFO L93 Difference]: Finished difference Result 156 states and 179 transitions. [2019-09-10 02:09:10,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-10 02:09:10,455 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 152 [2019-09-10 02:09:10,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:10,456 INFO L225 Difference]: With dead ends: 156 [2019-09-10 02:09:10,456 INFO L226 Difference]: Without dead ends: 156 [2019-09-10 02:09:10,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-10 02:09:10,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-09-10 02:09:10,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2019-09-10 02:09:10,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-10 02:09:10,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 177 transitions. [2019-09-10 02:09:10,460 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 177 transitions. Word has length 152 [2019-09-10 02:09:10,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:10,460 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 177 transitions. [2019-09-10 02:09:10,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-10 02:09:10,460 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 177 transitions. [2019-09-10 02:09:10,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 02:09:10,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:10,461 INFO L399 BasicCegarLoop]: trace histogram [72, 50, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:10,462 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:10,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:10,462 INFO L82 PathProgramCache]: Analyzing trace with hash 2057940147, now seen corresponding path program 54 times [2019-09-10 02:09:10,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:10,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:10,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:10,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:10,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:12,990 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:12,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:12,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:12,991 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:12,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:12,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:12,991 INFO 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-10 02:09:13,010 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:09:13,010 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:09:13,070 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:09:13,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:13,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-10 02:09:13,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:13,106 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:13,107 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:16,301 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:16,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:16,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 102 [2019-09-10 02:09:16,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:16,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-10 02:09:16,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-10 02:09:16,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:16,307 INFO L87 Difference]: Start difference. First operand 155 states and 177 transitions. Second operand 75 states. [2019-09-10 02:09:16,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:16,726 INFO L93 Difference]: Finished difference Result 158 states and 182 transitions. [2019-09-10 02:09:16,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-10 02:09:16,726 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 154 [2019-09-10 02:09:16,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:16,727 INFO L225 Difference]: With dead ends: 158 [2019-09-10 02:09:16,727 INFO L226 Difference]: Without dead ends: 158 [2019-09-10 02:09:16,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 236 SyntacticMatches, 46 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2277 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:16,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-10 02:09:16,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-09-10 02:09:16,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-09-10 02:09:16,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 180 transitions. [2019-09-10 02:09:16,731 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 180 transitions. Word has length 154 [2019-09-10 02:09:16,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:16,732 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 180 transitions. [2019-09-10 02:09:16,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-10 02:09:16,732 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 180 transitions. [2019-09-10 02:09:16,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 02:09:16,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:16,733 INFO L399 BasicCegarLoop]: trace histogram [73, 50, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:16,733 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:16,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:16,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1196404498, now seen corresponding path program 55 times [2019-09-10 02:09:16,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:16,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:16,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:16,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:16,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:18,710 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:18,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:18,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:18,711 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:18,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:18,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:18,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10 02:09:18,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:18,722 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:09:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:18,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-10 02:09:18,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:18,796 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:18,796 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:21,927 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:21,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:21,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 102 [2019-09-10 02:09:21,931 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:21,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-10 02:09:21,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-10 02:09:21,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:21,933 INFO L87 Difference]: Start difference. First operand 157 states and 180 transitions. Second operand 76 states. [2019-09-10 02:09:22,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:22,424 INFO L93 Difference]: Finished difference Result 160 states and 185 transitions. [2019-09-10 02:09:22,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-10 02:09:22,424 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 156 [2019-09-10 02:09:22,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:22,425 INFO L225 Difference]: With dead ends: 160 [2019-09-10 02:09:22,425 INFO L226 Difference]: Without dead ends: 160 [2019-09-10 02:09:22,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 239 SyntacticMatches, 48 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2376 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:22,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-10 02:09:22,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2019-09-10 02:09:22,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-10 02:09:22,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 183 transitions. [2019-09-10 02:09:22,429 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 183 transitions. Word has length 156 [2019-09-10 02:09:22,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:22,429 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 183 transitions. [2019-09-10 02:09:22,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-10 02:09:22,429 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 183 transitions. [2019-09-10 02:09:22,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-10 02:09:22,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:22,430 INFO L399 BasicCegarLoop]: trace histogram [74, 50, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:22,431 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:22,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:22,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1885416855, now seen corresponding path program 56 times [2019-09-10 02:09:22,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:22,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:22,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:22,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:22,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:24,493 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:24,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:24,493 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:24,494 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:24,494 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:24,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:24,494 INFO 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-10 02:09:24,505 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:09:24,505 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:09:24,559 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-09-10 02:09:24,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:24,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-10 02:09:24,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:24,593 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2450 proven. 576 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-10 02:09:24,593 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:26,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2450 proven. 576 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-10 02:09:26,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:26,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 27, 27] total 102 [2019-09-10 02:09:26,088 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:26,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-10 02:09:26,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-10 02:09:26,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:26,090 INFO L87 Difference]: Start difference. First operand 159 states and 183 transitions. Second operand 77 states. [2019-09-10 02:09:26,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:26,543 INFO L93 Difference]: Finished difference Result 162 states and 188 transitions. [2019-09-10 02:09:26,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-10 02:09:26,544 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 158 [2019-09-10 02:09:26,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:26,545 INFO L225 Difference]: With dead ends: 162 [2019-09-10 02:09:26,545 INFO L226 Difference]: Without dead ends: 162 [2019-09-10 02:09:26,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:26,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-10 02:09:26,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-09-10 02:09:26,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-09-10 02:09:26,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2019-09-10 02:09:26,548 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 158 [2019-09-10 02:09:26,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:26,549 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2019-09-10 02:09:26,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-10 02:09:26,549 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2019-09-10 02:09:26,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 02:09:26,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:26,550 INFO L399 BasicCegarLoop]: trace histogram [75, 50, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:26,550 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:26,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:26,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1693638948, now seen corresponding path program 57 times [2019-09-10 02:09:26,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:26,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:26,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:26,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:26,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:28,653 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:28,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:28,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:28,654 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:28,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:28,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:28,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10 02:09:28,671 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:09:28,671 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:09:28,715 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:09:28,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:28,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-10 02:09:28,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:28,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:28,753 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:31,943 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:31,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:31,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 102 [2019-09-10 02:09:31,946 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:31,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-10 02:09:31,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-10 02:09:31,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:31,948 INFO L87 Difference]: Start difference. First operand 161 states and 186 transitions. Second operand 78 states. [2019-09-10 02:09:32,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:32,456 INFO L93 Difference]: Finished difference Result 164 states and 191 transitions. [2019-09-10 02:09:32,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-10 02:09:32,457 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 160 [2019-09-10 02:09:32,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:32,459 INFO L225 Difference]: With dead ends: 164 [2019-09-10 02:09:32,459 INFO L226 Difference]: Without dead ends: 164 [2019-09-10 02:09:32,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 245 SyntacticMatches, 52 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2574 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:32,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-10 02:09:32,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2019-09-10 02:09:32,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-10 02:09:32,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 189 transitions. [2019-09-10 02:09:32,467 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 189 transitions. Word has length 160 [2019-09-10 02:09:32,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:32,467 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 189 transitions. [2019-09-10 02:09:32,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-10 02:09:32,467 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 189 transitions. [2019-09-10 02:09:32,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-10 02:09:32,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:32,468 INFO L399 BasicCegarLoop]: trace histogram [76, 50, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:32,468 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:32,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:32,469 INFO L82 PathProgramCache]: Analyzing trace with hash 897461535, now seen corresponding path program 58 times [2019-09-10 02:09:32,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:32,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:32,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:32,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:32,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:34,775 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:34,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:34,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:34,776 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:34,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:34,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:34,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10 02:09:34,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:34,787 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:09:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:34,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-10 02:09:34,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:34,859 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:34,860 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:38,047 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:38,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:38,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 102 [2019-09-10 02:09:38,051 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:38,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-10 02:09:38,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-10 02:09:38,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:38,053 INFO L87 Difference]: Start difference. First operand 163 states and 189 transitions. Second operand 79 states. [2019-09-10 02:09:38,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:38,589 INFO L93 Difference]: Finished difference Result 166 states and 194 transitions. [2019-09-10 02:09:38,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-10 02:09:38,589 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 162 [2019-09-10 02:09:38,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:38,590 INFO L225 Difference]: With dead ends: 166 [2019-09-10 02:09:38,590 INFO L226 Difference]: Without dead ends: 166 [2019-09-10 02:09:38,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 248 SyntacticMatches, 54 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2673 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:38,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-10 02:09:38,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-09-10 02:09:38,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-10 02:09:38,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 192 transitions. [2019-09-10 02:09:38,595 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 192 transitions. Word has length 162 [2019-09-10 02:09:38,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:38,595 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 192 transitions. [2019-09-10 02:09:38,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-10 02:09:38,595 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 192 transitions. [2019-09-10 02:09:38,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 02:09:38,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:38,596 INFO L399 BasicCegarLoop]: trace histogram [77, 50, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:38,597 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:38,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:38,597 INFO L82 PathProgramCache]: Analyzing trace with hash 275146330, now seen corresponding path program 59 times [2019-09-10 02:09:38,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:38,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:38,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:38,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:38,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:40,769 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:40,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:40,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:40,770 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:40,770 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:40,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:40,770 INFO 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-10 02:09:40,779 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:09:40,780 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:09:40,844 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2019-09-10 02:09:40,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:40,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 02:09:40,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:40,861 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2750 proven. 729 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-10 02:09:40,861 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:42,539 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2750 proven. 729 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-10 02:09:42,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:42,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 30, 30] total 102 [2019-09-10 02:09:42,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:42,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-10 02:09:42,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-10 02:09:42,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:42,545 INFO L87 Difference]: Start difference. First operand 165 states and 192 transitions. Second operand 80 states. [2019-09-10 02:09:43,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:43,098 INFO L93 Difference]: Finished difference Result 168 states and 197 transitions. [2019-09-10 02:09:43,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-10 02:09:43,098 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 164 [2019-09-10 02:09:43,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:43,099 INFO L225 Difference]: With dead ends: 168 [2019-09-10 02:09:43,099 INFO L226 Difference]: Without dead ends: 168 [2019-09-10 02:09:43,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 301 SyntacticMatches, 6 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:43,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-10 02:09:43,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2019-09-10 02:09:43,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-10 02:09:43,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 195 transitions. [2019-09-10 02:09:43,102 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 195 transitions. Word has length 164 [2019-09-10 02:09:43,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:43,103 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 195 transitions. [2019-09-10 02:09:43,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-10 02:09:43,103 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 195 transitions. [2019-09-10 02:09:43,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 02:09:43,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:43,104 INFO L399 BasicCegarLoop]: trace histogram [78, 50, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:43,104 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:43,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:43,105 INFO L82 PathProgramCache]: Analyzing trace with hash -769311531, now seen corresponding path program 60 times [2019-09-10 02:09:43,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:43,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:43,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:43,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:43,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:45,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:45,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:45,299 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:45,299 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:45,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:45,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:45,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10 02:09:45,311 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:09:45,311 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:09:45,363 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:09:45,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:45,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-10 02:09:45,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:45,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:45,411 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:48,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:48,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:48,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 102 [2019-09-10 02:09:48,685 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:48,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-10 02:09:48,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-10 02:09:48,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:48,687 INFO L87 Difference]: Start difference. First operand 167 states and 195 transitions. Second operand 81 states. [2019-09-10 02:09:49,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:49,255 INFO L93 Difference]: Finished difference Result 170 states and 200 transitions. [2019-09-10 02:09:49,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-10 02:09:49,255 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 166 [2019-09-10 02:09:49,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:49,256 INFO L225 Difference]: With dead ends: 170 [2019-09-10 02:09:49,256 INFO L226 Difference]: Without dead ends: 170 [2019-09-10 02:09:49,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 254 SyntacticMatches, 58 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2871 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:49,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-10 02:09:49,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-09-10 02:09:49,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-10 02:09:49,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 198 transitions. [2019-09-10 02:09:49,259 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 198 transitions. Word has length 166 [2019-09-10 02:09:49,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:49,259 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 198 transitions. [2019-09-10 02:09:49,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-10 02:09:49,260 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 198 transitions. [2019-09-10 02:09:49,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 02:09:49,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:49,261 INFO L399 BasicCegarLoop]: trace histogram [79, 50, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:49,261 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:49,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:49,261 INFO L82 PathProgramCache]: Analyzing trace with hash 529031312, now seen corresponding path program 61 times [2019-09-10 02:09:49,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:49,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:49,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:49,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:49,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:51,477 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:51,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:51,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:51,478 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:51,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:51,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:51,478 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10 02:09:51,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:51,488 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:09:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:51,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-10 02:09:51,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:51,574 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:51,574 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:54,937 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:54,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:54,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 102 [2019-09-10 02:09:54,940 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:54,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-10 02:09:54,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-10 02:09:54,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:54,942 INFO L87 Difference]: Start difference. First operand 169 states and 198 transitions. Second operand 82 states. [2019-09-10 02:09:55,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:55,428 INFO L93 Difference]: Finished difference Result 172 states and 203 transitions. [2019-09-10 02:09:55,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-10 02:09:55,428 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 168 [2019-09-10 02:09:55,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:55,429 INFO L225 Difference]: With dead ends: 172 [2019-09-10 02:09:55,429 INFO L226 Difference]: Without dead ends: 172 [2019-09-10 02:09:55,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 257 SyntacticMatches, 60 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2970 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:55,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-10 02:09:55,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2019-09-10 02:09:55,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-09-10 02:09:55,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 201 transitions. [2019-09-10 02:09:55,432 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 201 transitions. Word has length 168 [2019-09-10 02:09:55,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:55,432 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 201 transitions. [2019-09-10 02:09:55,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-10 02:09:55,433 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 201 transitions. [2019-09-10 02:09:55,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-10 02:09:55,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:55,434 INFO L399 BasicCegarLoop]: trace histogram [80, 50, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:55,434 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:55,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:55,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1598979701, now seen corresponding path program 62 times [2019-09-10 02:09:55,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:55,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:55,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:55,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:55,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:57,704 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:57,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:57,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:57,705 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:57,705 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:57,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:57,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:57,716 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:09:57,716 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:09:57,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 62 check-sat command(s) [2019-09-10 02:09:57,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:57,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-10 02:09:57,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:57,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3050 proven. 900 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-10 02:09:57,803 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:59,545 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3050 proven. 900 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-10 02:09:59,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:59,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 33, 33] total 102 [2019-09-10 02:09:59,548 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:59,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-10 02:09:59,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-10 02:09:59,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:59,550 INFO L87 Difference]: Start difference. First operand 171 states and 201 transitions. Second operand 83 states. [2019-09-10 02:10:00,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:00,146 INFO L93 Difference]: Finished difference Result 174 states and 206 transitions. [2019-09-10 02:10:00,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-10 02:10:00,146 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 170 [2019-09-10 02:10:00,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:00,147 INFO L225 Difference]: With dead ends: 174 [2019-09-10 02:10:00,147 INFO L226 Difference]: Without dead ends: 174 [2019-09-10 02:10:00,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 310 SyntacticMatches, 12 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:10:00,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-10 02:10:00,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-09-10 02:10:00,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-10 02:10:00,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 204 transitions. [2019-09-10 02:10:00,151 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 204 transitions. Word has length 170 [2019-09-10 02:10:00,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:00,151 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 204 transitions. [2019-09-10 02:10:00,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-10 02:10:00,151 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 204 transitions. [2019-09-10 02:10:00,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-10 02:10:00,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:00,152 INFO L399 BasicCegarLoop]: trace histogram [81, 50, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:10:00,153 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:00,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:00,153 INFO L82 PathProgramCache]: Analyzing trace with hash 2081836998, now seen corresponding path program 63 times [2019-09-10 02:10:00,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:00,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:00,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:10:00,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:00,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:00,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:02,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:10:02,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:02,496 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:02,496 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:02,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:02,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:02,496 INFO 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-10 02:10:02,507 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:10:02,507 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:10:02,555 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:10:02,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:10:02,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-10 02:10:02,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:02,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:10:02,590 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:05,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:10:05,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:05,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 102 [2019-09-10 02:10:05,823 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:05,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-10 02:10:05,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-10 02:10:05,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:10:05,825 INFO L87 Difference]: Start difference. First operand 173 states and 204 transitions. Second operand 84 states. [2019-09-10 02:10:06,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:06,426 INFO L93 Difference]: Finished difference Result 176 states and 209 transitions. [2019-09-10 02:10:06,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-10 02:10:06,426 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 172 [2019-09-10 02:10:06,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:06,427 INFO L225 Difference]: With dead ends: 176 [2019-09-10 02:10:06,427 INFO L226 Difference]: Without dead ends: 176 [2019-09-10 02:10:06,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 263 SyntacticMatches, 64 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3168 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:10:06,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-10 02:10:06,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2019-09-10 02:10:06,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-10 02:10:06,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 207 transitions. [2019-09-10 02:10:06,430 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 207 transitions. Word has length 172 [2019-09-10 02:10:06,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:06,431 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 207 transitions. [2019-09-10 02:10:06,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-10 02:10:06,431 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 207 transitions. [2019-09-10 02:10:06,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-10 02:10:06,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:06,432 INFO L399 BasicCegarLoop]: trace histogram [82, 50, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:10:06,432 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:06,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:06,433 INFO L82 PathProgramCache]: Analyzing trace with hash 293632833, now seen corresponding path program 64 times [2019-09-10 02:10:06,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:06,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:06,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:10:06,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:06,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:08,800 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:10:08,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:08,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:08,801 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:08,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:08,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:08,801 INFO 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-10 02:10:08,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:10:08,813 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:10:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:08,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-10 02:10:08,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:08,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:10:08,891 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:12,187 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:10:12,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:12,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 102 [2019-09-10 02:10:12,191 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:12,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-10 02:10:12,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-10 02:10:12,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:10:12,192 INFO L87 Difference]: Start difference. First operand 175 states and 207 transitions. Second operand 85 states. [2019-09-10 02:10:12,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:12,843 INFO L93 Difference]: Finished difference Result 178 states and 212 transitions. [2019-09-10 02:10:12,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-10 02:10:12,844 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 174 [2019-09-10 02:10:12,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:12,845 INFO L225 Difference]: With dead ends: 178 [2019-09-10 02:10:12,845 INFO L226 Difference]: Without dead ends: 178 [2019-09-10 02:10:12,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 266 SyntacticMatches, 66 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3267 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:10:12,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-10 02:10:12,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-09-10 02:10:12,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-10 02:10:12,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 210 transitions. [2019-09-10 02:10:12,850 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 210 transitions. Word has length 174 [2019-09-10 02:10:12,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:12,851 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 210 transitions. [2019-09-10 02:10:12,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-10 02:10:12,851 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 210 transitions. [2019-09-10 02:10:12,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 02:10:12,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:12,852 INFO L399 BasicCegarLoop]: trace histogram [83, 50, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:10:12,852 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:12,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:12,852 INFO L82 PathProgramCache]: Analyzing trace with hash -183651332, now seen corresponding path program 65 times [2019-09-10 02:10:12,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:12,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:12,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:10:12,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:12,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:15,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:10:15,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:15,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:15,323 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:15,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:15,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:15,323 INFO 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-10 02:10:15,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:10:15,335 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:10:15,415 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 68 check-sat command(s) [2019-09-10 02:10:15,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:10:15,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 02:10:15,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:15,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3350 proven. 1089 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-10 02:10:15,444 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:17,368 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3350 proven. 1089 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-10 02:10:17,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:17,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 36, 36] total 102 [2019-09-10 02:10:17,372 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:17,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-10 02:10:17,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-10 02:10:17,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:10:17,374 INFO L87 Difference]: Start difference. First operand 177 states and 210 transitions. Second operand 86 states. [2019-09-10 02:10:17,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:17,902 INFO L93 Difference]: Finished difference Result 180 states and 215 transitions. [2019-09-10 02:10:17,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-10 02:10:17,903 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 176 [2019-09-10 02:10:17,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:17,904 INFO L225 Difference]: With dead ends: 180 [2019-09-10 02:10:17,904 INFO L226 Difference]: Without dead ends: 180 [2019-09-10 02:10:17,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 319 SyntacticMatches, 18 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:10:17,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-10 02:10:17,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2019-09-10 02:10:17,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-09-10 02:10:17,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 213 transitions. [2019-09-10 02:10:17,907 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 213 transitions. Word has length 176 [2019-09-10 02:10:17,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:17,908 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 213 transitions. [2019-09-10 02:10:17,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-10 02:10:17,908 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 213 transitions. [2019-09-10 02:10:17,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 02:10:17,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:17,909 INFO L399 BasicCegarLoop]: trace histogram [84, 50, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:10:17,909 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:17,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:17,910 INFO L82 PathProgramCache]: Analyzing trace with hash 707766775, now seen corresponding path program 66 times [2019-09-10 02:10:17,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:17,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:17,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:10:17,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:17,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:20,435 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:10:20,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:20,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:20,435 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:20,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:20,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:20,436 INFO 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-10 02:10:20,447 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:10:20,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:10:20,498 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:10:20,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:10:20,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-10 02:10:20,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:20,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:10:20,541 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:23,926 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:10:23,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:23,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 102 [2019-09-10 02:10:23,930 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:23,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-10 02:10:23,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-10 02:10:23,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:10:23,932 INFO L87 Difference]: Start difference. First operand 179 states and 213 transitions. Second operand 87 states. [2019-09-10 02:10:24,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:24,576 INFO L93 Difference]: Finished difference Result 182 states and 218 transitions. [2019-09-10 02:10:24,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-10 02:10:24,577 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 178 [2019-09-10 02:10:24,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:24,578 INFO L225 Difference]: With dead ends: 182 [2019-09-10 02:10:24,578 INFO L226 Difference]: Without dead ends: 182 [2019-09-10 02:10:24,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 272 SyntacticMatches, 70 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3465 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:10:24,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-10 02:10:24,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-09-10 02:10:24,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-10 02:10:24,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 216 transitions. [2019-09-10 02:10:24,582 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 216 transitions. Word has length 178 [2019-09-10 02:10:24,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:24,582 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 216 transitions. [2019-09-10 02:10:24,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-10 02:10:24,582 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 216 transitions. [2019-09-10 02:10:24,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 02:10:24,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:24,584 INFO L399 BasicCegarLoop]: trace histogram [85, 50, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:10:24,584 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:24,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:24,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1632891598, now seen corresponding path program 67 times [2019-09-10 02:10:24,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:24,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:24,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:10:24,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:24,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:27,119 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:10:27,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:27,120 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:27,120 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:27,120 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:27,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:27,120 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10 02:10:27,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:10:27,130 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:10:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:27,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 87 conjunts are in the unsatisfiable core [2019-09-10 02:10:27,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:27,224 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:10:27,224 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:30,519 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:10:30,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:30,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 102 [2019-09-10 02:10:30,524 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:30,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-10 02:10:30,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-10 02:10:30,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:10:30,525 INFO L87 Difference]: Start difference. First operand 181 states and 216 transitions. Second operand 88 states. [2019-09-10 02:10:31,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:31,191 INFO L93 Difference]: Finished difference Result 184 states and 221 transitions. [2019-09-10 02:10:31,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-10 02:10:31,191 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 180 [2019-09-10 02:10:31,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:31,192 INFO L225 Difference]: With dead ends: 184 [2019-09-10 02:10:31,192 INFO L226 Difference]: Without dead ends: 184 [2019-09-10 02:10:31,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 275 SyntacticMatches, 72 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3564 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:10:31,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-10 02:10:31,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2019-09-10 02:10:31,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-10 02:10:31,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 219 transitions. [2019-09-10 02:10:31,196 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 219 transitions. Word has length 180 [2019-09-10 02:10:31,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:31,197 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 219 transitions. [2019-09-10 02:10:31,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-10 02:10:31,197 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 219 transitions. [2019-09-10 02:10:31,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 02:10:31,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:31,198 INFO L399 BasicCegarLoop]: trace histogram [86, 50, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:10:31,198 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:31,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:31,199 INFO L82 PathProgramCache]: Analyzing trace with hash -442724947, now seen corresponding path program 68 times [2019-09-10 02:10:31,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:31,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:31,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:10:31,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:31,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:33,772 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:10:33,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:33,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:33,772 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:33,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:33,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:33,773 INFO 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-10 02:10:33,782 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:10:33,782 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:10:33,870 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 74 check-sat command(s) [2019-09-10 02:10:33,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:10:33,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-10 02:10:33,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:33,890 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3650 proven. 1296 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-10 02:10:33,890 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:35,906 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3650 proven. 1296 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-10 02:10:35,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:35,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 39, 39] total 102 [2019-09-10 02:10:35,910 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:35,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-10 02:10:35,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-10 02:10:35,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:10:35,911 INFO L87 Difference]: Start difference. First operand 183 states and 219 transitions. Second operand 89 states. [2019-09-10 02:10:36,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:36,573 INFO L93 Difference]: Finished difference Result 186 states and 224 transitions. [2019-09-10 02:10:36,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-10 02:10:36,573 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 182 [2019-09-10 02:10:36,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:36,574 INFO L225 Difference]: With dead ends: 186 [2019-09-10 02:10:36,574 INFO L226 Difference]: Without dead ends: 186 [2019-09-10 02:10:36,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 328 SyntacticMatches, 24 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:10:36,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-10 02:10:36,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-09-10 02:10:36,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-09-10 02:10:36,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 222 transitions. [2019-09-10 02:10:36,578 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 222 transitions. Word has length 182 [2019-09-10 02:10:36,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:36,578 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 222 transitions. [2019-09-10 02:10:36,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-10 02:10:36,578 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 222 transitions. [2019-09-10 02:10:36,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 02:10:36,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:36,580 INFO L399 BasicCegarLoop]: trace histogram [87, 50, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:10:36,580 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:36,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:36,580 INFO L82 PathProgramCache]: Analyzing trace with hash 846125928, now seen corresponding path program 69 times [2019-09-10 02:10:36,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:36,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:36,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:10:36,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:36,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:39,258 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:10:39,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:39,259 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:39,259 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:39,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:39,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:39,259 INFO 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-10 02:10:39,269 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:10:39,269 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:10:39,321 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:10:39,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:10:39,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-10 02:10:39,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:39,351 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:10:39,351 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:42,631 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:10:42,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:42,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 102 [2019-09-10 02:10:42,634 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:42,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-10 02:10:42,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-10 02:10:42,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:10:42,636 INFO L87 Difference]: Start difference. First operand 185 states and 222 transitions. Second operand 90 states. [2019-09-10 02:10:43,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:43,263 INFO L93 Difference]: Finished difference Result 188 states and 227 transitions. [2019-09-10 02:10:43,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-10 02:10:43,263 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 184 [2019-09-10 02:10:43,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:43,265 INFO L225 Difference]: With dead ends: 188 [2019-09-10 02:10:43,265 INFO L226 Difference]: Without dead ends: 188 [2019-09-10 02:10:43,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 281 SyntacticMatches, 76 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3762 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:10:43,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-10 02:10:43,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2019-09-10 02:10:43,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-09-10 02:10:43,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 225 transitions. [2019-09-10 02:10:43,268 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 225 transitions. Word has length 184 [2019-09-10 02:10:43,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:43,269 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 225 transitions. [2019-09-10 02:10:43,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-10 02:10:43,269 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 225 transitions. [2019-09-10 02:10:43,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 02:10:43,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:43,270 INFO L399 BasicCegarLoop]: trace histogram [88, 50, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:10:43,270 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:43,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:43,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1813731741, now seen corresponding path program 70 times [2019-09-10 02:10:43,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:43,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:43,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:10:43,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:43,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:46,246 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:10:46,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:46,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:46,246 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:46,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:46,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:46,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10 02:10:46,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:10:46,256 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:10:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:46,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-10 02:10:46,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:46,339 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:10:46,339 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:49,650 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:10:49,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:49,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 102 [2019-09-10 02:10:49,661 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:49,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-10 02:10:49,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-10 02:10:49,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:10:49,663 INFO L87 Difference]: Start difference. First operand 187 states and 225 transitions. Second operand 91 states. [2019-09-10 02:10:50,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:50,452 INFO L93 Difference]: Finished difference Result 190 states and 230 transitions. [2019-09-10 02:10:50,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-10 02:10:50,453 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 186 [2019-09-10 02:10:50,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:50,454 INFO L225 Difference]: With dead ends: 190 [2019-09-10 02:10:50,454 INFO L226 Difference]: Without dead ends: 190 [2019-09-10 02:10:50,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 284 SyntacticMatches, 78 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3861 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:10:50,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-10 02:10:50,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-09-10 02:10:50,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-10 02:10:50,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 228 transitions. [2019-09-10 02:10:50,458 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 228 transitions. Word has length 186 [2019-09-10 02:10:50,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:50,458 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 228 transitions. [2019-09-10 02:10:50,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-10 02:10:50,458 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 228 transitions. [2019-09-10 02:10:50,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 02:10:50,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:50,460 INFO L399 BasicCegarLoop]: trace histogram [89, 50, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:10:50,460 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:50,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:50,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1863556766, now seen corresponding path program 71 times [2019-09-10 02:10:50,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:50,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:50,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:10:50,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:50,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:53,201 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:10:53,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:53,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:53,202 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:53,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:53,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:53,202 INFO 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-10 02:10:53,214 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:10:53,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:10:53,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 80 check-sat command(s) [2019-09-10 02:10:53,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:10:53,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-10 02:10:53,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:53,346 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 3950 proven. 1521 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-10 02:10:53,346 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:55,485 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 3950 proven. 1521 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-10 02:10:55,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:55,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 42, 42] total 102 [2019-09-10 02:10:55,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:55,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-10 02:10:55,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-10 02:10:55,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:10:55,490 INFO L87 Difference]: Start difference. First operand 189 states and 228 transitions. Second operand 92 states. [2019-09-10 02:10:56,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:56,198 INFO L93 Difference]: Finished difference Result 192 states and 233 transitions. [2019-09-10 02:10:56,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-10 02:10:56,198 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 188 [2019-09-10 02:10:56,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:56,199 INFO L225 Difference]: With dead ends: 192 [2019-09-10 02:10:56,199 INFO L226 Difference]: Without dead ends: 192 [2019-09-10 02:10:56,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 337 SyntacticMatches, 30 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:10:56,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-10 02:10:56,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2019-09-10 02:10:56,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-10 02:10:56,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 231 transitions. [2019-09-10 02:10:56,202 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 231 transitions. Word has length 188 [2019-09-10 02:10:56,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:56,202 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 231 transitions. [2019-09-10 02:10:56,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-09-10 02:10:56,203 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 231 transitions. [2019-09-10 02:10:56,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 02:10:56,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:56,204 INFO L399 BasicCegarLoop]: trace histogram [90, 50, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:10:56,204 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:56,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:56,204 INFO L82 PathProgramCache]: Analyzing trace with hash 979727385, now seen corresponding path program 72 times [2019-09-10 02:10:56,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:56,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:56,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:10:56,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:56,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:59,079 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:10:59,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:59,079 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:59,079 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:59,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:59,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:59,080 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:10:59,090 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:10:59,090 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:10:59,146 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:10:59,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:10:59,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-10 02:10:59,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:59,176 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:10:59,177 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:11:02,501 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:11:02,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:11:02,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 102 [2019-09-10 02:11:02,504 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:11:02,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-10 02:11:02,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-10 02:11:02,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:11:02,506 INFO L87 Difference]: Start difference. First operand 191 states and 231 transitions. Second operand 93 states. [2019-09-10 02:11:03,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:11:03,367 INFO L93 Difference]: Finished difference Result 194 states and 236 transitions. [2019-09-10 02:11:03,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-10 02:11:03,367 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 190 [2019-09-10 02:11:03,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:11:03,368 INFO L225 Difference]: With dead ends: 194 [2019-09-10 02:11:03,368 INFO L226 Difference]: Without dead ends: 194 [2019-09-10 02:11:03,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 290 SyntacticMatches, 82 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4059 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:11:03,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-09-10 02:11:03,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-09-10 02:11:03,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-09-10 02:11:03,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 234 transitions. [2019-09-10 02:11:03,370 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 234 transitions. Word has length 190 [2019-09-10 02:11:03,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:11:03,371 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 234 transitions. [2019-09-10 02:11:03,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-10 02:11:03,371 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 234 transitions. [2019-09-10 02:11:03,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 02:11:03,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:11:03,372 INFO L399 BasicCegarLoop]: trace histogram [91, 50, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:11:03,372 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:11:03,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:11:03,372 INFO L82 PathProgramCache]: Analyzing trace with hash 2023216852, now seen corresponding path program 73 times [2019-09-10 02:11:03,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:11:03,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:03,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:11:03,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:03,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:11:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:06,307 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:11:06,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:06,307 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:11:06,307 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:11:06,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:11:06,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:06,307 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:11:06,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:11:06,318 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:11:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:06,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-10 02:11:06,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:11:06,407 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:11:06,407 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:11:09,720 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:11:09,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:11:09,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 102 [2019-09-10 02:11:09,723 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:11:09,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-10 02:11:09,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-10 02:11:09,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:11:09,724 INFO L87 Difference]: Start difference. First operand 193 states and 234 transitions. Second operand 94 states. [2019-09-10 02:11:10,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:11:10,427 INFO L93 Difference]: Finished difference Result 196 states and 239 transitions. [2019-09-10 02:11:10,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-10 02:11:10,428 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 192 [2019-09-10 02:11:10,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:11:10,428 INFO L225 Difference]: With dead ends: 196 [2019-09-10 02:11:10,429 INFO L226 Difference]: Without dead ends: 196 [2019-09-10 02:11:10,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 293 SyntacticMatches, 84 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4158 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:11:10,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-10 02:11:10,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2019-09-10 02:11:10,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-10 02:11:10,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 237 transitions. [2019-09-10 02:11:10,431 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 237 transitions. Word has length 192 [2019-09-10 02:11:10,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:11:10,431 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 237 transitions. [2019-09-10 02:11:10,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-09-10 02:11:10,432 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 237 transitions. [2019-09-10 02:11:10,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-10 02:11:10,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:11:10,432 INFO L399 BasicCegarLoop]: trace histogram [92, 50, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:11:10,433 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:11:10,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:11:10,433 INFO L82 PathProgramCache]: Analyzing trace with hash -205752625, now seen corresponding path program 74 times [2019-09-10 02:11:10,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:11:10,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:10,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:11:10,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:10,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:11:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:13,376 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:11:13,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:13,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:11:13,377 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:11:13,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:11:13,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:13,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:11:13,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:11:13,388 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:11:13,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 86 check-sat command(s) [2019-09-10 02:11:13,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:11:13,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-10 02:11:13,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:11:13,529 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 4250 proven. 1764 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-10 02:11:13,529 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:11:15,809 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 4250 proven. 1764 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-10 02:11:15,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:11:15,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 45, 45] total 102 [2019-09-10 02:11:15,813 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:11:15,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-10 02:11:15,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-10 02:11:15,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:11:15,814 INFO L87 Difference]: Start difference. First operand 195 states and 237 transitions. Second operand 95 states. [2019-09-10 02:11:16,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:11:16,488 INFO L93 Difference]: Finished difference Result 198 states and 242 transitions. [2019-09-10 02:11:16,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-10 02:11:16,488 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 194 [2019-09-10 02:11:16,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:11:16,490 INFO L225 Difference]: With dead ends: 198 [2019-09-10 02:11:16,490 INFO L226 Difference]: Without dead ends: 198 [2019-09-10 02:11:16,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 346 SyntacticMatches, 36 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:11:16,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-09-10 02:11:16,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2019-09-10 02:11:16,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-10 02:11:16,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 240 transitions. [2019-09-10 02:11:16,494 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 240 transitions. Word has length 194 [2019-09-10 02:11:16,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:11:16,495 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 240 transitions. [2019-09-10 02:11:16,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-10 02:11:16,495 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 240 transitions. [2019-09-10 02:11:16,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-10 02:11:16,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:11:16,496 INFO L399 BasicCegarLoop]: trace histogram [93, 50, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:11:16,496 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:11:16,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:11:16,497 INFO L82 PathProgramCache]: Analyzing trace with hash 943260682, now seen corresponding path program 75 times [2019-09-10 02:11:16,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:11:16,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:16,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:11:16,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:16,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:11:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:19,479 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 0 proven. 8649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:11:19,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:19,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:11:19,479 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:11:19,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:11:19,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:19,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:11:19,490 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:11:19,490 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:11:19,547 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:11:19,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:11:19,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-10 02:11:19,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:11:19,583 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 0 proven. 8649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:11:19,584 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:11:22,981 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 0 proven. 8649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:11:22,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:11:22,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 102 [2019-09-10 02:11:22,985 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:11:22,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-09-10 02:11:22,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-09-10 02:11:22,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:11:22,986 INFO L87 Difference]: Start difference. First operand 197 states and 240 transitions. Second operand 96 states. [2019-09-10 02:11:23,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:11:23,811 INFO L93 Difference]: Finished difference Result 200 states and 245 transitions. [2019-09-10 02:11:23,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-10 02:11:23,812 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 196 [2019-09-10 02:11:23,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:11:23,813 INFO L225 Difference]: With dead ends: 200 [2019-09-10 02:11:23,813 INFO L226 Difference]: Without dead ends: 200 [2019-09-10 02:11:23,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 299 SyntacticMatches, 88 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4356 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:11:23,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-10 02:11:23,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2019-09-10 02:11:23,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-10 02:11:23,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 243 transitions. [2019-09-10 02:11:23,816 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 243 transitions. Word has length 196 [2019-09-10 02:11:23,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:11:23,817 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 243 transitions. [2019-09-10 02:11:23,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-09-10 02:11:23,817 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 243 transitions. [2019-09-10 02:11:23,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-10 02:11:23,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:11:23,818 INFO L399 BasicCegarLoop]: trace histogram [94, 50, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:11:23,818 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:11:23,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:11:23,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1338453637, now seen corresponding path program 76 times [2019-09-10 02:11:23,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:11:23,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:23,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:11:23,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:23,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:11:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:26,914 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:11:26,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:26,914 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:11:26,914 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:11:26,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:11:26,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:26,914 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:11:26,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:11:26,925 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:11:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:26,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-10 02:11:26,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:11:27,020 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:11:27,020 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:11:30,356 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:11:30,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:11:30,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 102 [2019-09-10 02:11:30,360 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:11:30,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-10 02:11:30,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-10 02:11:30,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:11:30,361 INFO L87 Difference]: Start difference. First operand 199 states and 243 transitions. Second operand 97 states. [2019-09-10 02:11:31,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:11:31,050 INFO L93 Difference]: Finished difference Result 202 states and 248 transitions. [2019-09-10 02:11:31,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-10 02:11:31,050 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 198 [2019-09-10 02:11:31,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:11:31,051 INFO L225 Difference]: With dead ends: 202 [2019-09-10 02:11:31,051 INFO L226 Difference]: Without dead ends: 202 [2019-09-10 02:11:31,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 302 SyntacticMatches, 90 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4455 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:11:31,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-10 02:11:31,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-09-10 02:11:31,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-09-10 02:11:31,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 246 transitions. [2019-09-10 02:11:31,055 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 246 transitions. Word has length 198 [2019-09-10 02:11:31,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:11:31,055 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 246 transitions. [2019-09-10 02:11:31,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-10 02:11:31,055 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 246 transitions. [2019-09-10 02:11:31,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-10 02:11:31,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:11:31,056 INFO L399 BasicCegarLoop]: trace histogram [95, 50, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:11:31,056 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:11:31,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:11:31,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1133205952, now seen corresponding path program 77 times [2019-09-10 02:11:31,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:11:31,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:31,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:11:31,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:31,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:11:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:34,209 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 0 proven. 9025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:11:34,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:34,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:11:34,210 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:11:34,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:11:34,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:34,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:11:34,219 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:11:34,220 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:11:34,338 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 92 check-sat command(s) [2019-09-10 02:11:34,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:11:34,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-10 02:11:34,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:11:34,363 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4550 proven. 2025 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-10 02:11:34,364 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:11:36,732 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4550 proven. 2025 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-10 02:11:36,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:11:36,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 48, 48] total 102 [2019-09-10 02:11:36,735 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:11:36,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-09-10 02:11:36,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-09-10 02:11:36,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:11:36,737 INFO L87 Difference]: Start difference. First operand 201 states and 246 transitions. Second operand 98 states. [2019-09-10 02:11:37,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:11:37,561 INFO L93 Difference]: Finished difference Result 204 states and 251 transitions. [2019-09-10 02:11:37,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-10 02:11:37,561 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 200 [2019-09-10 02:11:37,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:11:37,562 INFO L225 Difference]: With dead ends: 204 [2019-09-10 02:11:37,562 INFO L226 Difference]: Without dead ends: 204 [2019-09-10 02:11:37,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 355 SyntacticMatches, 42 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:11:37,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-09-10 02:11:37,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2019-09-10 02:11:37,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-10 02:11:37,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 249 transitions. [2019-09-10 02:11:37,565 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 249 transitions. Word has length 200 [2019-09-10 02:11:37,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:11:37,566 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 249 transitions. [2019-09-10 02:11:37,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-09-10 02:11:37,566 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 249 transitions. [2019-09-10 02:11:37,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-10 02:11:37,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:11:37,567 INFO L399 BasicCegarLoop]: trace histogram [96, 50, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:11:37,567 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:11:37,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:11:37,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1281156293, now seen corresponding path program 78 times [2019-09-10 02:11:37,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:11:37,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:37,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:11:37,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:37,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:11:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:40,796 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:11:40,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:40,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:11:40,796 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:11:40,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:11:40,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:40,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:11:40,807 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:11:40,807 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:11:40,867 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:11:40,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:11:40,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-10 02:11:40,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:11:40,903 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:11:40,903 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:11:44,235 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:11:44,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:11:44,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 102 [2019-09-10 02:11:44,239 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:11:44,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-10 02:11:44,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-10 02:11:44,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:11:44,241 INFO L87 Difference]: Start difference. First operand 203 states and 249 transitions. Second operand 99 states. [2019-09-10 02:11:45,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:11:45,163 INFO L93 Difference]: Finished difference Result 206 states and 254 transitions. [2019-09-10 02:11:45,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-10 02:11:45,164 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 202 [2019-09-10 02:11:45,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:11:45,165 INFO L225 Difference]: With dead ends: 206 [2019-09-10 02:11:45,165 INFO L226 Difference]: Without dead ends: 206 [2019-09-10 02:11:45,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 308 SyntacticMatches, 94 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4653 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:11:45,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-10 02:11:45,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-09-10 02:11:45,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-10 02:11:45,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 252 transitions. [2019-09-10 02:11:45,167 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 252 transitions. Word has length 202 [2019-09-10 02:11:45,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:11:45,168 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 252 transitions. [2019-09-10 02:11:45,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-10 02:11:45,168 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 252 transitions. [2019-09-10 02:11:45,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-10 02:11:45,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:11:45,169 INFO L399 BasicCegarLoop]: trace histogram [97, 50, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:11:45,169 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:11:45,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:11:45,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1727513226, now seen corresponding path program 79 times [2019-09-10 02:11:45,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:11:45,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:45,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:11:45,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:45,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:11:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:48,403 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 0 proven. 9409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:11:48,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:48,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:11:48,404 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:11:48,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:11:48,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:48,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:11:48,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:11:48,417 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:11:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:48,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 99 conjunts are in the unsatisfiable core [2019-09-10 02:11:48,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:11:48,511 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 0 proven. 9409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:11:48,511 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:11:51,871 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 0 proven. 9409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:11:51,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:11:51,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 102 [2019-09-10 02:11:51,875 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:11:51,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-09-10 02:11:51,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-09-10 02:11:51,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:11:51,877 INFO L87 Difference]: Start difference. First operand 205 states and 252 transitions. Second operand 100 states. [2019-09-10 02:11:52,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:11:52,607 INFO L93 Difference]: Finished difference Result 208 states and 257 transitions. [2019-09-10 02:11:52,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-10 02:11:52,607 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 204 [2019-09-10 02:11:52,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:11:52,608 INFO L225 Difference]: With dead ends: 208 [2019-09-10 02:11:52,608 INFO L226 Difference]: Without dead ends: 208 [2019-09-10 02:11:52,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 311 SyntacticMatches, 96 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4752 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:11:52,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-10 02:11:52,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2019-09-10 02:11:52,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-09-10 02:11:52,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 255 transitions. [2019-09-10 02:11:52,611 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 255 transitions. Word has length 204 [2019-09-10 02:11:52,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:11:52,611 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 255 transitions. [2019-09-10 02:11:52,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-09-10 02:11:52,611 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 255 transitions. [2019-09-10 02:11:52,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-10 02:11:52,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:11:52,612 INFO L399 BasicCegarLoop]: trace histogram [98, 50, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:11:52,612 INFO L418 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:11:52,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:11:52,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1179796239, now seen corresponding path program 80 times [2019-09-10 02:11:52,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:11:52,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:52,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:11:52,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:52,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:11:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:55,931 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:11:55,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:55,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:11:55,932 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:11:55,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:11:55,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:55,932 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:11:55,942 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:11:55,943 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:11:56,074 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 98 check-sat command(s) [2019-09-10 02:11:56,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:11:56,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-10 02:11:56,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:11:56,101 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 4850 proven. 2304 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-10 02:11:56,101 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:11:58,578 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 4850 proven. 2304 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-10 02:11:58,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:11:58,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 51, 51] total 102 [2019-09-10 02:11:58,582 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:11:58,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-10 02:11:58,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-10 02:11:58,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:11:58,584 INFO L87 Difference]: Start difference. First operand 207 states and 255 transitions. Second operand 101 states. [2019-09-10 02:11:59,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:11:59,523 INFO L93 Difference]: Finished difference Result 210 states and 260 transitions. [2019-09-10 02:11:59,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-10 02:11:59,523 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 206 [2019-09-10 02:11:59,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:11:59,524 INFO L225 Difference]: With dead ends: 210 [2019-09-10 02:11:59,525 INFO L226 Difference]: Without dead ends: 210 [2019-09-10 02:11:59,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 364 SyntacticMatches, 48 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:11:59,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-10 02:11:59,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2019-09-10 02:11:59,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-09-10 02:11:59,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 258 transitions. [2019-09-10 02:11:59,527 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 258 transitions. Word has length 206 [2019-09-10 02:11:59,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:11:59,527 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 258 transitions. [2019-09-10 02:11:59,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-10 02:11:59,528 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 258 transitions. [2019-09-10 02:11:59,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-10 02:11:59,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:11:59,529 INFO L399 BasicCegarLoop]: trace histogram [99, 50, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:11:59,529 INFO L418 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:11:59,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:11:59,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1190218156, now seen corresponding path program 81 times [2019-09-10 02:11:59,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:11:59,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:59,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:11:59,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:59,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:11:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:12:02,992 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:12:02,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:02,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:12:02,993 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:12:02,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:12:02,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:02,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:12:03,003 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:12:03,003 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:12:03,070 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:12:03,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:12:03,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-10 02:12:03,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:12:03,106 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:12:03,106 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:12:06,456 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:12:06,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:12:06,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 102 [2019-09-10 02:12:06,460 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:12:06,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-10 02:12:06,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-10 02:12:06,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:12:06,461 INFO L87 Difference]: Start difference. First operand 209 states and 258 transitions. Second operand 102 states. [2019-09-10 02:12:07,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:12:07,355 INFO L93 Difference]: Finished difference Result 211 states and 261 transitions. [2019-09-10 02:12:07,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-10 02:12:07,355 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 208 [2019-09-10 02:12:07,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:12:07,356 INFO L225 Difference]: With dead ends: 211 [2019-09-10 02:12:07,356 INFO L226 Difference]: Without dead ends: 211 [2019-09-10 02:12:07,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 317 SyntacticMatches, 100 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4950 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:12:07,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-10 02:12:07,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-09-10 02:12:07,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-10 02:12:07,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 261 transitions. [2019-09-10 02:12:07,360 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 261 transitions. Word has length 208 [2019-09-10 02:12:07,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:12:07,360 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 261 transitions. [2019-09-10 02:12:07,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-10 02:12:07,361 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 261 transitions. [2019-09-10 02:12:07,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 02:12:07,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:12:07,362 INFO L399 BasicCegarLoop]: trace histogram [100, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:12:07,362 INFO L418 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:12:07,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:12:07,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1853582425, now seen corresponding path program 82 times [2019-09-10 02:12:07,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:12:07,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:07,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:12:07,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:07,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:12:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:12:09,070 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2019-09-10 02:12:09,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:09,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:12:09,071 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:12:09,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:12:09,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:09,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:12:09,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:12:09,080 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:12:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:12:09,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-10 02:12:09,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:12:09,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:12:09,416 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2019-09-10 02:12:09,416 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:12:09,610 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2019-09-10 02:12:09,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:12:09,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 57 [2019-09-10 02:12:09,614 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:12:09,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-10 02:12:09,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-10 02:12:09,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3079, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 02:12:09,615 INFO L87 Difference]: Start difference. First operand 211 states and 261 transitions. Second operand 57 states. [2019-09-10 02:12:11,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:12:11,477 INFO L93 Difference]: Finished difference Result 2865 states and 4240 transitions. [2019-09-10 02:12:11,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-10 02:12:11,478 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 210 [2019-09-10 02:12:11,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:12:11,489 INFO L225 Difference]: With dead ends: 2865 [2019-09-10 02:12:11,489 INFO L226 Difference]: Without dead ends: 2862 [2019-09-10 02:12:11,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 415 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=119, Invalid=3187, Unknown=0, NotChecked=0, Total=3306 [2019-09-10 02:12:11,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2019-09-10 02:12:11,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 213. [2019-09-10 02:12:11,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-09-10 02:12:11,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 264 transitions. [2019-09-10 02:12:11,503 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 264 transitions. Word has length 210 [2019-09-10 02:12:11,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:12:11,503 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 264 transitions. [2019-09-10 02:12:11,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-10 02:12:11,503 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 264 transitions. [2019-09-10 02:12:11,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-10 02:12:11,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:12:11,504 INFO L399 BasicCegarLoop]: trace histogram [101, 51, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:12:11,505 INFO L418 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:12:11,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:12:11,505 INFO L82 PathProgramCache]: Analyzing trace with hash -2073212190, now seen corresponding path program 83 times [2019-09-10 02:12:11,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:12:11,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:11,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:12:11,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:11,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:12:11,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:12:12,927 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 7651 proven. 0 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2019-09-10 02:12:12,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:12:12,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2019-09-10 02:12:12,927 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:12:12,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-10 02:12:12,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-10 02:12:12,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:12:12,929 INFO L87 Difference]: Start difference. First operand 213 states and 264 transitions. Second operand 52 states. [2019-09-10 02:12:13,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:12:13,167 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2019-09-10 02:12:13,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-10 02:12:13,168 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 212 [2019-09-10 02:12:13,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:12:13,168 INFO L225 Difference]: With dead ends: 206 [2019-09-10 02:12:13,169 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:12:13,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:12:13,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:12:13,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:12:13,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:12:13,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:12:13,170 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 212 [2019-09-10 02:12:13,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:12:13,170 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:12:13,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-10 02:12:13,170 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:12:13,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:12:13,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:12:13 BoogieIcfgContainer [2019-09-10 02:12:13,177 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:12:13,179 INFO L168 Benchmark]: Toolchain (without parser) took 268127.81 ms. Allocated memory was 133.2 MB in the beginning and 447.2 MB in the end (delta: 314.0 MB). Free memory was 89.9 MB in the beginning and 334.1 MB in the end (delta: -244.3 MB). Peak memory consumption was 69.8 MB. Max. memory is 7.1 GB. [2019-09-10 02:12:13,185 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 133.2 MB. Free memory was 107.6 MB in the beginning and 107.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 02:12:13,188 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.85 ms. Allocated memory is still 133.2 MB. Free memory was 89.6 MB in the beginning and 80.5 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-09-10 02:12:13,188 INFO L168 Benchmark]: Boogie Preprocessor took 123.61 ms. Allocated memory was 133.2 MB in the beginning and 196.6 MB in the end (delta: 63.4 MB). Free memory was 80.5 MB in the beginning and 174.2 MB in the end (delta: -93.7 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. [2019-09-10 02:12:13,189 INFO L168 Benchmark]: RCFGBuilder took 215.91 ms. Allocated memory is still 196.6 MB. Free memory was 174.2 MB in the beginning and 162.9 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2019-09-10 02:12:13,189 INFO L168 Benchmark]: TraceAbstraction took 267521.98 ms. Allocated memory was 196.6 MB in the beginning and 447.2 MB in the end (delta: 250.6 MB). Free memory was 162.9 MB in the beginning and 334.1 MB in the end (delta: -171.2 MB). Peak memory consumption was 79.4 MB. Max. memory is 7.1 GB. [2019-09-10 02:12:13,195 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 133.2 MB. Free memory was 107.6 MB in the beginning and 107.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 261.85 ms. Allocated memory is still 133.2 MB. Free memory was 89.6 MB in the beginning and 80.5 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 123.61 ms. Allocated memory was 133.2 MB in the beginning and 196.6 MB in the end (delta: 63.4 MB). Free memory was 80.5 MB in the beginning and 174.2 MB in the end (delta: -93.7 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 215.91 ms. Allocated memory is still 196.6 MB. Free memory was 174.2 MB in the beginning and 162.9 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 267521.98 ms. Allocated memory was 196.6 MB in the beginning and 447.2 MB in the end (delta: 250.6 MB). Free memory was 162.9 MB in the beginning and 334.1 MB in the end (delta: -171.2 MB). Peak memory consumption was 79.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. SAFE Result, 267.4s OverallTime, 86 OverallIterations, 101 TraceHistogramMax, 29.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1003 SDtfs, 3333 SDslu, 23116 SDs, 0 SdLazy, 15779 SolverSat, 5424 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23762 GetRequests, 16316 SyntacticMatches, 2130 SemanticMatches, 5316 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88588 ImplicationChecksByTransitivity, 223.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred in iteration=85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 0.36363636363636365 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 86 MinimizatonAttempts, 2698 StatesRemovedByMinimization, 48 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 4.3s SatisfiabilityAnalysisTime, 229.7s InterpolantComputationTime, 19824 NumberOfCodeBlocks, 19022 NumberOfCodeBlocksAsserted, 1250 NumberOfCheckSat, 29364 ConstructedInterpolants, 0 QuantifiedInterpolants, 11411364 SizeOfPredicates, 77 NumberOfNonLiveVariables, 21524 ConjunctsInSsa, 3404 ConjunctsInUnsatCore, 250 InterpolantComputations, 3 PerfectInterpolantSequences, 275404/950081 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...