java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-acceleration/simple_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 12:58:53,989 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 12:58:53,991 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 12:58:54,003 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 12:58:54,003 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 12:58:54,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 12:58:54,005 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 12:58:54,007 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 12:58:54,009 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 12:58:54,010 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 12:58:54,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 12:58:54,012 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 12:58:54,012 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 12:58:54,013 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 12:58:54,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 12:58:54,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 12:58:54,015 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 12:58:54,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 12:58:54,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 12:58:54,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 12:58:54,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 12:58:54,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 12:58:54,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 12:58:54,024 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 12:58:54,026 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 12:58:54,026 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 12:58:54,027 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 12:58:54,027 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 12:58:54,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 12:58:54,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 12:58:54,029 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 12:58:54,030 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 12:58:54,030 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 12:58:54,031 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 12:58:54,032 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 12:58:54,032 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 12:58:54,033 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 12:58:54,033 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 12:58:54,033 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 12:58:54,034 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 12:58:54,035 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 12:58:54,036 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-05 12:58:54,051 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 12:58:54,051 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 12:58:54,051 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-05 12:58:54,051 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-05 12:58:54,052 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-05 12:58:54,052 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-05 12:58:54,052 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-05 12:58:54,053 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-05 12:58:54,053 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-05 12:58:54,054 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-05 12:58:54,055 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 12:58:54,055 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 12:58:54,055 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 12:58:54,055 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 12:58:54,056 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 12:58:54,056 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 12:58:54,056 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 12:58:54,057 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 12:58:54,057 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 12:58:54,057 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 12:58:54,058 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 12:58:54,058 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-05 12:58:54,058 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 12:58:54,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 12:58:54,059 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 12:58:54,059 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 12:58:54,059 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-05 12:58:54,059 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 12:58:54,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 12:58:54,060 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-05 12:58:54,112 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 12:58:54,125 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 12:58:54,128 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 12:58:54,129 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 12:58:54,130 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 12:58:54,130 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_1-2.c [2019-09-05 12:58:54,186 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e459e5b2/0ebd5564651244258d41f0c5fe039d2f/FLAGb775a33c1 [2019-09-05 12:58:54,594 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 12:58:54,595 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_1-2.c [2019-09-05 12:58:54,600 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e459e5b2/0ebd5564651244258d41f0c5fe039d2f/FLAGb775a33c1 [2019-09-05 12:58:55,006 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e459e5b2/0ebd5564651244258d41f0c5fe039d2f [2019-09-05 12:58:55,016 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 12:58:55,017 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 12:58:55,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 12:58:55,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 12:58:55,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 12:58:55,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:58:55" (1/1) ... [2019-09-05 12:58:55,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6595b9fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:58:55, skipping insertion in model container [2019-09-05 12:58:55,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:58:55" (1/1) ... [2019-09-05 12:58:55,034 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 12:58:55,049 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 12:58:55,253 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 12:58:55,263 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 12:58:55,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 12:58:55,299 INFO L192 MainTranslator]: Completed translation [2019-09-05 12:58:55,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:58:55 WrapperNode [2019-09-05 12:58:55,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 12:58:55,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 12:58:55,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 12:58:55,301 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 12:58:55,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:58:55" (1/1) ... [2019-09-05 12:58:55,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:58:55" (1/1) ... [2019-09-05 12:58:55,468 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:58:55" (1/1) ... [2019-09-05 12:58:55,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:58:55" (1/1) ... [2019-09-05 12:58:55,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:58:55" (1/1) ... [2019-09-05 12:58:55,477 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:58:55" (1/1) ... [2019-09-05 12:58:55,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:58:55" (1/1) ... [2019-09-05 12:58:55,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 12:58:55,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 12:58:55,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 12:58:55,480 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 12:58:55,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:58:55" (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-05 12:58:55,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 12:58:55,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 12:58:55,547 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 12:58:55,547 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 12:58:55,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 12:58:55,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 12:58:55,547 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 12:58:55,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 12:58:55,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 12:58:55,687 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 12:58:55,688 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-05 12:58:55,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:58:55 BoogieIcfgContainer [2019-09-05 12:58:55,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 12:58:55,690 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 12:58:55,690 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 12:58:55,692 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 12:58:55,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 12:58:55" (1/3) ... [2019-09-05 12:58:55,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e9984dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:58:55, skipping insertion in model container [2019-09-05 12:58:55,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:58:55" (2/3) ... [2019-09-05 12:58:55,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e9984dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:58:55, skipping insertion in model container [2019-09-05 12:58:55,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:58:55" (3/3) ... [2019-09-05 12:58:55,696 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_1-2.c [2019-09-05 12:58:55,705 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 12:58:55,712 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 12:58:55,727 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 12:58:55,754 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 12:58:55,754 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-05 12:58:55,754 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 12:58:55,755 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 12:58:55,755 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 12:58:55,755 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 12:58:55,755 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 12:58:55,755 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 12:58:55,769 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-09-05 12:58:55,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 12:58:55,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:58:55,779 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:58:55,781 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:58:55,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:58:55,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2019-09-05 12:58:55,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:58:55,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:58:55,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:58:55,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:58:55,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:58:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:58:55,988 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-05 12:58:55,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:58:55,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 12:58:55,993 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:58:56,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 12:58:56,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 12:58:56,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 12:58:56,026 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-09-05 12:58:56,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:58:56,073 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-05 12:58:56,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 12:58:56,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-05 12:58:56,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:58:56,084 INFO L225 Difference]: With dead ends: 18 [2019-09-05 12:58:56,085 INFO L226 Difference]: Without dead ends: 12 [2019-09-05 12:58:56,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 12:58:56,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-05 12:58:56,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-05 12:58:56,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-05 12:58:56,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-05 12:58:56,139 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-05 12:58:56,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:58:56,140 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-05 12:58:56,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 12:58:56,140 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-05 12:58:56,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-05 12:58:56,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:58:56,141 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:58:56,141 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:58:56,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:58:56,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2019-09-05 12:58:56,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:58:56,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:58:56,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:58:56,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:58:56,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:58:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:58:56,258 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-05 12:58:56,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:58:56,259 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:58:56,260 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2019-09-05 12:58:56,261 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [19], [22], [24], [30], [31], [32], [34] [2019-09-05 12:58:56,294 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 12:58:56,294 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 12:58:56,345 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-05 12:58:56,766 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 12:58:56,769 INFO L272 AbstractInterpreter]: Visited 11 different actions 41 times. Merged at 2 different actions 10 times. Widened at 1 different actions 3 times. Performed 55 root evaluator evaluations with a maximum evaluation depth of 13. Performed 55 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2019-09-05 12:58:56,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:58:56,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 12:58:56,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:58:56,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 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:58:56,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:58:56,804 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:58:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:58:56,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-05 12:58:56,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:58:56,875 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-05 12:58:56,876 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:58:56,910 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-05 12:58:56,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:58:56,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-09-05 12:58:56,916 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:58:56,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 12:58:56,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 12:58:56,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-05 12:58:56,918 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2019-09-05 12:58:56,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:58:56,945 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-09-05 12:58:56,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:58:56,947 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-09-05 12:58:56,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:58:56,948 INFO L225 Difference]: With dead ends: 13 [2019-09-05 12:58:56,948 INFO L226 Difference]: Without dead ends: 13 [2019-09-05 12:58:56,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-05 12:58:56,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-05 12:58:56,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-05 12:58:56,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-05 12:58:56,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-09-05 12:58:56,955 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-09-05 12:58:56,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:58:56,956 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-09-05 12:58:56,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 12:58:56,956 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-09-05 12:58:56,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-05 12:58:56,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:58:56,957 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:58:56,957 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:58:56,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:58:56,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1490448798, now seen corresponding path program 2 times [2019-09-05 12:58:56,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:58:56,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:58:56,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:58:56,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:58:56,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:58:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:58:57,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:58:57,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:58:57,079 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:58:57,079 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:58:57,080 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:58:57,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:58:57,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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:58:57,106 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:58:57,106 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:58:57,117 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-05 12:58:57,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:58:57,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-05 12:58:57,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:58:57,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:58:57,146 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:58:57,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:58:57,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:58:57,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-09-05 12:58:57,199 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:58:57,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 12:58:57,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 12:58:57,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-05 12:58:57,201 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2019-09-05 12:58:57,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:58:57,226 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-09-05 12:58:57,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 12:58:57,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-09-05 12:58:57,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:58:57,228 INFO L225 Difference]: With dead ends: 14 [2019-09-05 12:58:57,228 INFO L226 Difference]: Without dead ends: 14 [2019-09-05 12:58:57,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-05 12:58:57,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-05 12:58:57,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-05 12:58:57,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-05 12:58:57,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-09-05 12:58:57,232 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-09-05 12:58:57,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:58:57,232 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-09-05 12:58:57,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 12:58:57,232 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-09-05 12:58:57,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-05 12:58:57,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:58:57,233 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:58:57,234 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:58:57,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:58:57,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1004266255, now seen corresponding path program 3 times [2019-09-05 12:58:57,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:58:57,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:58:57,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:58:57,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:58:57,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:58:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:58:57,318 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:58:57,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:58:57,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:58:57,319 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:58:57,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:58:57,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:58:57,320 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:58:57,333 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:58:57,333 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-05 12:58:57,343 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:58:57,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:58:57,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-05 12:58:57,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:58:57,372 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:58:57,372 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:58:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:58:57,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:58:57,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-09-05 12:58:57,439 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:58:57,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 12:58:57,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 12:58:57,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-05 12:58:57,441 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 7 states. [2019-09-05 12:58:57,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:58:57,477 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-09-05 12:58:57,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 12:58:57,477 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-09-05 12:58:57,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:58:57,478 INFO L225 Difference]: With dead ends: 15 [2019-09-05 12:58:57,478 INFO L226 Difference]: Without dead ends: 15 [2019-09-05 12:58:57,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-05 12:58:57,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-05 12:58:57,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-05 12:58:57,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-05 12:58:57,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-05 12:58:57,482 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-09-05 12:58:57,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:58:57,482 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-05 12:58:57,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 12:58:57,483 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-05 12:58:57,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 12:58:57,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:58:57,484 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:58:57,484 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:58:57,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:58:57,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 4 times [2019-09-05 12:58:57,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:58:57,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:58:57,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:58:57,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:58:57,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:58:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:58:57,593 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:58:57,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:58:57,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:58:57,594 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:58:57,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:58:57,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:58:57,595 INFO 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-05 12:58:57,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:58:57,608 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:58:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:58:57,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 12:58:57,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:58:57,646 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:58:57,646 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:58:57,787 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:58:57,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:58:57,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-09-05 12:58:57,791 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:58:57,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 12:58:57,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 12:58:57,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-05 12:58:57,793 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2019-09-05 12:58:57,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:58:57,836 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-09-05 12:58:57,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 12:58:57,836 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-09-05 12:58:57,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:58:57,837 INFO L225 Difference]: With dead ends: 16 [2019-09-05 12:58:57,837 INFO L226 Difference]: Without dead ends: 16 [2019-09-05 12:58:57,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-05 12:58:57,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-05 12:58:57,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-05 12:58:57,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-05 12:58:57,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-09-05 12:58:57,840 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-09-05 12:58:57,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:58:57,841 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-09-05 12:58:57,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 12:58:57,841 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-09-05 12:58:57,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-05 12:58:57,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:58:57,842 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:58:57,842 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:58:57,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:58:57,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1860436335, now seen corresponding path program 5 times [2019-09-05 12:58:57,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:58:57,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:58:57,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:58:57,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:58:57,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:58:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:58:57,975 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:58:57,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:58:57,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:58:57,976 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:58:57,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:58:57,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:58:57,976 INFO 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-05 12:58:57,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:58:57,999 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-05 12:58:58,016 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-05 12:58:58,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:58:58,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-05 12:58:58,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:58:58,041 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:58:58,042 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:58:58,235 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:58:58,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:58:58,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-09-05 12:58:58,239 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:58:58,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 12:58:58,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 12:58:58,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-09-05 12:58:58,241 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2019-09-05 12:58:58,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:58:58,296 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-09-05 12:58:58,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 12:58:58,297 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-09-05 12:58:58,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:58:58,298 INFO L225 Difference]: With dead ends: 17 [2019-09-05 12:58:58,298 INFO L226 Difference]: Without dead ends: 17 [2019-09-05 12:58:58,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-09-05 12:58:58,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-05 12:58:58,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-05 12:58:58,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-05 12:58:58,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-05 12:58:58,302 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-09-05 12:58:58,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:58:58,303 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-05 12:58:58,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 12:58:58,303 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-05 12:58:58,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 12:58:58,304 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:58:58,304 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:58:58,305 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:58:58,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:58:58,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1802490274, now seen corresponding path program 6 times [2019-09-05 12:58:58,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:58:58,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:58:58,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:58:58,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:58:58,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:58:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:58:58,462 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:58:58,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:58:58,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:58:58,463 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:58:58,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:58:58,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:58:58,464 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:58:58,479 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:58:58,480 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:58:58,491 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:58:58,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:58:58,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 12:58:58,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:58:58,517 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:58:58,517 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:58:58,703 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:58:58,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:58:58,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-09-05 12:58:58,707 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:58:58,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-05 12:58:58,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-05 12:58:58,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-09-05 12:58:58,709 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-09-05 12:58:58,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:58:58,763 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-05 12:58:58,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 12:58:58,763 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-09-05 12:58:58,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:58:58,764 INFO L225 Difference]: With dead ends: 18 [2019-09-05 12:58:58,764 INFO L226 Difference]: Without dead ends: 18 [2019-09-05 12:58:58,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-09-05 12:58:58,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-05 12:58:58,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-05 12:58:58,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-05 12:58:58,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-09-05 12:58:58,768 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-09-05 12:58:58,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:58:58,768 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-09-05 12:58:58,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-05 12:58:58,768 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-09-05 12:58:58,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-05 12:58:58,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:58:58,769 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:58:58,770 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:58:58,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:58:58,770 INFO L82 PathProgramCache]: Analyzing trace with hash -6162383, now seen corresponding path program 7 times [2019-09-05 12:58:58,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:58:58,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:58:58,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:58:58,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:58:58,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:58:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:58:58,891 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:58:58,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:58:58,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:58:58,892 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:58:58,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:58:58,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:58:58,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:58:58,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:58:58,918 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:58:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:58:58,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-05 12:58:58,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:58:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:58:58,954 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:58:59,177 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:58:59,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:58:59,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-09-05 12:58:59,181 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:58:59,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 12:58:59,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 12:58:59,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-05 12:58:59,182 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 11 states. [2019-09-05 12:58:59,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:58:59,262 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-09-05 12:58:59,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 12:58:59,264 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-09-05 12:58:59,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:58:59,265 INFO L225 Difference]: With dead ends: 19 [2019-09-05 12:58:59,265 INFO L226 Difference]: Without dead ends: 19 [2019-09-05 12:58:59,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-05 12:58:59,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-05 12:58:59,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-05 12:58:59,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-05 12:58:59,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-05 12:58:59,269 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-09-05 12:58:59,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:58:59,269 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-05 12:58:59,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 12:58:59,270 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-05 12:58:59,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 12:58:59,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:58:59,271 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:58:59,272 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:58:59,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:58:59,272 INFO L82 PathProgramCache]: Analyzing trace with hash -154572610, now seen corresponding path program 8 times [2019-09-05 12:58:59,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:58:59,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:58:59,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:58:59,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:58:59,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:58:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:58:59,429 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:58:59,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:58:59,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:58:59,430 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:58:59,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:58:59,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:58:59,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 12:58:59,440 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:58:59,441 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:58:59,453 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-05 12:58:59,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:58:59,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-05 12:58:59,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:58:59,500 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:58:59,500 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:58:59,750 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:58:59,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:58:59,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-09-05 12:58:59,756 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:58:59,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 12:58:59,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 12:58:59,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-09-05 12:58:59,758 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2019-09-05 12:58:59,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:58:59,861 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-09-05 12:58:59,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 12:58:59,861 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-09-05 12:58:59,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:58:59,862 INFO L225 Difference]: With dead ends: 20 [2019-09-05 12:58:59,862 INFO L226 Difference]: Without dead ends: 20 [2019-09-05 12:58:59,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-09-05 12:58:59,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-05 12:58:59,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-05 12:58:59,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-05 12:58:59,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-09-05 12:58:59,866 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-09-05 12:58:59,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:58:59,866 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-09-05 12:58:59,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 12:58:59,866 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-09-05 12:58:59,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-05 12:58:59,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:58:59,867 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:58:59,867 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:58:59,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:58:59,868 INFO L82 PathProgramCache]: Analyzing trace with hash -460322351, now seen corresponding path program 9 times [2019-09-05 12:58:59,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:58:59,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:58:59,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:58:59,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:58:59,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:58:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:59:00,010 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:00,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:59:00,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:59:00,010 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:59:00,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:59:00,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:59:00,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:59:00,028 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:59:00,028 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:59:00,040 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:59:00,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:59:00,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-05 12:59:00,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:59:00,076 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:00,076 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:59:00,366 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:00,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:59:00,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-09-05 12:59:00,372 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:59:00,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 12:59:00,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 12:59:00,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-09-05 12:59:00,373 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 13 states. [2019-09-05 12:59:00,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:59:00,496 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-09-05 12:59:00,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 12:59:00,498 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2019-09-05 12:59:00,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:59:00,499 INFO L225 Difference]: With dead ends: 21 [2019-09-05 12:59:00,499 INFO L226 Difference]: Without dead ends: 21 [2019-09-05 12:59:00,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-09-05 12:59:00,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-05 12:59:00,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-05 12:59:00,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-05 12:59:00,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-05 12:59:00,503 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-09-05 12:59:00,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:59:00,503 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-05 12:59:00,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 12:59:00,503 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-05 12:59:00,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 12:59:00,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:59:00,504 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:59:00,504 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:59:00,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:59:00,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1348629730, now seen corresponding path program 10 times [2019-09-05 12:59:00,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:59:00,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:59:00,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:59:00,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:59:00,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:59:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:59:00,662 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:00,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:59:00,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:59:00,662 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:59:00,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:59:00,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:59:00,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:59:00,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:59:00,676 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:59:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:59:00,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-05 12:59:00,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:59:00,712 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:00,713 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:59:01,029 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:01,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:59:01,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-09-05 12:59:01,032 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:59:01,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 12:59:01,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 12:59:01,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-05 12:59:01,033 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 14 states. [2019-09-05 12:59:01,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:59:01,169 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-05 12:59:01,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 12:59:01,171 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2019-09-05 12:59:01,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:59:01,172 INFO L225 Difference]: With dead ends: 22 [2019-09-05 12:59:01,172 INFO L226 Difference]: Without dead ends: 22 [2019-09-05 12:59:01,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-05 12:59:01,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-05 12:59:01,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-05 12:59:01,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-05 12:59:01,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-09-05 12:59:01,176 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-09-05 12:59:01,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:59:01,176 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-09-05 12:59:01,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 12:59:01,176 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-09-05 12:59:01,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-05 12:59:01,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:59:01,177 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:59:01,177 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:59:01,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:59:01,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1178612593, now seen corresponding path program 11 times [2019-09-05 12:59:01,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:59:01,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:59:01,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:59:01,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:59:01,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:59:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:59:01,348 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:01,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:59:01,349 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:59:01,349 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:59:01,349 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:59:01,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:59:01,350 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:59:01,364 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:59:01,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:59:30,921 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-05 12:59:30,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:59:31,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-05 12:59:31,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:59:31,339 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:31,339 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:59:31,701 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:31,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:59:31,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-09-05 12:59:31,706 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:59:31,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 12:59:31,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 12:59:31,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-05 12:59:31,707 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 15 states. [2019-09-05 12:59:31,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:59:31,880 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-09-05 12:59:31,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 12:59:31,880 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2019-09-05 12:59:31,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:59:31,881 INFO L225 Difference]: With dead ends: 23 [2019-09-05 12:59:31,881 INFO L226 Difference]: Without dead ends: 23 [2019-09-05 12:59:31,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-05 12:59:31,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-05 12:59:31,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-05 12:59:31,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-05 12:59:31,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-05 12:59:31,885 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-09-05 12:59:31,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:59:31,885 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-05 12:59:31,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 12:59:31,885 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-05 12:59:31,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-05 12:59:31,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:59:31,886 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:59:31,886 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:59:31,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:59:31,887 INFO L82 PathProgramCache]: Analyzing trace with hash -2081254018, now seen corresponding path program 12 times [2019-09-05 12:59:31,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:59:31,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:59:31,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:59:31,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:59:31,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:59:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:59:32,080 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:32,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:59:32,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:59:32,081 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:59:32,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:59:32,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:59:32,081 INFO 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-05 12:59:32,092 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:59:32,092 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 12:59:32,103 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:59:32,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:59:32,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-05 12:59:32,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:59:32,152 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:32,152 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:59:32,542 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:32,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:59:32,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-09-05 12:59:32,545 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:59:32,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 12:59:32,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 12:59:32,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-05 12:59:32,546 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 16 states. [2019-09-05 12:59:32,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:59:32,735 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-09-05 12:59:32,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-05 12:59:32,737 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-09-05 12:59:32,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:59:32,738 INFO L225 Difference]: With dead ends: 24 [2019-09-05 12:59:32,738 INFO L226 Difference]: Without dead ends: 24 [2019-09-05 12:59:32,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-05 12:59:32,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-05 12:59:32,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-05 12:59:32,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-05 12:59:32,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-09-05 12:59:32,741 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-09-05 12:59:32,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:59:32,742 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-09-05 12:59:32,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 12:59:32,742 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-09-05 12:59:32,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-05 12:59:32,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:59:32,743 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:59:32,743 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:59:32,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:59:32,743 INFO L82 PathProgramCache]: Analyzing trace with hash -57903855, now seen corresponding path program 13 times [2019-09-05 12:59:32,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:59:32,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:59:32,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:59:32,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:59:32,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:59:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:59:32,939 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:32,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:59:32,940 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:59:32,940 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:59:32,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:59:32,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:59:32,940 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:59:32,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:59:32,969 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:59:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:59:32,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-05 12:59:32,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:59:33,041 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:33,042 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:59:33,471 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:33,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:59:33,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-09-05 12:59:33,475 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:59:33,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-05 12:59:33,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-05 12:59:33,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-05 12:59:33,479 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 17 states. [2019-09-05 12:59:33,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:59:33,708 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-09-05 12:59:33,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-05 12:59:33,711 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2019-09-05 12:59:33,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:59:33,711 INFO L225 Difference]: With dead ends: 25 [2019-09-05 12:59:33,711 INFO L226 Difference]: Without dead ends: 25 [2019-09-05 12:59:33,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-05 12:59:33,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-05 12:59:33,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-05 12:59:33,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-05 12:59:33,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-05 12:59:33,716 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-09-05 12:59:33,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:59:33,716 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-05 12:59:33,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-05 12:59:33,717 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-05 12:59:33,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-05 12:59:33,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:59:33,717 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:59:33,718 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:59:33,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:59:33,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1758558242, now seen corresponding path program 14 times [2019-09-05 12:59:33,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:59:33,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:59:33,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:59:33,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:59:33,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:59:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:59:33,950 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:33,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:59:33,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:59:33,951 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:59:33,952 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:59:33,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:59:33,952 INFO 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-05 12:59:33,964 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:59:33,964 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:59:46,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-05 12:59:46,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:59:46,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-05 12:59:46,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:59:46,412 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:46,413 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:59:46,995 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:47,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:59:47,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-09-05 12:59:47,000 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:59:47,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-05 12:59:47,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-05 12:59:47,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 12:59:47,002 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 18 states. [2019-09-05 12:59:47,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:59:47,220 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-09-05 12:59:47,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 12:59:47,222 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-09-05 12:59:47,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:59:47,223 INFO L225 Difference]: With dead ends: 26 [2019-09-05 12:59:47,223 INFO L226 Difference]: Without dead ends: 26 [2019-09-05 12:59:47,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 12:59:47,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-05 12:59:47,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-05 12:59:47,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-05 12:59:47,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-09-05 12:59:47,226 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-09-05 12:59:47,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:59:47,227 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-09-05 12:59:47,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-05 12:59:47,227 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-09-05 12:59:47,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-05 12:59:47,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:59:47,228 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:59:47,228 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:59:47,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:59:47,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1355730609, now seen corresponding path program 15 times [2019-09-05 12:59:47,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:59:47,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:59:47,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:59:47,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:59:47,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:59:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:59:47,482 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:47,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:59:47,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:59:47,483 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:59:47,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:59:47,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:59:47,483 INFO 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-05 12:59:47,493 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:59:47,493 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 12:59:47,506 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:59:47,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:59:47,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-05 12:59:47,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:59:47,546 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:47,546 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:59:48,121 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:48,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:59:48,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-09-05 12:59:48,125 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:59:48,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 12:59:48,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 12:59:48,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 12:59:48,127 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 19 states. [2019-09-05 12:59:48,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:59:48,410 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-09-05 12:59:48,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-05 12:59:48,410 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-09-05 12:59:48,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:59:48,411 INFO L225 Difference]: With dead ends: 27 [2019-09-05 12:59:48,411 INFO L226 Difference]: Without dead ends: 27 [2019-09-05 12:59:48,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 12:59:48,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-05 12:59:48,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-05 12:59:48,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-05 12:59:48,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-05 12:59:48,416 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-09-05 12:59:48,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:59:48,416 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-05 12:59:48,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 12:59:48,416 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-05 12:59:48,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-05 12:59:48,417 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:59:48,417 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:59:48,417 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:59:48,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:59:48,417 INFO L82 PathProgramCache]: Analyzing trace with hash -885562818, now seen corresponding path program 16 times [2019-09-05 12:59:48,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:59:48,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:59:48,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:59:48,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:59:48,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:59:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:59:48,694 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:48,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:59:48,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:59:48,695 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:59:48,695 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:59:48,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:59:48,695 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:59:48,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:59:48,706 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:59:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:59:48,718 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-05 12:59:48,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:59:48,750 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:48,751 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:59:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:49,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:59:49,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-09-05 12:59:49,431 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:59:49,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 12:59:49,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 12:59:49,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 12:59:49,433 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 20 states. [2019-09-05 12:59:49,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:59:49,690 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-09-05 12:59:49,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-05 12:59:49,690 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2019-09-05 12:59:49,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:59:49,691 INFO L225 Difference]: With dead ends: 28 [2019-09-05 12:59:49,691 INFO L226 Difference]: Without dead ends: 28 [2019-09-05 12:59:49,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 12:59:49,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-05 12:59:49,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-05 12:59:49,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-05 12:59:49,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-09-05 12:59:49,695 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-09-05 12:59:49,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:59:49,695 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-09-05 12:59:49,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 12:59:49,696 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-09-05 12:59:49,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-05 12:59:49,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:59:49,696 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:59:49,697 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:59:49,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:59:49,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1646182319, now seen corresponding path program 17 times [2019-09-05 12:59:49,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:59:49,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:59:49,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:59:49,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:59:49,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:59:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:59:49,981 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:49,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:59:49,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:59:49,982 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:59:49,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:59:49,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:59:49,983 INFO 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-05 12:59:49,994 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:59:49,994 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:00:02,340 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-05 13:00:02,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:00:02,345 WARN L254 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-05 13:00:02,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:00:02,411 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:00:02,411 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:00:03,358 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:00:03,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:00:03,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-09-05 13:00:03,363 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:00:03,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 13:00:03,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 13:00:03,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 13:00:03,364 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 21 states. [2019-09-05 13:00:03,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:00:03,670 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-09-05 13:00:03,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-05 13:00:03,671 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2019-09-05 13:00:03,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:00:03,672 INFO L225 Difference]: With dead ends: 29 [2019-09-05 13:00:03,672 INFO L226 Difference]: Without dead ends: 29 [2019-09-05 13:00:03,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 13:00:03,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-05 13:00:03,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-05 13:00:03,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-05 13:00:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-05 13:00:03,676 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-09-05 13:00:03,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:00:03,676 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-05 13:00:03,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 13:00:03,676 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-05 13:00:03,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-05 13:00:03,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:00:03,677 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:00:03,677 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:00:03,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:00:03,678 INFO L82 PathProgramCache]: Analyzing trace with hash 544416926, now seen corresponding path program 18 times [2019-09-05 13:00:03,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:00:03,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:00:03,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:00:03,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:00:03,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:00:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:00:04,039 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:00:04,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:00:04,040 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:00:04,040 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:00:04,040 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:00:04,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:00:04,040 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:00:04,057 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:00:04,057 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:00:04,074 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:00:04,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:00:04,075 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-05 13:00:04,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:00:04,135 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:00:04,135 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:00:05,393 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:00:05,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:00:05,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-09-05 13:00:05,397 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:00:05,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-05 13:00:05,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-05 13:00:05,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 13:00:05,398 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 22 states. [2019-09-05 13:00:05,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:00:05,740 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-09-05 13:00:05,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-05 13:00:05,740 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2019-09-05 13:00:05,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:00:05,741 INFO L225 Difference]: With dead ends: 30 [2019-09-05 13:00:05,741 INFO L226 Difference]: Without dead ends: 30 [2019-09-05 13:00:05,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 13:00:05,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-05 13:00:05,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-05 13:00:05,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-05 13:00:05,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-09-05 13:00:05,746 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-09-05 13:00:05,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:00:05,746 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-09-05 13:00:05,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-05 13:00:05,747 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-09-05 13:00:05,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-05 13:00:05,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:00:05,748 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:00:05,748 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:00:05,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:00:05,748 INFO L82 PathProgramCache]: Analyzing trace with hash -266483215, now seen corresponding path program 19 times [2019-09-05 13:00:05,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:00:05,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:00:05,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:00:05,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:00:05,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:00:05,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:00:06,076 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:00:06,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:00:06,077 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:00:06,077 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:00:06,077 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:00:06,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:00:06,078 INFO 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-05 13:00:06,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:00:06,089 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:00:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:00:06,123 WARN L254 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-05 13:00:06,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:00:06,183 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:00:06,184 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:00:07,043 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:00:07,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:00:07,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-09-05 13:00:07,046 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:00:07,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-05 13:00:07,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-05 13:00:07,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2019-09-05 13:00:07,048 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 23 states. [2019-09-05 13:00:07,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:00:07,424 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-09-05 13:00:07,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 13:00:07,425 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2019-09-05 13:00:07,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:00:07,426 INFO L225 Difference]: With dead ends: 31 [2019-09-05 13:00:07,426 INFO L226 Difference]: Without dead ends: 31 [2019-09-05 13:00:07,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2019-09-05 13:00:07,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-05 13:00:07,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-05 13:00:07,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-05 13:00:07,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-05 13:00:07,430 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-09-05 13:00:07,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:00:07,431 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-05 13:00:07,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-05 13:00:07,431 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-05 13:00:07,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-05 13:00:07,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:00:07,432 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:00:07,432 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:00:07,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:00:07,432 INFO L82 PathProgramCache]: Analyzing trace with hash 365416190, now seen corresponding path program 20 times [2019-09-05 13:00:07,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:00:07,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:00:07,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:00:07,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:00:07,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:00:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:00:07,840 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:00:07,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:00:07,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:00:07,841 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:00:07,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:00:07,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:00:07,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:00:07,865 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:00:07,865 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:00:46,977 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-05 13:00:46,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:00:47,144 WARN L254 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-05 13:00:47,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:00:47,199 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:00:47,199 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:00:48,148 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:00:48,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:00:48,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-09-05 13:00:48,154 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:00:48,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 13:00:48,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 13:00:48,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2019-09-05 13:00:48,155 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 24 states. [2019-09-05 13:00:48,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:00:48,586 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-09-05 13:00:48,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-05 13:00:48,591 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2019-09-05 13:00:48,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:00:48,592 INFO L225 Difference]: With dead ends: 32 [2019-09-05 13:00:48,592 INFO L226 Difference]: Without dead ends: 32 [2019-09-05 13:00:48,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2019-09-05 13:00:48,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-05 13:00:48,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-05 13:00:48,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-05 13:00:48,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-09-05 13:00:48,596 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-09-05 13:00:48,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:00:48,596 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-09-05 13:00:48,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 13:00:48,596 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-09-05 13:00:48,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-05 13:00:48,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:00:48,597 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:00:48,597 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:00:48,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:00:48,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1520538735, now seen corresponding path program 21 times [2019-09-05 13:00:48,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:00:48,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:00:48,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:00:48,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:00:48,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:00:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:00:49,017 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:00:49,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:00:49,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:00:49,018 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:00:49,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:00:49,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:00:49,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:00:49,043 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:00:49,043 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:00:49,065 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:00:49,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:00:49,067 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-05 13:00:49,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:00:49,111 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:00:49,111 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:00:50,183 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:00:50,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:00:50,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-09-05 13:00:50,186 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:00:50,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-05 13:00:50,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-05 13:00:50,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2019-09-05 13:00:50,188 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 25 states. [2019-09-05 13:00:50,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:00:50,629 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-09-05 13:00:50,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-05 13:00:50,632 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2019-09-05 13:00:50,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:00:50,632 INFO L225 Difference]: With dead ends: 33 [2019-09-05 13:00:50,633 INFO L226 Difference]: Without dead ends: 33 [2019-09-05 13:00:50,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2019-09-05 13:00:50,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-05 13:00:50,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-05 13:00:50,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-05 13:00:50,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-05 13:00:50,636 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-09-05 13:00:50,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:00:50,636 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-05 13:00:50,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-05 13:00:50,637 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-05 13:00:50,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-05 13:00:50,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:00:50,637 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:00:50,638 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:00:50,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:00:50,638 INFO L82 PathProgramCache]: Analyzing trace with hash 144400734, now seen corresponding path program 22 times [2019-09-05 13:00:50,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:00:50,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:00:50,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:00:50,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:00:50,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:00:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:00:51,099 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:00:51,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:00:51,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:00:51,100 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:00:51,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:00:51,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:00:51,100 INFO 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-05 13:00:51,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:00:51,128 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:00:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:00:51,144 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-05 13:00:51,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:00:51,201 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:00:51,201 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:00:53,780 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:00:53,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:00:53,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-09-05 13:00:53,783 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:00:53,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-05 13:00:53,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-05 13:00:53,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2019-09-05 13:00:53,785 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 26 states. [2019-09-05 13:00:54,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:00:54,263 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-09-05 13:00:54,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-05 13:00:54,264 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 32 [2019-09-05 13:00:54,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:00:54,265 INFO L225 Difference]: With dead ends: 34 [2019-09-05 13:00:54,265 INFO L226 Difference]: Without dead ends: 34 [2019-09-05 13:00:54,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2019-09-05 13:00:54,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-05 13:00:54,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-09-05 13:00:54,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-05 13:00:54,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-09-05 13:00:54,270 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-09-05 13:00:54,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:00:54,270 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-09-05 13:00:54,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-05 13:00:54,270 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-09-05 13:00:54,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-05 13:00:54,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:00:54,271 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:00:54,271 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:00:54,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:00:54,272 INFO L82 PathProgramCache]: Analyzing trace with hash 217916721, now seen corresponding path program 23 times [2019-09-05 13:00:54,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:00:54,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:00:54,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:00:54,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:00:54,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:00:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:00:54,744 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:00:54,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:00:54,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:00:54,744 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:00:54,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:00:54,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:00:54,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 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-05 13:00:54,755 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:00:54,756 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:02:59,460 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-05 13:02:59,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:03:00,637 WARN L254 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-05 13:03:00,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:00,687 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:00,687 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:02,003 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:02,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:02,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-09-05 13:03:02,011 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:02,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-05 13:03:02,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-05 13:03:02,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2019-09-05 13:03:02,012 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 27 states. [2019-09-05 13:03:02,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:02,529 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-09-05 13:03:02,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-05 13:03:02,529 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 33 [2019-09-05 13:03:02,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:02,530 INFO L225 Difference]: With dead ends: 35 [2019-09-05 13:03:02,530 INFO L226 Difference]: Without dead ends: 35 [2019-09-05 13:03:02,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2019-09-05 13:03:02,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-05 13:03:02,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-05 13:03:02,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-05 13:03:02,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-09-05 13:03:02,534 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-09-05 13:03:02,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:02,534 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-09-05 13:03:02,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-05 13:03:02,534 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-09-05 13:03:02,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-05 13:03:02,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:02,535 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:03:02,535 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:02,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:02,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1798054978, now seen corresponding path program 24 times [2019-09-05 13:03:02,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:02,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:02,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:03:02,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:02,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:03,058 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:03,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:03,059 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:03,059 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:03,059 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:03,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:03,059 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 13:03:03,083 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:03:03,083 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:03:03,097 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:03:03,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:03:03,098 WARN L254 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-05 13:03:03,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:03,145 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:03,145 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:04,654 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:04,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:04,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-09-05 13:03:04,657 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:04,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 13:03:04,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 13:03:04,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 13:03:04,659 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 28 states. [2019-09-05 13:03:05,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:05,203 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-09-05 13:03:05,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-05 13:03:05,203 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2019-09-05 13:03:05,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:05,204 INFO L225 Difference]: With dead ends: 36 [2019-09-05 13:03:05,204 INFO L226 Difference]: Without dead ends: 36 [2019-09-05 13:03:05,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 13:03:05,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-05 13:03:05,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-05 13:03:05,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-05 13:03:05,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-09-05 13:03:05,208 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-09-05 13:03:05,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:05,208 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-09-05 13:03:05,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 13:03:05,209 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-09-05 13:03:05,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-05 13:03:05,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:05,209 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:03:05,210 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:05,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:05,210 INFO L82 PathProgramCache]: Analyzing trace with hash 131331793, now seen corresponding path program 25 times [2019-09-05 13:03:05,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:05,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:05,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:03:05,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:05,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:05,684 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:05,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:05,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:05,685 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:05,685 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:05,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:05,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 13:03:05,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:03:05,702 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:03:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:05,718 WARN L254 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-05 13:03:05,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:05,751 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:05,751 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:07,355 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:07,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:07,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-09-05 13:03:07,359 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:07,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-05 13:03:07,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-05 13:03:07,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2019-09-05 13:03:07,361 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 29 states. [2019-09-05 13:03:07,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:07,963 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-09-05 13:03:07,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-05 13:03:07,964 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 35 [2019-09-05 13:03:07,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:07,965 INFO L225 Difference]: With dead ends: 37 [2019-09-05 13:03:07,965 INFO L226 Difference]: Without dead ends: 37 [2019-09-05 13:03:07,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2019-09-05 13:03:07,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-05 13:03:07,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-05 13:03:07,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-05 13:03:07,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-09-05 13:03:07,969 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-09-05 13:03:07,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:07,969 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-09-05 13:03:07,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-05 13:03:07,969 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-09-05 13:03:07,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-05 13:03:07,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:07,970 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:03:07,970 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:07,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:07,971 INFO L82 PathProgramCache]: Analyzing trace with hash -187220450, now seen corresponding path program 26 times [2019-09-05 13:03:07,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:07,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:07,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:03:07,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:07,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:08,481 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:08,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:08,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:08,482 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:08,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:08,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:08,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:03:08,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:03:08,495 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:05:22,676 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-05 13:05:22,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:05:23,969 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-05 13:05:23,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:05:24,007 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:24,007 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:05:25,606 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:25,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:05:25,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-09-05 13:05:25,613 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:05:25,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-05 13:05:25,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-05 13:05:25,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=894, Invalid=2298, Unknown=0, NotChecked=0, Total=3192 [2019-09-05 13:05:25,614 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 30 states. [2019-09-05 13:05:26,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:05:26,275 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-09-05 13:05:26,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-05 13:05:26,276 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2019-09-05 13:05:26,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:05:26,277 INFO L225 Difference]: With dead ends: 38 [2019-09-05 13:05:26,277 INFO L226 Difference]: Without dead ends: 38 [2019-09-05 13:05:26,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=894, Invalid=2298, Unknown=0, NotChecked=0, Total=3192 [2019-09-05 13:05:26,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-05 13:05:26,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-09-05 13:05:26,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-05 13:05:26,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-09-05 13:05:26,282 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-09-05 13:05:26,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:05:26,283 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-09-05 13:05:26,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-05 13:05:26,283 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-09-05 13:05:26,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-05 13:05:26,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:05:26,284 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:05:26,284 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:05:26,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:05:26,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1472405391, now seen corresponding path program 27 times [2019-09-05 13:05:26,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:05:26,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:26,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:05:26,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:26,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:05:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:26,985 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:26,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:26,985 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:05:26,985 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:05:26,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:05:26,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:26,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 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-05 13:05:27,017 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:05:27,017 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:05:27,037 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:05:27,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:05:27,039 WARN L254 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-05 13:05:27,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:05:27,076 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:27,077 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:05:28,822 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:28,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:05:28,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-09-05 13:05:28,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:05:28,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-05 13:05:28,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-05 13:05:28,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2019-09-05 13:05:28,828 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 31 states. [2019-09-05 13:05:29,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:05:29,491 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-09-05 13:05:29,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-05 13:05:29,492 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 37 [2019-09-05 13:05:29,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:05:29,493 INFO L225 Difference]: With dead ends: 39 [2019-09-05 13:05:29,493 INFO L226 Difference]: Without dead ends: 39 [2019-09-05 13:05:29,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2019-09-05 13:05:29,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-05 13:05:29,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-05 13:05:29,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-05 13:05:29,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-09-05 13:05:29,496 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-09-05 13:05:29,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:05:29,496 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-09-05 13:05:29,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-05 13:05:29,497 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-09-05 13:05:29,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-05 13:05:29,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:05:29,497 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:05:29,497 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:05:29,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:05:29,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1636534398, now seen corresponding path program 28 times [2019-09-05 13:05:29,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:05:29,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:29,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:05:29,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:29,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:05:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:30,098 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:30,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:30,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:05:30,099 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:05:30,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:05:30,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:30,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:05:30,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:05:30,110 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:05:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:30,132 WARN L254 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-05 13:05:30,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:05:30,170 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:30,171 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:05:32,137 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:32,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:05:32,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-09-05 13:05:32,141 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:05:32,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 13:05:32,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 13:05:32,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2019-09-05 13:05:32,142 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 32 states. [2019-09-05 13:05:32,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:05:32,869 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-09-05 13:05:32,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 13:05:32,869 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 38 [2019-09-05 13:05:32,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:05:32,870 INFO L225 Difference]: With dead ends: 40 [2019-09-05 13:05:32,870 INFO L226 Difference]: Without dead ends: 40 [2019-09-05 13:05:32,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2019-09-05 13:05:32,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-05 13:05:32,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-05 13:05:32,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-05 13:05:32,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-09-05 13:05:32,875 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-09-05 13:05:32,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:05:32,875 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-09-05 13:05:32,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 13:05:32,875 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-09-05 13:05:32,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-05 13:05:32,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:05:32,877 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:05:32,878 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:05:32,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:05:32,878 INFO L82 PathProgramCache]: Analyzing trace with hash -770579951, now seen corresponding path program 29 times [2019-09-05 13:05:32,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:05:32,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:32,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:05:32,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:32,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:05:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:33,785 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:33,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:33,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:05:33,786 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:05:33,786 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:05:33,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:33,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:05:33,800 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:05:33,800 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:06:11,518 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-05 13:06:11,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:06:11,561 WARN L254 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-05 13:06:11,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:06:11,601 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:11,604 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:06:13,652 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:13,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:06:13,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-09-05 13:06:13,659 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:06:13,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-05 13:06:13,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-05 13:06:13,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=2823, Unknown=0, NotChecked=0, Total=3906 [2019-09-05 13:06:13,662 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 33 states. [2019-09-05 13:06:14,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:06:14,448 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-09-05 13:06:14,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-05 13:06:14,452 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2019-09-05 13:06:14,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:06:14,453 INFO L225 Difference]: With dead ends: 41 [2019-09-05 13:06:14,453 INFO L226 Difference]: Without dead ends: 41 [2019-09-05 13:06:14,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1083, Invalid=2823, Unknown=0, NotChecked=0, Total=3906 [2019-09-05 13:06:14,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-05 13:06:14,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-05 13:06:14,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-05 13:06:14,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-09-05 13:06:14,463 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-09-05 13:06:14,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:06:14,463 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-09-05 13:06:14,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-05 13:06:14,464 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-09-05 13:06:14,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-05 13:06:14,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:06:14,465 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:06:14,465 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:06:14,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:06:14,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1918286558, now seen corresponding path program 30 times [2019-09-05 13:06:14,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:06:14,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:14,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:06:14,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:14,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:06:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:06:15,155 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:15,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:15,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:06:15,156 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:06:15,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:06:15,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:15,156 INFO 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-05 13:06:15,167 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:06:15,167 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:06:15,188 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:06:15,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:06:15,190 WARN L254 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-05 13:06:15,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:06:15,236 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:15,237 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:06:17,370 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:17,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:06:17,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-09-05 13:06:17,374 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:06:17,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-05 13:06:17,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-05 13:06:17,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1150, Invalid=3010, Unknown=0, NotChecked=0, Total=4160 [2019-09-05 13:06:17,375 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 34 states. [2019-09-05 13:06:18,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:06:18,165 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-09-05 13:06:18,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-05 13:06:18,166 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 40 [2019-09-05 13:06:18,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:06:18,167 INFO L225 Difference]: With dead ends: 42 [2019-09-05 13:06:18,167 INFO L226 Difference]: Without dead ends: 42 [2019-09-05 13:06:18,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1150, Invalid=3010, Unknown=0, NotChecked=0, Total=4160 [2019-09-05 13:06:18,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-05 13:06:18,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-05 13:06:18,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-05 13:06:18,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-09-05 13:06:18,170 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-09-05 13:06:18,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:06:18,170 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-09-05 13:06:18,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-05 13:06:18,170 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-09-05 13:06:18,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-05 13:06:18,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:06:18,171 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:06:18,171 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:06:18,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:06:18,172 INFO L82 PathProgramCache]: Analyzing trace with hash -626197583, now seen corresponding path program 31 times [2019-09-05 13:06:18,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:06:18,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:18,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:06:18,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:18,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:06:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:06:18,849 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:18,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:18,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:06:18,850 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:06:18,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:06:18,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:18,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 13:06:18,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:06:18,864 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:06:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:06:18,885 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-05 13:06:18,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:06:18,927 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:18,928 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:06:21,265 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:21,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:06:21,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-09-05 13:06:21,269 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:06:21,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-05 13:06:21,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-05 13:06:21,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1219, Invalid=3203, Unknown=0, NotChecked=0, Total=4422 [2019-09-05 13:06:21,271 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 35 states. [2019-09-05 13:06:22,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:06:22,139 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-09-05 13:06:22,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-05 13:06:22,145 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 41 [2019-09-05 13:06:22,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:06:22,146 INFO L225 Difference]: With dead ends: 43 [2019-09-05 13:06:22,146 INFO L226 Difference]: Without dead ends: 43 [2019-09-05 13:06:22,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1219, Invalid=3203, Unknown=0, NotChecked=0, Total=4422 [2019-09-05 13:06:22,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-05 13:06:22,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-05 13:06:22,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-05 13:06:22,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-09-05 13:06:22,150 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-09-05 13:06:22,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:06:22,150 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-09-05 13:06:22,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-05 13:06:22,150 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-09-05 13:06:22,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-05 13:06:22,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:06:22,151 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:06:22,151 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:06:22,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:06:22,151 INFO L82 PathProgramCache]: Analyzing trace with hash 2099172670, now seen corresponding path program 32 times [2019-09-05 13:06:22,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:06:22,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:22,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:06:22,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:22,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:06:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:06:22,876 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:22,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:22,876 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:06:22,877 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:06:22,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:06:22,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:22,877 INFO 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-05 13:06:22,887 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:06:22,888 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:06:31,483 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-05 13:06:31,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:06:31,521 WARN L254 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-05 13:06:31,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:06:31,572 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:31,572 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:06:33,999 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:34,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:06:34,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-09-05 13:06:34,005 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:06:34,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-05 13:06:34,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-05 13:06:34,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1290, Invalid=3402, Unknown=0, NotChecked=0, Total=4692 [2019-09-05 13:06:34,010 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 36 states. [2019-09-05 13:06:34,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:06:34,932 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-09-05 13:06:34,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-05 13:06:34,936 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 42 [2019-09-05 13:06:34,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:06:34,937 INFO L225 Difference]: With dead ends: 44 [2019-09-05 13:06:34,937 INFO L226 Difference]: Without dead ends: 44 [2019-09-05 13:06:34,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1290, Invalid=3402, Unknown=0, NotChecked=0, Total=4692 [2019-09-05 13:06:34,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-05 13:06:34,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-05 13:06:34,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-05 13:06:34,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-09-05 13:06:34,953 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-09-05 13:06:34,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:06:34,953 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-09-05 13:06:34,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-05 13:06:34,953 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-09-05 13:06:34,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-05 13:06:34,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:06:34,954 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:06:34,954 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:06:34,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:06:34,954 INFO L82 PathProgramCache]: Analyzing trace with hash 686304593, now seen corresponding path program 33 times [2019-09-05 13:06:34,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:06:34,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:34,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:06:34,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:34,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:06:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:06:35,679 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:35,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:35,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:06:35,679 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:06:35,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:06:35,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:35,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 13:06:35,694 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:06:35,694 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:06:35,716 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:06:35,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:06:35,718 WARN L254 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-05 13:06:35,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:06:35,771 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:35,771 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:06:38,331 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:38,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:06:38,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-09-05 13:06:38,335 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:06:38,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-05 13:06:38,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-05 13:06:38,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1363, Invalid=3607, Unknown=0, NotChecked=0, Total=4970 [2019-09-05 13:06:38,337 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 37 states. [2019-09-05 13:06:39,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:06:39,350 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-09-05 13:06:39,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-05 13:06:39,351 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 43 [2019-09-05 13:06:39,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:06:39,351 INFO L225 Difference]: With dead ends: 45 [2019-09-05 13:06:39,352 INFO L226 Difference]: Without dead ends: 45 [2019-09-05 13:06:39,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1363, Invalid=3607, Unknown=0, NotChecked=0, Total=4970 [2019-09-05 13:06:39,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-05 13:06:39,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-05 13:06:39,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-05 13:06:39,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-09-05 13:06:39,354 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-09-05 13:06:39,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:06:39,354 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-09-05 13:06:39,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-05 13:06:39,354 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-09-05 13:06:39,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-05 13:06:39,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:06:39,355 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:06:39,355 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:06:39,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:06:39,355 INFO L82 PathProgramCache]: Analyzing trace with hash -162932834, now seen corresponding path program 34 times [2019-09-05 13:06:39,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:06:39,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:39,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:06:39,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:39,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:06:39,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:06:40,210 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:40,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:40,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:06:40,210 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:06:40,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:06:40,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:40,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:06:40,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:06:40,222 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:06:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:06:40,248 WARN L254 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-05 13:06:40,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:06:40,296 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:40,296 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:06:42,981 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:42,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:06:42,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-09-05 13:06:42,985 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:06:42,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-05 13:06:42,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-05 13:06:42,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1438, Invalid=3818, Unknown=0, NotChecked=0, Total=5256 [2019-09-05 13:06:42,986 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 38 states. [2019-09-05 13:06:44,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:06:44,033 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-09-05 13:06:44,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-05 13:06:44,034 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 44 [2019-09-05 13:06:44,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:06:44,034 INFO L225 Difference]: With dead ends: 46 [2019-09-05 13:06:44,034 INFO L226 Difference]: Without dead ends: 46 [2019-09-05 13:06:44,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1438, Invalid=3818, Unknown=0, NotChecked=0, Total=5256 [2019-09-05 13:06:44,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-05 13:06:44,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-09-05 13:06:44,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-05 13:06:44,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-09-05 13:06:44,037 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-09-05 13:06:44,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:06:44,038 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-09-05 13:06:44,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-05 13:06:44,038 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-09-05 13:06:44,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-05 13:06:44,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:06:44,039 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:06:44,039 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:06:44,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:06:44,040 INFO L82 PathProgramCache]: Analyzing trace with hash -719489295, now seen corresponding path program 35 times [2019-09-05 13:06:44,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:06:44,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:44,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:06:44,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:44,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:06:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:06:45,044 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:45,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:45,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:06:45,045 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:06:45,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:06:45,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:45,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:06:45,067 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:06:45,067 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:09:09,916 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-09-05 13:09:09,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:09:10,636 WARN L254 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-05 13:09:10,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:09:10,714 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:09:10,714 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:13:28,373 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 607 refuted. 23 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:13:28,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:13:28,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-09-05 13:13:28,381 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:13:28,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-05 13:13:28,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-05 13:13:28,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1515, Invalid=3943, Unknown=92, NotChecked=0, Total=5550 [2019-09-05 13:13:28,382 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 39 states. [2019-09-05 13:13:29,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:13:29,491 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-09-05 13:13:29,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-05 13:13:29,492 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 45 [2019-09-05 13:13:29,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:13:29,492 INFO L225 Difference]: With dead ends: 47 [2019-09-05 13:13:29,493 INFO L226 Difference]: Without dead ends: 47 [2019-09-05 13:13:29,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 258.6s TimeCoverageRelationStatistics Valid=1515, Invalid=3943, Unknown=92, NotChecked=0, Total=5550 [2019-09-05 13:13:29,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-05 13:13:29,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-09-05 13:13:29,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-05 13:13:29,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-09-05 13:13:29,495 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-09-05 13:13:29,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:13:29,496 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-09-05 13:13:29,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-05 13:13:29,496 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-09-05 13:13:29,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-05 13:13:29,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:29,497 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:29,497 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:29,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:29,497 INFO L82 PathProgramCache]: Analyzing trace with hash -792870402, now seen corresponding path program 36 times [2019-09-05 13:13:29,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:29,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:29,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:13:29,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:29,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat