java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-lit/gr2006.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:03:34,088 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:03:34,090 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:03:34,104 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:03:34,104 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:03:34,105 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:03:34,106 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:03:34,108 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:03:34,110 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:03:34,111 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:03:34,112 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:03:34,113 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:03:34,114 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:03:34,115 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:03:34,116 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:03:34,117 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:03:34,118 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:03:34,119 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:03:34,121 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:03:34,123 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:03:34,125 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:03:34,127 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:03:34,128 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:03:34,129 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:03:34,131 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:03:34,132 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:03:34,132 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:03:34,133 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:03:34,134 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:03:34,135 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:03:34,135 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:03:34,137 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:03:34,138 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:03:34,139 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:03:34,143 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:03:34,145 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:03:34,145 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:03:34,146 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:03:34,146 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:03:34,147 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:03:34,148 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:03:34,148 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-16 17:03:34,167 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:03:34,167 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:03:34,168 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:03:34,168 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:03:34,168 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:03:34,169 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:03:34,169 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:03:34,169 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:03:34,169 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:03:34,170 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:03:34,170 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:03:34,170 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:03:34,171 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:03:34,171 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:03:34,171 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:03:34,171 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:03:34,172 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:03:34,172 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:03:34,172 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:03:34,172 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:03:34,172 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:03:34,173 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:03:34,173 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:03:34,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:03:34,173 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:03:34,173 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:03:34,174 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:03:34,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:03:34,174 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:03:34,174 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:03:34,203 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:03:34,221 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:03:34,226 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:03:34,227 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:03:34,228 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:03:34,228 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gr2006.i [2019-09-16 17:03:34,298 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2eb83ad72/31bba244db5f45a691206bcf598f563c/FLAG5cbad9630 [2019-09-16 17:03:34,747 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:03:34,748 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gr2006.i [2019-09-16 17:03:34,755 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2eb83ad72/31bba244db5f45a691206bcf598f563c/FLAG5cbad9630 [2019-09-16 17:03:35,149 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2eb83ad72/31bba244db5f45a691206bcf598f563c [2019-09-16 17:03:35,165 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:03:35,167 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:03:35,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:03:35,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:03:35,176 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:03:35,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:03:35" (1/1) ... [2019-09-16 17:03:35,181 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f808fcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:35, skipping insertion in model container [2019-09-16 17:03:35,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:03:35" (1/1) ... [2019-09-16 17:03:35,189 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:03:35,208 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:03:35,396 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:03:35,401 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:03:35,414 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:03:35,427 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:03:35,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:35 WrapperNode [2019-09-16 17:03:35,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:03:35,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:03:35,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:03:35,428 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:03:35,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:35" (1/1) ... [2019-09-16 17:03:35,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:35" (1/1) ... [2019-09-16 17:03:35,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:35" (1/1) ... [2019-09-16 17:03:35,533 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:35" (1/1) ... [2019-09-16 17:03:35,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:35" (1/1) ... [2019-09-16 17:03:35,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:35" (1/1) ... [2019-09-16 17:03:35,542 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:35" (1/1) ... [2019-09-16 17:03:35,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:03:35,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:03:35,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:03:35,544 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:03:35,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:35" (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-16 17:03:35,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:03:35,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:03:35,603 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-16 17:03:35,603 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:03:35,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:03:35,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-16 17:03:35,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-16 17:03:35,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:03:35,604 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:03:35,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:03:35,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:03:35,776 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:03:35,776 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 17:03:35,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:03:35 BoogieIcfgContainer [2019-09-16 17:03:35,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:03:35,779 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:03:35,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:03:35,783 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:03:35,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:03:35" (1/3) ... [2019-09-16 17:03:35,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6269d06b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:03:35, skipping insertion in model container [2019-09-16 17:03:35,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:35" (2/3) ... [2019-09-16 17:03:35,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6269d06b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:03:35, skipping insertion in model container [2019-09-16 17:03:35,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:03:35" (3/3) ... [2019-09-16 17:03:35,787 INFO L109 eAbstractionObserver]: Analyzing ICFG gr2006.i [2019-09-16 17:03:35,798 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:03:35,806 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:03:35,823 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:03:35,852 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:03:35,852 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:03:35,852 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:03:35,852 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:03:35,853 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:03:35,853 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:03:35,853 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:03:35,853 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:03:35,869 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-09-16 17:03:35,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-16 17:03:35,879 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:35,880 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:35,882 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:35,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:35,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1001202113, now seen corresponding path program 1 times [2019-09-16 17:03:35,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:35,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:35,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:35,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:35,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:35,987 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-16 17:03:35,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:35,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-16 17:03:35,990 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:35,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-16 17:03:36,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-16 17:03:36,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 17:03:36,012 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-09-16 17:03:36,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:36,028 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-09-16 17:03:36,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-16 17:03:36,030 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-16 17:03:36,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:36,040 INFO L225 Difference]: With dead ends: 20 [2019-09-16 17:03:36,040 INFO L226 Difference]: Without dead ends: 13 [2019-09-16 17:03:36,043 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 17:03:36,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-16 17:03:36,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-16 17:03:36,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-16 17:03:36,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-09-16 17:03:36,084 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-09-16 17:03:36,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:36,085 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-09-16 17:03:36,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-16 17:03:36,086 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-09-16 17:03:36,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-16 17:03:36,086 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:36,087 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:36,087 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:36,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:36,088 INFO L82 PathProgramCache]: Analyzing trace with hash 563077882, now seen corresponding path program 1 times [2019-09-16 17:03:36,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:36,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:36,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:36,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:36,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:36,156 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-16 17:03:36,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:36,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:36,157 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:36,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:36,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:36,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:36,160 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 4 states. [2019-09-16 17:03:36,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:36,233 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-09-16 17:03:36,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:36,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-16 17:03:36,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:36,236 INFO L225 Difference]: With dead ends: 17 [2019-09-16 17:03:36,236 INFO L226 Difference]: Without dead ends: 17 [2019-09-16 17:03:36,238 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:36,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-16 17:03:36,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-16 17:03:36,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-16 17:03:36,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-09-16 17:03:36,244 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2019-09-16 17:03:36,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:36,244 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-09-16 17:03:36,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:36,245 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-09-16 17:03:36,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-16 17:03:36,246 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:36,247 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:36,247 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:36,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:36,248 INFO L82 PathProgramCache]: Analyzing trace with hash 620336184, now seen corresponding path program 1 times [2019-09-16 17:03:36,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:36,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:36,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:36,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:36,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:36,297 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-16 17:03:36,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:36,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:03:36,297 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:36,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:03:36,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:03:36,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:03:36,299 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2019-09-16 17:03:36,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:36,356 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-09-16 17:03:36,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:03:36,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-09-16 17:03:36,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:36,358 INFO L225 Difference]: With dead ends: 20 [2019-09-16 17:03:36,358 INFO L226 Difference]: Without dead ends: 20 [2019-09-16 17:03:36,358 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:03:36,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-16 17:03:36,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-09-16 17:03:36,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-16 17:03:36,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-09-16 17:03:36,363 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2019-09-16 17:03:36,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:36,363 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-09-16 17:03:36,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:03:36,363 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-09-16 17:03:36,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-16 17:03:36,364 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:36,364 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:36,365 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:36,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:36,365 INFO L82 PathProgramCache]: Analyzing trace with hash -657196198, now seen corresponding path program 1 times [2019-09-16 17:03:36,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:36,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:36,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:36,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:36,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:36,449 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-16 17:03:36,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:36,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:03:36,451 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2019-09-16 17:03:36,453 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [16], [18], [22], [24], [31], [34], [36], [42], [43], [44], [46] [2019-09-16 17:03:36,493 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:03:36,494 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:03:36,634 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-16 17:03:36,637 INFO L272 AbstractInterpreter]: Visited 14 different actions 73 times. Merged at 5 different actions 32 times. Widened at 1 different actions 5 times. Performed 197 root evaluator evaluations with a maximum evaluation depth of 4. Performed 197 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 10 fixpoints after 3 different actions. Largest state had 5 variables. [2019-09-16 17:03:36,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:36,642 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-16 17:03:36,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:36,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:03:36,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:36,676 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:03:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:36,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-16 17:03:36,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:03:36,739 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-16 17:03:36,740 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:03:36,778 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-16 17:03:36,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:03:36,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-16 17:03:36,783 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:03:36,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:36,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:36,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:03:36,784 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 4 states. [2019-09-16 17:03:36,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:36,823 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-09-16 17:03:36,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:36,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-09-16 17:03:36,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:36,825 INFO L225 Difference]: With dead ends: 23 [2019-09-16 17:03:36,825 INFO L226 Difference]: Without dead ends: 23 [2019-09-16 17:03:36,825 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:03:36,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-16 17:03:36,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-09-16 17:03:36,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-16 17:03:36,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-09-16 17:03:36,830 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 18 [2019-09-16 17:03:36,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:36,830 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-09-16 17:03:36,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:36,831 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-09-16 17:03:36,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-16 17:03:36,831 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:36,832 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:36,832 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:36,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:36,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1550672957, now seen corresponding path program 2 times [2019-09-16 17:03:36,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:36,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:36,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:36,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:36,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:36,955 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-16 17:03:36,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:36,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:03:36,956 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-16 17:03:36,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-16 17:03:36,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:36,957 INFO 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-16 17:03:36,977 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-16 17:03:36,977 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-16 17:03:37,008 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-16 17:03:37,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 17:03:37,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-16 17:03:37,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:03:37,088 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:37,089 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:03:37,192 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:37,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:03:37,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2019-09-16 17:03:37,197 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:03:37,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-16 17:03:37,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-16 17:03:37,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-09-16 17:03:37,199 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 10 states. [2019-09-16 17:03:37,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:37,428 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2019-09-16 17:03:37,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-16 17:03:37,429 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-09-16 17:03:37,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:37,430 INFO L225 Difference]: With dead ends: 45 [2019-09-16 17:03:37,430 INFO L226 Difference]: Without dead ends: 45 [2019-09-16 17:03:37,433 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2019-09-16 17:03:37,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-16 17:03:37,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2019-09-16 17:03:37,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-16 17:03:37,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2019-09-16 17:03:37,447 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 21 [2019-09-16 17:03:37,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:37,448 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2019-09-16 17:03:37,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-16 17:03:37,448 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2019-09-16 17:03:37,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-16 17:03:37,450 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:37,451 INFO L407 BasicCegarLoop]: trace histogram [7, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:37,451 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:37,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:37,452 INFO L82 PathProgramCache]: Analyzing trace with hash -839757736, now seen corresponding path program 3 times [2019-09-16 17:03:37,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:37,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:37,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 17:03:37,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:37,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:37,584 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-16 17:03:37,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:37,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:03:37,586 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-16 17:03:37,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-16 17:03:37,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:37,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:03:37,616 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-16 17:03:37,616 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-16 17:03:37,639 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-16 17:03:37,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 17:03:37,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-16 17:03:37,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:03:37,711 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-16 17:03:37,715 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:03:37,808 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-16 17:03:37,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:03:37,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2019-09-16 17:03:37,811 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:03:37,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-16 17:03:37,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-16 17:03:37,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-09-16 17:03:37,813 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 12 states. [2019-09-16 17:03:38,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:38,027 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2019-09-16 17:03:38,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-16 17:03:38,028 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2019-09-16 17:03:38,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:38,029 INFO L225 Difference]: With dead ends: 65 [2019-09-16 17:03:38,029 INFO L226 Difference]: Without dead ends: 65 [2019-09-16 17:03:38,030 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=244, Invalid=568, Unknown=0, NotChecked=0, Total=812 [2019-09-16 17:03:38,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-16 17:03:38,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 43. [2019-09-16 17:03:38,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-16 17:03:38,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-09-16 17:03:38,037 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 30 [2019-09-16 17:03:38,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:38,037 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-09-16 17:03:38,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-16 17:03:38,037 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-09-16 17:03:38,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-16 17:03:38,038 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:38,039 INFO L407 BasicCegarLoop]: trace histogram [9, 8, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:38,039 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:38,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:38,039 INFO L82 PathProgramCache]: Analyzing trace with hash 508995066, now seen corresponding path program 4 times [2019-09-16 17:03:38,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:38,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:38,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 17:03:38,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:38,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:38,156 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-16 17:03:38,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:38,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:03:38,157 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-16 17:03:38,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-16 17:03:38,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:38,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-16 17:03:38,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:38,185 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:03:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:38,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-16 17:03:38,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:03:38,283 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 56 proven. 40 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-16 17:03:38,284 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:03:38,421 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 56 proven. 40 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-16 17:03:38,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:03:38,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2019-09-16 17:03:38,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:03:38,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-16 17:03:38,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-16 17:03:38,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-09-16 17:03:38,427 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 14 states. [2019-09-16 17:03:38,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:38,691 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2019-09-16 17:03:38,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-16 17:03:38,692 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2019-09-16 17:03:38,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:38,693 INFO L225 Difference]: With dead ends: 78 [2019-09-16 17:03:38,693 INFO L226 Difference]: Without dead ends: 78 [2019-09-16 17:03:38,694 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=333, Invalid=789, Unknown=0, NotChecked=0, Total=1122 [2019-09-16 17:03:38,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-16 17:03:38,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 49. [2019-09-16 17:03:38,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-16 17:03:38,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2019-09-16 17:03:38,701 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 36 [2019-09-16 17:03:38,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:38,701 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2019-09-16 17:03:38,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-16 17:03:38,701 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2019-09-16 17:03:38,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-16 17:03:38,702 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:38,703 INFO L407 BasicCegarLoop]: trace histogram [11, 10, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:38,703 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:38,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:38,703 INFO L82 PathProgramCache]: Analyzing trace with hash -284519592, now seen corresponding path program 5 times [2019-09-16 17:03:38,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:38,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:38,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:38,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:38,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:38,831 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-16 17:03:38,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:38,832 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:03:38,832 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-16 17:03:38,833 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-16 17:03:38,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:38,833 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:03:38,856 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-16 17:03:38,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-16 17:03:38,881 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-16 17:03:38,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 17:03:38,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-16 17:03:38,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:03:38,962 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 86 proven. 57 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-16 17:03:38,963 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:03:39,093 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 86 proven. 57 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-16 17:03:39,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:03:39,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2019-09-16 17:03:39,097 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:03:39,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-16 17:03:39,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-16 17:03:39,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2019-09-16 17:03:39,099 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 16 states. [2019-09-16 17:03:39,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:39,411 INFO L93 Difference]: Finished difference Result 91 states and 109 transitions. [2019-09-16 17:03:39,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-16 17:03:39,411 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2019-09-16 17:03:39,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:39,413 INFO L225 Difference]: With dead ends: 91 [2019-09-16 17:03:39,413 INFO L226 Difference]: Without dead ends: 91 [2019-09-16 17:03:39,414 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=436, Invalid=1046, Unknown=0, NotChecked=0, Total=1482 [2019-09-16 17:03:39,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-16 17:03:39,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 55. [2019-09-16 17:03:39,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-16 17:03:39,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-09-16 17:03:39,423 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 42 [2019-09-16 17:03:39,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:39,425 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-09-16 17:03:39,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-16 17:03:39,425 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-09-16 17:03:39,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-16 17:03:39,431 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:39,431 INFO L407 BasicCegarLoop]: trace histogram [13, 12, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:39,431 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:39,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:39,432 INFO L82 PathProgramCache]: Analyzing trace with hash -535736454, now seen corresponding path program 6 times [2019-09-16 17:03:39,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:39,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:39,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 17:03:39,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:39,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:39,603 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-16 17:03:39,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:39,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:03:39,604 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-16 17:03:39,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-16 17:03:39,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:39,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:03:39,642 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-16 17:03:39,643 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-16 17:03:39,674 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-16 17:03:39,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 17:03:39,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-16 17:03:39,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:03:39,784 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 122 proven. 77 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-16 17:03:39,784 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:03:39,934 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 122 proven. 77 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-16 17:03:39,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:03:39,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2019-09-16 17:03:39,938 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:03:39,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-16 17:03:39,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-16 17:03:39,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2019-09-16 17:03:39,940 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 18 states. [2019-09-16 17:03:40,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:40,275 INFO L93 Difference]: Finished difference Result 104 states and 125 transitions. [2019-09-16 17:03:40,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-16 17:03:40,275 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2019-09-16 17:03:40,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:40,277 INFO L225 Difference]: With dead ends: 104 [2019-09-16 17:03:40,277 INFO L226 Difference]: Without dead ends: 104 [2019-09-16 17:03:40,278 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=553, Invalid=1339, Unknown=0, NotChecked=0, Total=1892 [2019-09-16 17:03:40,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-16 17:03:40,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 61. [2019-09-16 17:03:40,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-16 17:03:40,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2019-09-16 17:03:40,285 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 48 [2019-09-16 17:03:40,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:40,285 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2019-09-16 17:03:40,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-16 17:03:40,286 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2019-09-16 17:03:40,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-16 17:03:40,287 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:40,287 INFO L407 BasicCegarLoop]: trace histogram [15, 14, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:40,287 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:40,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:40,288 INFO L82 PathProgramCache]: Analyzing trace with hash 336586328, now seen corresponding path program 7 times [2019-09-16 17:03:40,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:40,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:40,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 17:03:40,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:40,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 215 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-16 17:03:40,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:40,382 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:03:40,382 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-16 17:03:40,382 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-16 17:03:40,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:40,383 INFO 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-16 17:03:40,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:40,419 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:03:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:40,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-16 17:03:40,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:03:40,553 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 164 proven. 100 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-16 17:03:40,554 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:03:40,713 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 164 proven. 100 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-16 17:03:40,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:03:40,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2019-09-16 17:03:40,717 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:03:40,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-16 17:03:40,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-16 17:03:40,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=582, Unknown=0, NotChecked=0, Total=812 [2019-09-16 17:03:40,722 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 20 states. [2019-09-16 17:03:41,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:41,125 INFO L93 Difference]: Finished difference Result 117 states and 141 transitions. [2019-09-16 17:03:41,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-16 17:03:41,126 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2019-09-16 17:03:41,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:41,127 INFO L225 Difference]: With dead ends: 117 [2019-09-16 17:03:41,127 INFO L226 Difference]: Without dead ends: 117 [2019-09-16 17:03:41,129 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=684, Invalid=1668, Unknown=0, NotChecked=0, Total=2352 [2019-09-16 17:03:41,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-16 17:03:41,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 67. [2019-09-16 17:03:41,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-16 17:03:41,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2019-09-16 17:03:41,135 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 54 [2019-09-16 17:03:41,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:41,135 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2019-09-16 17:03:41,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-16 17:03:41,135 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2019-09-16 17:03:41,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-16 17:03:41,137 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:41,137 INFO L407 BasicCegarLoop]: trace histogram [17, 16, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:41,137 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:41,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:41,137 INFO L82 PathProgramCache]: Analyzing trace with hash 154544378, now seen corresponding path program 8 times [2019-09-16 17:03:41,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:41,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:41,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:41,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:41,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:41,235 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 282 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-16 17:03:41,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:41,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:03:41,236 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-16 17:03:41,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-16 17:03:41,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:41,236 INFO 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-16 17:03:41,258 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-16 17:03:41,258 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-16 17:03:41,292 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-16 17:03:41,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 17:03:41,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-16 17:03:41,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:03:41,475 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 224 proven. 162 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-16 17:03:41,476 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:03:41,703 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 224 proven. 162 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-16 17:03:41,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:03:41,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-09-16 17:03:41,707 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:03:41,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-16 17:03:41,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-16 17:03:41,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2019-09-16 17:03:41,709 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand 22 states. [2019-09-16 17:03:42,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:42,198 INFO L93 Difference]: Finished difference Result 186 states and 230 transitions. [2019-09-16 17:03:42,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-16 17:03:42,198 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 60 [2019-09-16 17:03:42,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:42,201 INFO L225 Difference]: With dead ends: 186 [2019-09-16 17:03:42,201 INFO L226 Difference]: Without dead ends: 186 [2019-09-16 17:03:42,202 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 111 SyntacticMatches, 16 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=619, Invalid=1273, Unknown=0, NotChecked=0, Total=1892 [2019-09-16 17:03:42,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-16 17:03:42,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 94. [2019-09-16 17:03:42,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-09-16 17:03:42,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2019-09-16 17:03:42,209 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 60 [2019-09-16 17:03:42,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:42,210 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2019-09-16 17:03:42,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-16 17:03:42,210 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2019-09-16 17:03:42,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-16 17:03:42,211 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:42,211 INFO L407 BasicCegarLoop]: trace histogram [28, 27, 19, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:42,212 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:42,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:42,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1948702853, now seen corresponding path program 9 times [2019-09-16 17:03:42,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:42,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:42,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 17:03:42,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:42,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:42,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 506 proven. 628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:42,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:42,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:03:42,812 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-16 17:03:42,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-16 17:03:42,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:42,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:03:42,837 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-16 17:03:42,838 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-16 17:03:42,880 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-16 17:03:42,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 17:03:42,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-16 17:03:42,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:03:43,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 531 proven. 126 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-16 17:03:43,118 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:03:43,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 531 proven. 126 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-16 17:03:43,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:03:43,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 12, 12] total 59 [2019-09-16 17:03:43,577 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:03:43,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-16 17:03:43,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-16 17:03:43,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=629, Invalid=2793, Unknown=0, NotChecked=0, Total=3422 [2019-09-16 17:03:43,580 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand 49 states. [2019-09-16 17:03:44,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:44,010 INFO L93 Difference]: Finished difference Result 98 states and 117 transitions. [2019-09-16 17:03:44,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-16 17:03:44,011 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 93 [2019-09-16 17:03:44,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:44,012 INFO L225 Difference]: With dead ends: 98 [2019-09-16 17:03:44,012 INFO L226 Difference]: Without dead ends: 98 [2019-09-16 17:03:44,015 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1327, Invalid=4679, Unknown=0, NotChecked=0, Total=6006 [2019-09-16 17:03:44,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-16 17:03:44,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-09-16 17:03:44,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-16 17:03:44,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 116 transitions. [2019-09-16 17:03:44,021 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 116 transitions. Word has length 93 [2019-09-16 17:03:44,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:44,021 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 116 transitions. [2019-09-16 17:03:44,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-16 17:03:44,021 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 116 transitions. [2019-09-16 17:03:44,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-16 17:03:44,023 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:44,023 INFO L407 BasicCegarLoop]: trace histogram [29, 28, 19, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:44,023 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:44,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:44,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1268513464, now seen corresponding path program 10 times [2019-09-16 17:03:44,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:44,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:44,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 17:03:44,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:44,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:44,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 509 proven. 709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:44,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:44,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:03:44,776 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-16 17:03:44,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-16 17:03:44,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:44,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 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-16 17:03:44,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:44,808 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:03:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:44,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-16 17:03:44,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:03:45,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 586 proven. 155 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-16 17:03:45,126 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:03:45,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 586 proven. 155 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-16 17:03:45,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:03:45,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 13, 13] total 63 [2019-09-16 17:03:45,622 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:03:45,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-16 17:03:45,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-16 17:03:45,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=717, Invalid=3189, Unknown=0, NotChecked=0, Total=3906 [2019-09-16 17:03:45,627 INFO L87 Difference]: Start difference. First operand 97 states and 116 transitions. Second operand 52 states. [2019-09-16 17:03:46,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:46,080 INFO L93 Difference]: Finished difference Result 101 states and 120 transitions. [2019-09-16 17:03:46,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-16 17:03:46,081 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 96 [2019-09-16 17:03:46,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:46,082 INFO L225 Difference]: With dead ends: 101 [2019-09-16 17:03:46,082 INFO L226 Difference]: Without dead ends: 101 [2019-09-16 17:03:46,084 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1741 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1562, Invalid=5410, Unknown=0, NotChecked=0, Total=6972 [2019-09-16 17:03:46,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-16 17:03:46,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-09-16 17:03:46,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-16 17:03:46,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2019-09-16 17:03:46,089 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 96 [2019-09-16 17:03:46,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:46,089 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2019-09-16 17:03:46,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-16 17:03:46,089 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2019-09-16 17:03:46,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-16 17:03:46,091 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:46,091 INFO L407 BasicCegarLoop]: trace histogram [30, 29, 19, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:46,091 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:46,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:46,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1130364325, now seen corresponding path program 11 times [2019-09-16 17:03:46,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:46,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:46,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:46,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:46,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:46,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 512 proven. 793 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:46,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:46,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:03:46,732 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-16 17:03:46,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-16 17:03:46,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:46,733 INFO 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-16 17:03:46,766 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-16 17:03:46,766 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-16 17:03:46,837 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-16 17:03:46,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 17:03:46,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-16 17:03:46,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:03:47,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 931 proven. 342 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-16 17:03:47,237 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:03:47,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 931 proven. 342 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-16 17:03:47,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:03:47,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 21, 21] total 68 [2019-09-16 17:03:47,943 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:03:47,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-16 17:03:47,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-16 17:03:47,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1289, Invalid=3267, Unknown=0, NotChecked=0, Total=4556 [2019-09-16 17:03:47,946 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand 62 states. [2019-09-16 17:03:48,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:48,503 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2019-09-16 17:03:48,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-16 17:03:48,504 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 99 [2019-09-16 17:03:48,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:48,505 INFO L225 Difference]: With dead ends: 104 [2019-09-16 17:03:48,505 INFO L226 Difference]: Without dead ends: 103 [2019-09-16 17:03:48,507 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 155 SyntacticMatches, 19 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4330 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2178, Invalid=6194, Unknown=0, NotChecked=0, Total=8372 [2019-09-16 17:03:48,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-16 17:03:48,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-09-16 17:03:48,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-16 17:03:48,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 122 transitions. [2019-09-16 17:03:48,512 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 122 transitions. Word has length 99 [2019-09-16 17:03:48,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:48,512 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 122 transitions. [2019-09-16 17:03:48,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-16 17:03:48,512 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2019-09-16 17:03:48,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-16 17:03:48,513 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:48,514 INFO L407 BasicCegarLoop]: trace histogram [31, 30, 19, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:48,514 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:48,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:48,514 INFO L82 PathProgramCache]: Analyzing trace with hash -2137738280, now seen corresponding path program 12 times [2019-09-16 17:03:48,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:48,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:48,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 17:03:48,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:48,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:49,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 515 proven. 880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:49,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:49,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:03:49,233 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-16 17:03:49,233 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-16 17:03:49,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:49,233 INFO 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-16 17:03:49,269 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-16 17:03:49,269 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-16 17:03:49,308 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-16 17:03:49,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 17:03:49,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-16 17:03:49,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:03:49,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 696 proven. 222 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-16 17:03:49,613 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:03:50,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 696 proven. 222 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2019-09-16 17:03:50,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:03:50,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 15, 15] total 71 [2019-09-16 17:03:50,071 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:03:50,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-16 17:03:50,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-16 17:03:50,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=917, Invalid=4053, Unknown=0, NotChecked=0, Total=4970 [2019-09-16 17:03:50,074 INFO L87 Difference]: Start difference. First operand 103 states and 122 transitions. Second operand 58 states. [2019-09-16 17:03:50,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:50,644 INFO L93 Difference]: Finished difference Result 107 states and 126 transitions. [2019-09-16 17:03:50,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-16 17:03:50,644 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 102 [2019-09-16 17:03:50,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:50,645 INFO L225 Difference]: With dead ends: 107 [2019-09-16 17:03:50,645 INFO L226 Difference]: Without dead ends: 107 [2019-09-16 17:03:50,649 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2223 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2098, Invalid=7022, Unknown=0, NotChecked=0, Total=9120 [2019-09-16 17:03:50,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-16 17:03:50,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-09-16 17:03:50,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-09-16 17:03:50,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 125 transitions. [2019-09-16 17:03:50,653 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 125 transitions. Word has length 102 [2019-09-16 17:03:50,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:50,653 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 125 transitions. [2019-09-16 17:03:50,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-16 17:03:50,653 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 125 transitions. [2019-09-16 17:03:50,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-16 17:03:50,654 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:50,655 INFO L407 BasicCegarLoop]: trace histogram [32, 31, 19, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:50,655 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:50,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:50,655 INFO L82 PathProgramCache]: Analyzing trace with hash 416232763, now seen corresponding path program 13 times [2019-09-16 17:03:50,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:50,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:50,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 17:03:50,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:50,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:51,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 518 proven. 970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:51,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:51,383 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:03:51,383 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-16 17:03:51,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-16 17:03:51,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:51,384 INFO 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-16 17:03:51,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:51,423 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:03:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:51,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-16 17:03:51,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:03:51,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 751 proven. 260 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-16 17:03:51,855 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:03:52,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 751 proven. 260 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-16 17:03:52,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:03:52,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 16, 16] total 75 [2019-09-16 17:03:52,351 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:03:52,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-16 17:03:52,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-16 17:03:52,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1029, Invalid=4521, Unknown=0, NotChecked=0, Total=5550 [2019-09-16 17:03:52,353 INFO L87 Difference]: Start difference. First operand 106 states and 125 transitions. Second operand 61 states. [2019-09-16 17:03:53,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:53,032 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2019-09-16 17:03:53,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-16 17:03:53,033 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 105 [2019-09-16 17:03:53,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:53,034 INFO L225 Difference]: With dead ends: 110 [2019-09-16 17:03:53,034 INFO L226 Difference]: Without dead ends: 110 [2019-09-16 17:03:53,036 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2482 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2399, Invalid=7903, Unknown=0, NotChecked=0, Total=10302 [2019-09-16 17:03:53,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-16 17:03:53,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-09-16 17:03:53,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-09-16 17:03:53,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 128 transitions. [2019-09-16 17:03:53,043 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 128 transitions. Word has length 105 [2019-09-16 17:03:53,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:53,044 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 128 transitions. [2019-09-16 17:03:53,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-16 17:03:53,044 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 128 transitions. [2019-09-16 17:03:53,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-16 17:03:53,045 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:53,045 INFO L407 BasicCegarLoop]: trace histogram [33, 32, 19, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:53,046 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:53,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:53,046 INFO L82 PathProgramCache]: Analyzing trace with hash 421926136, now seen corresponding path program 14 times [2019-09-16 17:03:53,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:53,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:53,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:53,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:53,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:54,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 521 proven. 1063 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:54,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:54,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:03:54,055 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-16 17:03:54,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-16 17:03:54,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:54,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-16 17:03:54,100 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-16 17:03:54,100 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-16 17:03:54,161 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-09-16 17:03:54,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 17:03:54,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-16 17:03:54,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:03:54,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 982 proven. 561 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-16 17:03:54,521 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:03:55,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 982 proven. 561 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-16 17:03:55,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:03:55,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 21, 21] total 71 [2019-09-16 17:03:55,143 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:03:55,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-16 17:03:55,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-16 17:03:55,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1325, Invalid=3645, Unknown=0, NotChecked=0, Total=4970 [2019-09-16 17:03:55,145 INFO L87 Difference]: Start difference. First operand 109 states and 128 transitions. Second operand 68 states. [2019-09-16 17:03:55,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:55,877 INFO L93 Difference]: Finished difference Result 113 states and 132 transitions. [2019-09-16 17:03:55,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-16 17:03:55,878 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 108 [2019-09-16 17:03:55,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:55,879 INFO L225 Difference]: With dead ends: 113 [2019-09-16 17:03:55,880 INFO L226 Difference]: Without dead ends: 112 [2019-09-16 17:03:55,882 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 167 SyntacticMatches, 28 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5248 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2565, Invalid=7535, Unknown=0, NotChecked=0, Total=10100 [2019-09-16 17:03:55,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-16 17:03:55,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-09-16 17:03:55,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-16 17:03:55,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 131 transitions. [2019-09-16 17:03:55,885 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 131 transitions. Word has length 108 [2019-09-16 17:03:55,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:55,885 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 131 transitions. [2019-09-16 17:03:55,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-16 17:03:55,886 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 131 transitions. [2019-09-16 17:03:55,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-16 17:03:55,887 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:55,887 INFO L407 BasicCegarLoop]: trace histogram [34, 33, 19, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:55,887 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:55,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:55,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1765490661, now seen corresponding path program 15 times [2019-09-16 17:03:55,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:55,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:55,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 17:03:55,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:55,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:56,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 524 proven. 1159 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:56,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:56,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:03:56,741 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-16 17:03:56,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-16 17:03:56,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:56,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-16 17:03:56,793 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-16 17:03:56,793 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-16 17:03:56,826 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-16 17:03:56,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 17:03:56,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-16 17:03:56,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:03:57,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 861 proven. 345 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-16 17:03:57,247 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:03:57,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 861 proven. 345 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-16 17:03:57,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:03:57,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 18, 18] total 83 [2019-09-16 17:03:57,899 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:03:57,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-16 17:03:57,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-16 17:03:57,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1277, Invalid=5529, Unknown=0, NotChecked=0, Total=6806 [2019-09-16 17:03:57,901 INFO L87 Difference]: Start difference. First operand 112 states and 131 transitions. Second operand 67 states. [2019-09-16 17:03:58,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:58,783 INFO L93 Difference]: Finished difference Result 116 states and 135 transitions. [2019-09-16 17:03:58,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-16 17:03:58,784 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 111 [2019-09-16 17:03:58,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:58,785 INFO L225 Difference]: With dead ends: 116 [2019-09-16 17:03:58,785 INFO L226 Difference]: Without dead ends: 116 [2019-09-16 17:03:58,788 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3036 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3067, Invalid=9815, Unknown=0, NotChecked=0, Total=12882 [2019-09-16 17:03:58,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-16 17:03:58,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-09-16 17:03:58,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-16 17:03:58,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 134 transitions. [2019-09-16 17:03:58,791 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 134 transitions. Word has length 111 [2019-09-16 17:03:58,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:58,791 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 134 transitions. [2019-09-16 17:03:58,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-16 17:03:58,792 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 134 transitions. [2019-09-16 17:03:58,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-16 17:03:58,793 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:58,793 INFO L407 BasicCegarLoop]: trace histogram [35, 34, 19, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:58,793 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:58,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:58,794 INFO L82 PathProgramCache]: Analyzing trace with hash 439492120, now seen corresponding path program 16 times [2019-09-16 17:03:58,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:58,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:58,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 17:03:58,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:58,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:59,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 527 proven. 1258 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:59,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:59,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:03:59,679 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-16 17:03:59,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-16 17:03:59,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:59,679 INFO 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-16 17:03:59,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:59,733 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:03:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:59,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-16 17:03:59,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:04:00,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 916 proven. 392 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-16 17:04:00,239 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:04:00,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 916 proven. 392 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-16 17:04:00,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:04:00,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 19, 19] total 87 [2019-09-16 17:04:00,895 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:04:00,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-16 17:04:00,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-16 17:04:00,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1413, Invalid=6069, Unknown=0, NotChecked=0, Total=7482 [2019-09-16 17:04:00,897 INFO L87 Difference]: Start difference. First operand 115 states and 134 transitions. Second operand 70 states. [2019-09-16 17:04:01,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:01,809 INFO L93 Difference]: Finished difference Result 119 states and 138 transitions. [2019-09-16 17:04:01,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-16 17:04:01,810 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 114 [2019-09-16 17:04:01,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:01,811 INFO L225 Difference]: With dead ends: 119 [2019-09-16 17:04:01,811 INFO L226 Difference]: Without dead ends: 119 [2019-09-16 17:04:01,812 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3331 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3434, Invalid=10846, Unknown=0, NotChecked=0, Total=14280 [2019-09-16 17:04:01,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-09-16 17:04:01,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-09-16 17:04:01,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-16 17:04:01,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 137 transitions. [2019-09-16 17:04:01,815 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 137 transitions. Word has length 114 [2019-09-16 17:04:01,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:01,815 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 137 transitions. [2019-09-16 17:04:01,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-16 17:04:01,816 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 137 transitions. [2019-09-16 17:04:01,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-16 17:04:01,816 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:01,816 INFO L407 BasicCegarLoop]: trace histogram [36, 35, 19, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:01,817 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:01,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:01,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1851695867, now seen corresponding path program 17 times [2019-09-16 17:04:01,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:01,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:01,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:01,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:01,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:02,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 530 proven. 1360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:02,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:02,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:04:02,835 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-16 17:04:02,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-16 17:04:02,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:02,836 INFO 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-16 17:04:02,894 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-16 17:04:02,894 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-16 17:04:02,953 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-09-16 17:04:02,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 17:04:02,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-16 17:04:02,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:04:03,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 1006 proven. 834 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-16 17:04:03,390 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:04:04,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 1006 proven. 834 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-16 17:04:04,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:04:04,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 21, 21] total 74 [2019-09-16 17:04:04,180 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:04:04,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-16 17:04:04,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-16 17:04:04,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1406, Invalid=3996, Unknown=0, NotChecked=0, Total=5402 [2019-09-16 17:04:04,182 INFO L87 Difference]: Start difference. First operand 118 states and 137 transitions. Second operand 74 states. [2019-09-16 17:04:05,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:05,236 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2019-09-16 17:04:05,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-16 17:04:05,242 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 117 [2019-09-16 17:04:05,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:05,243 INFO L225 Difference]: With dead ends: 122 [2019-09-16 17:04:05,243 INFO L226 Difference]: Without dead ends: 121 [2019-09-16 17:04:05,244 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 180 SyntacticMatches, 36 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6068 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3051, Invalid=8939, Unknown=0, NotChecked=0, Total=11990 [2019-09-16 17:04:05,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-16 17:04:05,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-09-16 17:04:05,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-16 17:04:05,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2019-09-16 17:04:05,248 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 117 [2019-09-16 17:04:05,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:05,249 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2019-09-16 17:04:05,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-16 17:04:05,249 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2019-09-16 17:04:05,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-16 17:04:05,249 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:05,250 INFO L407 BasicCegarLoop]: trace histogram [37, 36, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:05,250 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:05,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:05,250 INFO L82 PathProgramCache]: Analyzing trace with hash -686108872, now seen corresponding path program 18 times [2019-09-16 17:04:05,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:05,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:05,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 17:04:05,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:05,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:05,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 1026 proven. 495 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-16 17:04:05,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:05,489 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:04:05,489 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-16 17:04:05,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-16 17:04:05,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:05,489 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:04:05,568 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-16 17:04:05,568 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-16 17:04:05,611 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-16 17:04:05,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 17:04:05,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-16 17:04:05,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:04:05,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 1026 proven. 495 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-16 17:04:05,630 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:04:06,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 1026 proven. 495 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-16 17:04:06,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:04:06,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2019-09-16 17:04:06,018 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:04:06,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-16 17:04:06,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-16 17:04:06,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-16 17:04:06,019 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand 21 states. [2019-09-16 17:04:06,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:06,083 INFO L93 Difference]: Finished difference Result 125 states and 144 transitions. [2019-09-16 17:04:06,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-16 17:04:06,083 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 120 [2019-09-16 17:04:06,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:06,084 INFO L225 Difference]: With dead ends: 125 [2019-09-16 17:04:06,084 INFO L226 Difference]: Without dead ends: 125 [2019-09-16 17:04:06,085 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-16 17:04:06,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-16 17:04:06,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-09-16 17:04:06,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-16 17:04:06,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 143 transitions. [2019-09-16 17:04:06,089 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 143 transitions. Word has length 120 [2019-09-16 17:04:06,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:06,089 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 143 transitions. [2019-09-16 17:04:06,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-16 17:04:06,089 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 143 transitions. [2019-09-16 17:04:06,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-16 17:04:06,090 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:06,090 INFO L407 BasicCegarLoop]: trace histogram [38, 37, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:06,090 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:06,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:06,091 INFO L82 PathProgramCache]: Analyzing trace with hash -117776933, now seen corresponding path program 19 times [2019-09-16 17:04:06,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:06,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:06,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 17:04:06,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:06,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:06,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 0 proven. 1558 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-09-16 17:04:06,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:06,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:04:06,378 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-16 17:04:06,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-16 17:04:06,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:06,379 INFO 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-16 17:04:06,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:06,461 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:04:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:06,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-16 17:04:06,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:04:06,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 1081 proven. 551 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-16 17:04:06,860 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:04:07,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 1081 proven. 551 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-16 17:04:07,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:04:07,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 63 [2019-09-16 17:04:07,479 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:04:07,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-16 17:04:07,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-16 17:04:07,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1075, Invalid=2831, Unknown=0, NotChecked=0, Total=3906 [2019-09-16 17:04:07,480 INFO L87 Difference]: Start difference. First operand 124 states and 143 transitions. Second operand 43 states. [2019-09-16 17:04:08,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:08,610 INFO L93 Difference]: Finished difference Result 473 states and 603 transitions. [2019-09-16 17:04:08,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-16 17:04:08,613 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 123 [2019-09-16 17:04:08,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:08,615 INFO L225 Difference]: With dead ends: 473 [2019-09-16 17:04:08,615 INFO L226 Difference]: Without dead ends: 473 [2019-09-16 17:04:08,616 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1848 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3071, Invalid=7849, Unknown=0, NotChecked=0, Total=10920 [2019-09-16 17:04:08,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-09-16 17:04:08,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 160. [2019-09-16 17:04:08,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-16 17:04:08,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 190 transitions. [2019-09-16 17:04:08,624 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 190 transitions. Word has length 123 [2019-09-16 17:04:08,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:08,624 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 190 transitions. [2019-09-16 17:04:08,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-16 17:04:08,624 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 190 transitions. [2019-09-16 17:04:08,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-16 17:04:08,625 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:08,626 INFO L407 BasicCegarLoop]: trace histogram [40, 39, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:08,626 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:08,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:08,626 INFO L82 PathProgramCache]: Analyzing trace with hash 2023127357, now seen corresponding path program 20 times [2019-09-16 17:04:08,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:08,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:08,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:08,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:08,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:08,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 0 proven. 1730 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-09-16 17:04:08,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:08,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:04:08,927 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-16 17:04:08,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-16 17:04:08,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:08,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:04:08,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-16 17:04:08,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-16 17:04:09,079 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-09-16 17:04:09,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 17:04:09,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-16 17:04:09,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:04:09,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 1198 proven. 610 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2019-09-16 17:04:09,537 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:04:10,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 1198 proven. 610 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2019-09-16 17:04:10,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:04:10,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 66 [2019-09-16 17:04:10,270 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:04:10,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-16 17:04:10,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-16 17:04:10,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1181, Invalid=3109, Unknown=0, NotChecked=0, Total=4290 [2019-09-16 17:04:10,271 INFO L87 Difference]: Start difference. First operand 160 states and 190 transitions. Second operand 45 states. [2019-09-16 17:04:11,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:11,491 INFO L93 Difference]: Finished difference Result 540 states and 691 transitions. [2019-09-16 17:04:11,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-16 17:04:11,492 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 129 [2019-09-16 17:04:11,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:11,494 INFO L225 Difference]: With dead ends: 540 [2019-09-16 17:04:11,494 INFO L226 Difference]: Without dead ends: 540 [2019-09-16 17:04:11,495 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2035 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3371, Invalid=8619, Unknown=0, NotChecked=0, Total=11990 [2019-09-16 17:04:11,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-09-16 17:04:11,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 166. [2019-09-16 17:04:11,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-09-16 17:04:11,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 197 transitions. [2019-09-16 17:04:11,502 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 197 transitions. Word has length 129 [2019-09-16 17:04:11,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:11,503 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 197 transitions. [2019-09-16 17:04:11,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-16 17:04:11,503 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 197 transitions. [2019-09-16 17:04:11,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-16 17:04:11,504 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:11,504 INFO L407 BasicCegarLoop]: trace histogram [42, 41, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:11,504 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:11,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:11,504 INFO L82 PathProgramCache]: Analyzing trace with hash 800093275, now seen corresponding path program 21 times [2019-09-16 17:04:11,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:11,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:11,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 17:04:11,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:11,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:11,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 0 proven. 1911 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-09-16 17:04:11,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:11,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:04:11,786 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-16 17:04:11,786 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-16 17:04:11,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:11,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:04:11,859 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-16 17:04:11,859 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-16 17:04:11,903 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-16 17:04:11,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 17:04:11,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-16 17:04:11,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:04:12,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 1321 proven. 672 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2019-09-16 17:04:12,357 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:04:13,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 1321 proven. 672 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2019-09-16 17:04:13,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:04:13,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 69 [2019-09-16 17:04:13,118 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:04:13,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-16 17:04:13,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-16 17:04:13,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1292, Invalid=3400, Unknown=0, NotChecked=0, Total=4692 [2019-09-16 17:04:13,120 INFO L87 Difference]: Start difference. First operand 166 states and 197 transitions. Second operand 47 states. [2019-09-16 17:04:14,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:14,452 INFO L93 Difference]: Finished difference Result 577 states and 739 transitions. [2019-09-16 17:04:14,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-16 17:04:14,457 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 135 [2019-09-16 17:04:14,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:14,460 INFO L225 Difference]: With dead ends: 577 [2019-09-16 17:04:14,460 INFO L226 Difference]: Without dead ends: 577 [2019-09-16 17:04:14,467 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2231 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3685, Invalid=9425, Unknown=0, NotChecked=0, Total=13110 [2019-09-16 17:04:14,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-09-16 17:04:14,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 172. [2019-09-16 17:04:14,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:04:14,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 204 transitions. [2019-09-16 17:04:14,476 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 204 transitions. Word has length 135 [2019-09-16 17:04:14,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:14,477 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 204 transitions. [2019-09-16 17:04:14,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-16 17:04:14,477 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 204 transitions. [2019-09-16 17:04:14,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-16 17:04:14,478 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:14,478 INFO L407 BasicCegarLoop]: trace histogram [44, 43, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:14,478 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:14,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:14,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1026217533, now seen corresponding path program 22 times [2019-09-16 17:04:14,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:14,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:14,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 17:04:14,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:14,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:14,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 0 proven. 2101 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-09-16 17:04:14,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:14,856 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:04:14,856 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-16 17:04:14,856 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-16 17:04:14,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:14,856 INFO 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-16 17:04:14,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:14,935 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:04:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:14,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-16 17:04:14,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:04:15,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1450 proven. 737 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2019-09-16 17:04:15,434 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:04:16,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1450 proven. 737 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2019-09-16 17:04:16,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:04:16,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 72 [2019-09-16 17:04:16,397 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:04:16,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-16 17:04:16,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-16 17:04:16,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1408, Invalid=3704, Unknown=0, NotChecked=0, Total=5112 [2019-09-16 17:04:16,398 INFO L87 Difference]: Start difference. First operand 172 states and 204 transitions. Second operand 49 states. [2019-09-16 17:04:17,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:17,863 INFO L93 Difference]: Finished difference Result 614 states and 787 transitions. [2019-09-16 17:04:17,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-16 17:04:17,868 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 141 [2019-09-16 17:04:17,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:17,871 INFO L225 Difference]: With dead ends: 614 [2019-09-16 17:04:17,871 INFO L226 Difference]: Without dead ends: 614 [2019-09-16 17:04:17,872 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2436 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4013, Invalid=10267, Unknown=0, NotChecked=0, Total=14280 [2019-09-16 17:04:17,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-09-16 17:04:17,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 178. [2019-09-16 17:04:17,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-16 17:04:17,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 211 transitions. [2019-09-16 17:04:17,880 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 211 transitions. Word has length 141 [2019-09-16 17:04:17,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:17,881 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 211 transitions. [2019-09-16 17:04:17,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-16 17:04:17,881 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 211 transitions. [2019-09-16 17:04:17,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-16 17:04:17,882 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:17,882 INFO L407 BasicCegarLoop]: trace histogram [46, 45, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:17,882 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:17,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:17,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1410456283, now seen corresponding path program 23 times [2019-09-16 17:04:17,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:17,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:17,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:17,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:17,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:18,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 0 proven. 2300 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2019-09-16 17:04:18,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:18,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:04:18,646 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-16 17:04:18,646 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-16 17:04:18,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:18,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-16 17:04:18,734 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-16 17:04:18,734 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-16 17:04:18,819 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-09-16 17:04:18,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 17:04:18,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-16 17:04:18,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:04:19,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 1585 proven. 805 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-09-16 17:04:19,324 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:04:20,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 1585 proven. 805 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-09-16 17:04:20,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:04:20,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 75 [2019-09-16 17:04:20,221 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:04:20,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-16 17:04:20,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-16 17:04:20,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1529, Invalid=4021, Unknown=0, NotChecked=0, Total=5550 [2019-09-16 17:04:20,223 INFO L87 Difference]: Start difference. First operand 178 states and 211 transitions. Second operand 51 states. [2019-09-16 17:04:21,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:21,817 INFO L93 Difference]: Finished difference Result 651 states and 835 transitions. [2019-09-16 17:04:21,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-16 17:04:21,818 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 147 [2019-09-16 17:04:21,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:21,821 INFO L225 Difference]: With dead ends: 651 [2019-09-16 17:04:21,822 INFO L226 Difference]: Without dead ends: 651 [2019-09-16 17:04:21,822 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2650 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4355, Invalid=11145, Unknown=0, NotChecked=0, Total=15500 [2019-09-16 17:04:21,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-09-16 17:04:21,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 184. [2019-09-16 17:04:21,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-16 17:04:21,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 218 transitions. [2019-09-16 17:04:21,830 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 218 transitions. Word has length 147 [2019-09-16 17:04:21,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:21,830 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 218 transitions. [2019-09-16 17:04:21,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-16 17:04:21,831 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 218 transitions. [2019-09-16 17:04:21,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-16 17:04:21,831 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:21,832 INFO L407 BasicCegarLoop]: trace histogram [48, 47, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:21,832 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:21,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:21,832 INFO L82 PathProgramCache]: Analyzing trace with hash -703061187, now seen corresponding path program 24 times [2019-09-16 17:04:21,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:21,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:21,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 17:04:21,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:21,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:22,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 0 proven. 2508 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2019-09-16 17:04:22,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:22,204 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:04:22,204 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-16 17:04:22,204 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-16 17:04:22,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:22,204 INFO 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-16 17:04:22,296 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-16 17:04:22,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-16 17:04:22,351 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-16 17:04:22,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 17:04:22,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-16 17:04:22,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:04:22,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 1726 proven. 876 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2019-09-16 17:04:22,849 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:04:23,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 1726 proven. 876 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (25)] Exception during sending of exit command (exit): Stream closed [2019-09-16 17:04:23,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:04:23,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 78 [2019-09-16 17:04:23,844 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:04:23,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-16 17:04:23,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-16 17:04:23,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1655, Invalid=4351, Unknown=0, NotChecked=0, Total=6006 [2019-09-16 17:04:23,845 INFO L87 Difference]: Start difference. First operand 184 states and 218 transitions. Second operand 53 states. [2019-09-16 17:04:25,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:25,510 INFO L93 Difference]: Finished difference Result 688 states and 883 transitions. [2019-09-16 17:04:25,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-16 17:04:25,512 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 153 [2019-09-16 17:04:25,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:25,516 INFO L225 Difference]: With dead ends: 688 [2019-09-16 17:04:25,516 INFO L226 Difference]: Without dead ends: 688 [2019-09-16 17:04:25,519 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2873 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4711, Invalid=12059, Unknown=0, NotChecked=0, Total=16770 [2019-09-16 17:04:25,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2019-09-16 17:04:25,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 190. [2019-09-16 17:04:25,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-16 17:04:25,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 225 transitions. [2019-09-16 17:04:25,528 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 225 transitions. Word has length 153 [2019-09-16 17:04:25,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:25,529 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 225 transitions. [2019-09-16 17:04:25,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-16 17:04:25,529 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 225 transitions. [2019-09-16 17:04:25,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-16 17:04:25,530 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:25,530 INFO L407 BasicCegarLoop]: trace histogram [50, 49, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:25,530 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:25,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:25,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1384443557, now seen corresponding path program 25 times [2019-09-16 17:04:25,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:25,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:25,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 17:04:25,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:25,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:25,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 0 proven. 2725 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2019-09-16 17:04:25,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:25,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:04:25,969 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-16 17:04:25,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-16 17:04:25,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:25,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-16 17:04:26,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:26,077 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:04:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:26,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-16 17:04:26,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:04:26,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 1873 proven. 950 refuted. 0 times theorem prover too weak. 852 trivial. 0 not checked. [2019-09-16 17:04:26,650 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:04:27,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 1873 proven. 950 refuted. 0 times theorem prover too weak. 852 trivial. 0 not checked. [2019-09-16 17:04:27,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:04:27,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 79 [2019-09-16 17:04:27,640 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:04:27,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-16 17:04:27,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-16 17:04:27,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1681, Invalid=4481, Unknown=0, NotChecked=0, Total=6162 [2019-09-16 17:04:27,641 INFO L87 Difference]: Start difference. First operand 190 states and 225 transitions. Second operand 55 states. [2019-09-16 17:04:29,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:29,390 INFO L93 Difference]: Finished difference Result 725 states and 931 transitions. [2019-09-16 17:04:29,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-16 17:04:29,395 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 159 [2019-09-16 17:04:29,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:29,399 INFO L225 Difference]: With dead ends: 725 [2019-09-16 17:04:29,399 INFO L226 Difference]: Without dead ends: 725 [2019-09-16 17:04:29,400 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 316 SyntacticMatches, 2 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3150 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4872, Invalid=12684, Unknown=0, NotChecked=0, Total=17556 [2019-09-16 17:04:29,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2019-09-16 17:04:29,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 196. [2019-09-16 17:04:29,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-16 17:04:29,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 232 transitions. [2019-09-16 17:04:29,408 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 232 transitions. Word has length 159 [2019-09-16 17:04:29,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:29,409 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 232 transitions. [2019-09-16 17:04:29,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-16 17:04:29,409 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 232 transitions. [2019-09-16 17:04:29,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-16 17:04:29,410 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:29,410 INFO L407 BasicCegarLoop]: trace histogram [52, 51, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:29,410 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:29,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:29,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1650614333, now seen corresponding path program 26 times [2019-09-16 17:04:29,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:29,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:29,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:29,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:29,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:29,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 0 proven. 2951 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2019-09-16 17:04:29,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:29,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:04:29,967 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-16 17:04:29,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-16 17:04:29,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:29,968 INFO 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-16 17:04:30,083 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-16 17:04:30,083 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-16 17:04:30,198 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-09-16 17:04:30,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 17:04:30,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-16 17:04:30,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:04:32,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 347 proven. 3626 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-16 17:04:32,051 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:04:33,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 347 proven. 3626 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-16 17:04:33,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:04:33,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 52, 52] total 80 [2019-09-16 17:04:33,526 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:04:33,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-16 17:04:33,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-16 17:04:33,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1708, Invalid=4612, Unknown=0, NotChecked=0, Total=6320 [2019-09-16 17:04:33,528 INFO L87 Difference]: Start difference. First operand 196 states and 232 transitions. Second operand 80 states. [2019-09-16 17:04:38,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:38,601 INFO L93 Difference]: Finished difference Result 1004 states and 1221 transitions. [2019-09-16 17:04:38,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2019-09-16 17:04:38,601 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 165 [2019-09-16 17:04:38,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:38,605 INFO L225 Difference]: With dead ends: 1004 [2019-09-16 17:04:38,606 INFO L226 Difference]: Without dead ends: 1004 [2019-09-16 17:04:38,607 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 282 SyntacticMatches, 50 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13047 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=9149, Invalid=33493, Unknown=0, NotChecked=0, Total=42642 [2019-09-16 17:04:38,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2019-09-16 17:04:38,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 271. [2019-09-16 17:04:38,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-16 17:04:38,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 308 transitions. [2019-09-16 17:04:38,617 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 308 transitions. Word has length 165 [2019-09-16 17:04:38,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:38,617 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 308 transitions. [2019-09-16 17:04:38,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-16 17:04:38,618 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 308 transitions. [2019-09-16 17:04:38,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-16 17:04:38,619 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:38,619 INFO L407 BasicCegarLoop]: trace histogram [77, 76, 50, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:38,619 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:38,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:38,620 INFO L82 PathProgramCache]: Analyzing trace with hash 676952248, now seen corresponding path program 27 times [2019-09-16 17:04:38,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:38,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 17:04:38,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:40,231 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 6618 proven. 2081 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-16 17:04:40,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:40,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:04:40,231 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-16 17:04:40,232 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-16 17:04:40,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:40,232 INFO 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-16 17:04:40,349 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-16 17:04:40,350 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-16 17:04:40,430 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-16 17:04:40,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 17:04:40,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 79 conjunts are in the unsatisfiable core [2019-09-16 17:04:40,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:04:40,501 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 6618 proven. 2081 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-16 17:04:40,502 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:04:41,351 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 6618 proven. 2081 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-16 17:04:41,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:04:41,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 76 [2019-09-16 17:04:41,355 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:04:41,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-16 17:04:41,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-16 17:04:41,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-16 17:04:41,357 INFO L87 Difference]: Start difference. First operand 271 states and 308 transitions. Second operand 53 states. [2019-09-16 17:04:42,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:42,138 INFO L93 Difference]: Finished difference Result 1542 states and 1989 transitions. [2019-09-16 17:04:42,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-16 17:04:42,138 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 240 [2019-09-16 17:04:42,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:42,145 INFO L225 Difference]: With dead ends: 1542 [2019-09-16 17:04:42,145 INFO L226 Difference]: Without dead ends: 1542 [2019-09-16 17:04:42,146 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 431 SyntacticMatches, 54 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4271 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-16 17:04:42,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-09-16 17:04:42,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 313. [2019-09-16 17:04:42,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-09-16 17:04:42,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 364 transitions. [2019-09-16 17:04:42,160 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 364 transitions. Word has length 240 [2019-09-16 17:04:42,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:42,161 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 364 transitions. [2019-09-16 17:04:42,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-16 17:04:42,161 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 364 transitions. [2019-09-16 17:04:42,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-16 17:04:42,163 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:42,164 INFO L407 BasicCegarLoop]: trace histogram [101, 100, 51, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:42,164 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:42,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:42,164 INFO L82 PathProgramCache]: Analyzing trace with hash -644776136, now seen corresponding path program 28 times [2019-09-16 17:04:42,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:42,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:42,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 17:04:42,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:42,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:46,228 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 0 proven. 15150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:46,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:46,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:04:46,229 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-16 17:04:46,229 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-16 17:04:46,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:46,229 INFO 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-16 17:04:46,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:46,344 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:04:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:46,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 158 conjunts are in the unsatisfiable core [2019-09-16 17:04:46,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:04:46,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 17:04:46,806 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 0 proven. 15150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:46,806 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:04:48,088 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 0 proven. 15150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:48,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:04:48,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 108 [2019-09-16 17:04:48,092 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:04:48,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-09-16 17:04:48,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-09-16 17:04:48,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1491, Invalid=10065, Unknown=0, NotChecked=0, Total=11556 [2019-09-16 17:04:48,094 INFO L87 Difference]: Start difference. First operand 313 states and 364 transitions. Second operand 108 states. [2019-09-16 17:04:55,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:55,153 INFO L93 Difference]: Finished difference Result 4239 states and 4339 transitions. [2019-09-16 17:04:55,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-09-16 17:04:55,153 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 312 [2019-09-16 17:04:55,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:55,174 INFO L225 Difference]: With dead ends: 4239 [2019-09-16 17:04:55,175 INFO L226 Difference]: Without dead ends: 4236 [2019-09-16 17:04:55,175 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 730 GetRequests, 571 SyntacticMatches, 52 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4133 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1497, Invalid=10275, Unknown=0, NotChecked=0, Total=11772 [2019-09-16 17:04:55,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4236 states. [2019-09-16 17:04:55,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4236 to 4187. [2019-09-16 17:04:55,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4187 states. [2019-09-16 17:04:55,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4187 states to 4187 states and 4287 transitions. [2019-09-16 17:04:55,246 INFO L78 Accepts]: Start accepts. Automaton has 4187 states and 4287 transitions. Word has length 312 [2019-09-16 17:04:55,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:55,247 INFO L475 AbstractCegarLoop]: Abstraction has 4187 states and 4287 transitions. [2019-09-16 17:04:55,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-09-16 17:04:55,247 INFO L276 IsEmpty]: Start isEmpty. Operand 4187 states and 4287 transitions. [2019-09-16 17:04:55,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-09-16 17:04:55,249 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:55,249 INFO L407 BasicCegarLoop]: trace histogram [102, 101, 52, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:55,250 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:55,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:55,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1847249315, now seen corresponding path program 29 times [2019-09-16 17:04:55,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:55,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:55,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:55,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:55,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:56,483 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7903 proven. 7401 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-09-16 17:04:56,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:56,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:04:56,483 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-16 17:04:56,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-16 17:04:56,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:56,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:04:56,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-16 17:04:56,622 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-16 17:04:56,920 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 102 check-sat command(s) [2019-09-16 17:04:56,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 17:04:56,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 103 conjunts are in the unsatisfiable core [2019-09-16 17:04:56,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:04:57,057 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7903 proven. 7401 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-09-16 17:04:57,057 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:04:59,582 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7903 proven. 7401 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-09-16 17:04:59,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:04:59,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 54 [2019-09-16 17:04:59,586 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:04:59,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-16 17:04:59,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-16 17:04:59,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-16 17:04:59,588 INFO L87 Difference]: Start difference. First operand 4187 states and 4287 transitions. Second operand 54 states. [2019-09-16 17:05:00,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:00,265 INFO L93 Difference]: Finished difference Result 4341 states and 4441 transitions. [2019-09-16 17:05:00,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-16 17:05:00,266 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 315 [2019-09-16 17:05:00,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:00,282 INFO L225 Difference]: With dead ends: 4341 [2019-09-16 17:05:00,283 INFO L226 Difference]: Without dead ends: 4190 [2019-09-16 17:05:00,290 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 579 SyntacticMatches, 102 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2950 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-16 17:05:00,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2019-09-16 17:05:00,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 4190. [2019-09-16 17:05:00,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4190 states. [2019-09-16 17:05:00,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 4290 transitions. [2019-09-16 17:05:00,354 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 4290 transitions. Word has length 315 [2019-09-16 17:05:00,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:00,355 INFO L475 AbstractCegarLoop]: Abstraction has 4190 states and 4290 transitions. [2019-09-16 17:05:00,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-16 17:05:00,355 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 4290 transitions. [2019-09-16 17:05:00,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-16 17:05:00,357 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:00,357 INFO L407 BasicCegarLoop]: trace histogram [103, 102, 52, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:00,357 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:00,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:00,358 INFO L82 PathProgramCache]: Analyzing trace with hash -973780774, now seen corresponding path program 30 times [2019-09-16 17:05:00,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:00,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:00,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 17:05:00,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:00,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:00,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:01,654 INFO L134 CoverageAnalysis]: Checked inductivity of 15759 backedges. 11729 proven. 0 refuted. 0 times theorem prover too weak. 4030 trivial. 0 not checked. [2019-09-16 17:05:01,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:01,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2019-09-16 17:05:01,654 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:01,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-16 17:05:01,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-16 17:05:01,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-16 17:05:01,656 INFO L87 Difference]: Start difference. First operand 4190 states and 4290 transitions. Second operand 53 states. [2019-09-16 17:05:01,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:01,860 INFO L93 Difference]: Finished difference Result 157 states and 156 transitions. [2019-09-16 17:05:01,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-16 17:05:01,860 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 318 [2019-09-16 17:05:01,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:01,861 INFO L225 Difference]: With dead ends: 157 [2019-09-16 17:05:01,861 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 17:05:01,862 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-16 17:05:01,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 17:05:01,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 17:05:01,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 17:05:01,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 17:05:01,862 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 318 [2019-09-16 17:05:01,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:01,863 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 17:05:01,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-16 17:05:01,863 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 17:05:01,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 17:05:01,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:05:01 BoogieIcfgContainer [2019-09-16 17:05:01,871 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:05:01,873 INFO L168 Benchmark]: Toolchain (without parser) took 86705.79 ms. Allocated memory was 133.2 MB in the beginning and 821.0 MB in the end (delta: 687.9 MB). Free memory was 89.3 MB in the beginning and 375.3 MB in the end (delta: -285.9 MB). Peak memory consumption was 401.9 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:01,874 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 133.2 MB. Free memory was 107.3 MB in the beginning and 107.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 17:05:01,875 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.64 ms. Allocated memory is still 133.2 MB. Free memory was 88.9 MB in the beginning and 79.8 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:01,876 INFO L168 Benchmark]: Boogie Preprocessor took 115.57 ms. Allocated memory was 133.2 MB in the beginning and 199.8 MB in the end (delta: 66.6 MB). Free memory was 79.8 MB in the beginning and 176.7 MB in the end (delta: -96.9 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:01,877 INFO L168 Benchmark]: RCFGBuilder took 234.47 ms. Allocated memory is still 199.8 MB. Free memory was 176.7 MB in the beginning and 164.5 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:01,879 INFO L168 Benchmark]: TraceAbstraction took 86091.25 ms. Allocated memory was 199.8 MB in the beginning and 821.0 MB in the end (delta: 621.3 MB). Free memory was 164.5 MB in the beginning and 375.3 MB in the end (delta: -210.8 MB). Peak memory consumption was 410.5 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:01,892 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 133.2 MB. Free memory was 107.3 MB in the beginning and 107.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 255.64 ms. Allocated memory is still 133.2 MB. Free memory was 88.9 MB in the beginning and 79.8 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 115.57 ms. Allocated memory was 133.2 MB in the beginning and 199.8 MB in the end (delta: 66.6 MB). Free memory was 79.8 MB in the beginning and 176.7 MB in the end (delta: -96.9 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 234.47 ms. Allocated memory is still 199.8 MB. Free memory was 176.7 MB in the beginning and 164.5 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 86091.25 ms. Allocated memory was 199.8 MB in the beginning and 821.0 MB in the end (delta: 621.3 MB). Free memory was 164.5 MB in the beginning and 375.3 MB in the end (delta: -210.8 MB). Peak memory consumption was 410.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. SAFE Result, 86.0s OverallTime, 33 OverallIterations, 103 TraceHistogramMax, 32.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 664 SDtfs, 724 SDslu, 21722 SDs, 0 SdLazy, 16431 SolverSat, 2397 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9080 GetRequests, 6235 SyntacticMatches, 359 SemanticMatches, 2486 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73119 ImplicationChecksByTransitivity, 62.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4190occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 33 MinimizatonAttempts, 5322 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 47.2s InterpolantComputationTime, 7138 NumberOfCodeBlocks, 7138 NumberOfCodeBlocksAsserted, 432 NumberOfCheckSat, 10440 ConstructedInterpolants, 0 QuantifiedInterpolants, 5305820 SizeOfPredicates, 30 NumberOfNonLiveVariables, 7917 ConjunctsInSsa, 835 ConjunctsInUnsatCore, 91 InterpolantComputations, 4 PerfectInterpolantSequences, 128387/256338 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...