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/loops-crafted-1/nested3-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:17:23,518 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:17:23,520 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:17:23,533 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:17:23,533 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:17:23,534 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:17:23,535 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:17:23,537 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:17:23,539 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:17:23,539 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:17:23,540 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:17:23,541 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:17:23,542 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:17:23,543 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:17:23,544 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:17:23,545 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:17:23,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:17:23,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:17:23,548 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:17:23,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:17:23,551 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:17:23,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:17:23,553 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:17:23,554 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:17:23,556 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:17:23,557 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:17:23,557 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:17:23,558 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:17:23,558 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:17:23,559 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:17:23,559 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:17:23,560 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:17:23,561 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:17:23,562 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:17:23,563 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:17:23,563 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:17:23,563 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:17:23,564 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:17:23,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:17:23,565 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:17:23,565 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:17:23,566 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:17:23,580 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:17:23,580 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:17:23,581 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:17:23,581 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:17:23,581 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:17:23,582 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:17:23,582 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:17:23,582 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:17:23,582 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:17:23,582 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:17:23,583 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:17:23,583 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:17:23,583 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:17:23,583 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:17:23,584 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:17:23,584 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:17:23,584 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:17:23,584 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:17:23,584 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:17:23,584 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:17:23,585 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:17:23,585 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:17:23,585 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:17:23,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:17:23,586 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:17:23,586 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:17:23,586 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:17:23,586 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:17:23,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:17:23,587 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:17:23,614 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:17:23,626 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:17:23,629 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:17:23,631 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:17:23,631 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:17:23,632 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested3-2.c [2019-09-10 02:17:23,686 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d790bbbb/5ab81a189041468794379eb3000243d9/FLAG4ff1186ae [2019-09-10 02:17:24,110 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:17:24,111 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested3-2.c [2019-09-10 02:17:24,117 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d790bbbb/5ab81a189041468794379eb3000243d9/FLAG4ff1186ae [2019-09-10 02:17:24,511 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d790bbbb/5ab81a189041468794379eb3000243d9 [2019-09-10 02:17:24,520 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:17:24,521 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:17:24,522 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:17:24,523 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:17:24,527 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:17:24,528 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:17:24" (1/1) ... [2019-09-10 02:17:24,531 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19027eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:17:24, skipping insertion in model container [2019-09-10 02:17:24,531 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:17:24" (1/1) ... [2019-09-10 02:17:24,538 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:17:24,555 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:17:24,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:17:24,763 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:17:24,785 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:17:24,798 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:17:24,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:17:24 WrapperNode [2019-09-10 02:17:24,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:17:24,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:17:24,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:17:24,799 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:17:24,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:17:24" (1/1) ... [2019-09-10 02:17:24,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:17:24" (1/1) ... [2019-09-10 02:17:24,890 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:17:24" (1/1) ... [2019-09-10 02:17:24,891 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:17:24" (1/1) ... [2019-09-10 02:17:24,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:17:24" (1/1) ... [2019-09-10 02:17:24,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:17:24" (1/1) ... [2019-09-10 02:17:24,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:17:24" (1/1) ... [2019-09-10 02:17:24,913 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:17:24,913 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:17:24,913 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:17:24,913 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:17:24,915 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:17:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:17:24,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:17:24,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:17:24,966 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-10 02:17:24,966 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:17:24,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:17:24,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 02:17:24,967 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:17:24,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:17:24,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:17:25,152 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:17:25,153 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-10 02:17:25,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:17:25 BoogieIcfgContainer [2019-09-10 02:17:25,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:17:25,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:17:25,155 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:17:25,158 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:17:25,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:17:24" (1/3) ... [2019-09-10 02:17:25,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2686032c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:17:25, skipping insertion in model container [2019-09-10 02:17:25,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:17:24" (2/3) ... [2019-09-10 02:17:25,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2686032c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:17:25, skipping insertion in model container [2019-09-10 02:17:25,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:17:25" (3/3) ... [2019-09-10 02:17:25,161 INFO L109 eAbstractionObserver]: Analyzing ICFG nested3-2.c [2019-09-10 02:17:25,170 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:17:25,177 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:17:25,194 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:17:25,221 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:17:25,221 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:17:25,221 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:17:25,221 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:17:25,221 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:17:25,222 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:17:25,222 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:17:25,222 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:17:25,236 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-09-10 02:17:25,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 02:17:25,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:25,244 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:25,246 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:25,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:25,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1303616190, now seen corresponding path program 1 times [2019-09-10 02:17:25,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:25,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:25,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:25,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:25,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:25,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:25,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:17:25,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 02:17:25,344 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:17:25,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:17:25,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:17:25,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:17:25,366 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2019-09-10 02:17:25,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:25,383 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-09-10 02:17:25,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:17:25,385 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-10 02:17:25,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:25,394 INFO L225 Difference]: With dead ends: 23 [2019-09-10 02:17:25,394 INFO L226 Difference]: Without dead ends: 19 [2019-09-10 02:17:25,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:17:25,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-10 02:17:25,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-10 02:17:25,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-10 02:17:25,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-09-10 02:17:25,436 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 10 [2019-09-10 02:17:25,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:25,436 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-09-10 02:17:25,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:17:25,437 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-09-10 02:17:25,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 02:17:25,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:25,438 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:25,438 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:25,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:25,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1274063518, now seen corresponding path program 1 times [2019-09-10 02:17:25,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:25,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:25,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:25,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:25,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:25,692 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 5 [2019-09-10 02:17:25,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:25,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:17:25,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:17:25,697 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:17:25,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:17:25,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:17:25,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:17:25,699 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 3 states. [2019-09-10 02:17:25,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:25,716 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-09-10 02:17:25,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:17:25,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-10 02:17:25,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:25,718 INFO L225 Difference]: With dead ends: 26 [2019-09-10 02:17:25,718 INFO L226 Difference]: Without dead ends: 26 [2019-09-10 02:17:25,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:17:25,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-10 02:17:25,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2019-09-10 02:17:25,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-10 02:17:25,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-09-10 02:17:25,726 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 10 [2019-09-10 02:17:25,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:25,727 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-09-10 02:17:25,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:17:25,727 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-09-10 02:17:25,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-10 02:17:25,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:25,728 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:25,728 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:25,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:25,729 INFO L82 PathProgramCache]: Analyzing trace with hash 856543284, now seen corresponding path program 1 times [2019-09-10 02:17:25,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:25,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:25,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:25,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:25,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:25,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:25,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:17:25,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:17:25,786 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:17:25,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:17:25,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:17:25,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:17:25,788 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-09-10 02:17:25,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:25,807 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2019-09-10 02:17:25,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:17:25,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-09-10 02:17:25,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:25,808 INFO L225 Difference]: With dead ends: 24 [2019-09-10 02:17:25,809 INFO L226 Difference]: Without dead ends: 24 [2019-09-10 02:17:25,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:17:25,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-10 02:17:25,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-09-10 02:17:25,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-10 02:17:25,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-09-10 02:17:25,814 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 11 [2019-09-10 02:17:25,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:25,814 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-09-10 02:17:25,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:17:25,815 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-09-10 02:17:25,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-10 02:17:25,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:25,816 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:25,816 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:25,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:25,817 INFO L82 PathProgramCache]: Analyzing trace with hash 808417067, now seen corresponding path program 1 times [2019-09-10 02:17:25,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:25,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:25,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:25,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:25,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:25,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:25,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:17:25,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:17:25,875 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:17:25,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:17:25,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:17:25,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:17:25,876 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 3 states. [2019-09-10 02:17:25,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:25,888 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-09-10 02:17:25,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:17:25,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-09-10 02:17:25,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:25,890 INFO L225 Difference]: With dead ends: 23 [2019-09-10 02:17:25,890 INFO L226 Difference]: Without dead ends: 23 [2019-09-10 02:17:25,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:17:25,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-10 02:17:25,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-09-10 02:17:25,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-10 02:17:25,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-09-10 02:17:25,896 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 12 [2019-09-10 02:17:25,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:25,896 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-09-10 02:17:25,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:17:25,896 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-09-10 02:17:25,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 02:17:25,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:25,897 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:25,898 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:25,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:25,898 INFO L82 PathProgramCache]: Analyzing trace with hash -681648618, now seen corresponding path program 1 times [2019-09-10 02:17:25,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:25,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:25,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:25,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:25,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:25,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:26,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:26,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:26,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:26,015 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-09-10 02:17:26,017 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [22], [29], [31], [47], [50], [52], [58], [59], [60], [62] [2019-09-10 02:17:26,056 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:17:26,056 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:17:26,109 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 02:17:26,601 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:17:26,604 INFO L272 AbstractInterpreter]: Visited 13 different actions 49 times. Merged at 2 different actions 12 times. Widened at 1 different actions 4 times. Performed 84 root evaluator evaluations with a maximum evaluation depth of 13. Performed 84 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2019-09-10 02:17:26,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:26,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:17:26,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:26,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:17:26,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:26,635 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:26,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 02:17:26,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:26,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:26,691 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:26,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:26,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:26,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-09-10 02:17:26,727 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:26,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:17:26,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:17:26,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:17:26,729 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 5 states. [2019-09-10 02:17:26,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:26,758 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2019-09-10 02:17:26,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:17:26,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-10 02:17:26,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:26,759 INFO L225 Difference]: With dead ends: 24 [2019-09-10 02:17:26,760 INFO L226 Difference]: Without dead ends: 24 [2019-09-10 02:17:26,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:17:26,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-10 02:17:26,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-10 02:17:26,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-10 02:17:26,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-09-10 02:17:26,764 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2019-09-10 02:17:26,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:26,764 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-09-10 02:17:26,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:17:26,765 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-09-10 02:17:26,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-10 02:17:26,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:26,766 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:26,766 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:26,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:26,767 INFO L82 PathProgramCache]: Analyzing trace with hash 370955403, now seen corresponding path program 2 times [2019-09-10 02:17:26,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:26,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:26,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:26,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:26,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:26,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:26,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:26,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:26,854 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:26,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:26,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:26,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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:17:26,871 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:17:26,872 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:26,892 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-10 02:17:26,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:17:26,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 02:17:26,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:26,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:26,922 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:26,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:26,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:26,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-09-10 02:17:26,977 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:26,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:17:26,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:17:26,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:17:26,978 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2019-09-10 02:17:27,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:27,018 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2019-09-10 02:17:27,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:17:27,019 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-09-10 02:17:27,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:27,020 INFO L225 Difference]: With dead ends: 25 [2019-09-10 02:17:27,020 INFO L226 Difference]: Without dead ends: 25 [2019-09-10 02:17:27,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:17:27,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-10 02:17:27,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-09-10 02:17:27,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-10 02:17:27,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-09-10 02:17:27,024 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 14 [2019-09-10 02:17:27,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:27,024 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-09-10 02:17:27,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:17:27,025 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-09-10 02:17:27,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-10 02:17:27,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:27,026 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:27,026 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:27,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:27,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1358058314, now seen corresponding path program 3 times [2019-09-10 02:17:27,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:27,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:27,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:17:27,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:27,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:27,142 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:27,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:27,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:27,143 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:27,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:27,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:27,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:27,157 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:17:27,157 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:17:27,169 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:17:27,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:17:27,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-10 02:17:27,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:27,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:27,192 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:27,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:27,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:27,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-09-10 02:17:27,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:27,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:17:27,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:17:27,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:17:27,273 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 7 states. [2019-09-10 02:17:27,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:27,317 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-09-10 02:17:27,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:17:27,319 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-09-10 02:17:27,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:27,320 INFO L225 Difference]: With dead ends: 26 [2019-09-10 02:17:27,320 INFO L226 Difference]: Without dead ends: 26 [2019-09-10 02:17:27,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:17:27,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-10 02:17:27,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-09-10 02:17:27,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-10 02:17:27,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-09-10 02:17:27,324 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 15 [2019-09-10 02:17:27,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:27,324 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-09-10 02:17:27,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:17:27,324 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-09-10 02:17:27,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-10 02:17:27,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:27,325 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:27,325 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:27,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:27,326 INFO L82 PathProgramCache]: Analyzing trace with hash 877091307, now seen corresponding path program 4 times [2019-09-10 02:17:27,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:27,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:27,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:17:27,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:27,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:27,417 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:27,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:27,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:27,418 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:27,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:27,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:27,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:27,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:27,432 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:17:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:27,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-10 02:17:27,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:27,468 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:27,468 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:27,578 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:27,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:27,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-09-10 02:17:27,582 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:27,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:17:27,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:17:27,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:17:27,583 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 8 states. [2019-09-10 02:17:27,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:27,639 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2019-09-10 02:17:27,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:17:27,640 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-09-10 02:17:27,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:27,642 INFO L225 Difference]: With dead ends: 27 [2019-09-10 02:17:27,643 INFO L226 Difference]: Without dead ends: 27 [2019-09-10 02:17:27,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:17:27,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-10 02:17:27,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-09-10 02:17:27,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-10 02:17:27,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-09-10 02:17:27,649 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2019-09-10 02:17:27,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:27,649 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-09-10 02:17:27,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:17:27,651 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-09-10 02:17:27,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 02:17:27,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:27,651 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:27,652 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:27,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:27,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1447252822, now seen corresponding path program 5 times [2019-09-10 02:17:27,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:27,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:27,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:27,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:27,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:27,783 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:27,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:27,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:27,783 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:27,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:27,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:27,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:17:27,797 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:17:27,797 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:28,962 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-10 02:17:28,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:17:28,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 02:17:28,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:29,007 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:29,007 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:29,149 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:29,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:29,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-09-10 02:17:29,155 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:29,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:17:29,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:17:29,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:17:29,156 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 9 states. [2019-09-10 02:17:29,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:29,229 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2019-09-10 02:17:29,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:17:29,229 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-09-10 02:17:29,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:29,230 INFO L225 Difference]: With dead ends: 28 [2019-09-10 02:17:29,230 INFO L226 Difference]: Without dead ends: 28 [2019-09-10 02:17:29,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:17:29,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-10 02:17:29,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-10 02:17:29,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-10 02:17:29,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-09-10 02:17:29,234 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 17 [2019-09-10 02:17:29,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:29,234 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-09-10 02:17:29,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:17:29,235 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-09-10 02:17:29,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 02:17:29,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:29,235 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:29,236 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:29,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:29,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1942390603, now seen corresponding path program 6 times [2019-09-10 02:17:29,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:29,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:29,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:17:29,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:29,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:29,339 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:29,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:29,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:29,340 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:29,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:29,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:29,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:29,356 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:17:29,356 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:17:29,368 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:17:29,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:17:29,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-10 02:17:29,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:29,392 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:29,392 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:29,564 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:29,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:29,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-09-10 02:17:29,568 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:29,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:17:29,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:17:29,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:17:29,570 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 10 states. [2019-09-10 02:17:29,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:29,643 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2019-09-10 02:17:29,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:17:29,644 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-09-10 02:17:29,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:29,645 INFO L225 Difference]: With dead ends: 29 [2019-09-10 02:17:29,645 INFO L226 Difference]: Without dead ends: 29 [2019-09-10 02:17:29,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:17:29,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-10 02:17:29,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-09-10 02:17:29,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-10 02:17:29,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-09-10 02:17:29,649 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 18 [2019-09-10 02:17:29,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:29,651 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-09-10 02:17:29,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:17:29,651 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-09-10 02:17:29,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-10 02:17:29,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:29,652 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:29,652 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:29,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:29,653 INFO L82 PathProgramCache]: Analyzing trace with hash 111792630, now seen corresponding path program 7 times [2019-09-10 02:17:29,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:29,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:29,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:17:29,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:29,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:29,789 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:29,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:29,789 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:29,789 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:29,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:29,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:29,790 INFO 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-10 02:17:29,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:29,813 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:17:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:29,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 02:17:29,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:29,855 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:29,855 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:30,051 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:30,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:30,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-09-10 02:17:30,056 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:30,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:17:30,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:17:30,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:17:30,058 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 11 states. [2019-09-10 02:17:30,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:30,137 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-09-10 02:17:30,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:17:30,139 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-09-10 02:17:30,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:30,140 INFO L225 Difference]: With dead ends: 30 [2019-09-10 02:17:30,140 INFO L226 Difference]: Without dead ends: 30 [2019-09-10 02:17:30,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:17:30,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-10 02:17:30,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-09-10 02:17:30,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-10 02:17:30,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-09-10 02:17:30,146 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 19 [2019-09-10 02:17:30,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:30,147 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-09-10 02:17:30,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:17:30,147 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-09-10 02:17:30,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-10 02:17:30,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:30,149 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:30,149 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:30,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:30,150 INFO L82 PathProgramCache]: Analyzing trace with hash -802169685, now seen corresponding path program 8 times [2019-09-10 02:17:30,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:30,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:30,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:30,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:30,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:30,293 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:30,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:30,293 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:30,293 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:30,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:30,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:30,294 INFO 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) [2019-09-10 02:17:30,308 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:17:30,308 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:31,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-10 02:17:31,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:17:31,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 02:17:31,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:31,140 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:31,141 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:31,391 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:31,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:31,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-09-10 02:17:31,409 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:31,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:17:31,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:17:31,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-09-10 02:17:31,410 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 12 states. [2019-09-10 02:17:31,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:31,526 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-09-10 02:17:31,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:17:31,526 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-09-10 02:17:31,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:31,527 INFO L225 Difference]: With dead ends: 31 [2019-09-10 02:17:31,527 INFO L226 Difference]: Without dead ends: 31 [2019-09-10 02:17:31,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-09-10 02:17:31,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-10 02:17:31,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-10 02:17:31,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-10 02:17:31,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-09-10 02:17:31,530 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2019-09-10 02:17:31,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:31,531 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-09-10 02:17:31,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:17:31,531 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-09-10 02:17:31,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-10 02:17:31,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:31,532 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:31,532 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:31,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:31,532 INFO L82 PathProgramCache]: Analyzing trace with hash 929769622, now seen corresponding path program 9 times [2019-09-10 02:17:31,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:31,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:31,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:17:31,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:31,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:31,665 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:31,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:31,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:31,665 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:31,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:31,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:31,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:17:31,679 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:17:31,680 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:31,693 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:17:31,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:17:31,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 02:17:31,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:31,722 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:31,722 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:32,017 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:32,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:32,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-09-10 02:17:32,021 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:32,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 02:17:32,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 02:17:32,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-09-10 02:17:32,022 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 13 states. [2019-09-10 02:17:32,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:32,138 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-09-10 02:17:32,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:17:32,139 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-09-10 02:17:32,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:32,140 INFO L225 Difference]: With dead ends: 32 [2019-09-10 02:17:32,140 INFO L226 Difference]: Without dead ends: 32 [2019-09-10 02:17:32,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-09-10 02:17:32,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-10 02:17:32,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-10 02:17:32,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-10 02:17:32,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-09-10 02:17:32,146 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 21 [2019-09-10 02:17:32,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:32,146 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-09-10 02:17:32,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 02:17:32,147 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-09-10 02:17:32,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 02:17:32,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:32,147 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:32,148 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:32,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:32,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1214686709, now seen corresponding path program 10 times [2019-09-10 02:17:32,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:32,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:32,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:17:32,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:32,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:32,306 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:32,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:32,307 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:32,307 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:32,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:32,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:32,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:17:32,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:32,326 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:32,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-10 02:17:32,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:32,368 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:32,368 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:32,713 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:32,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:32,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-09-10 02:17:32,717 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:32,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 02:17:32,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 02:17:32,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-10 02:17:32,718 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 14 states. [2019-09-10 02:17:32,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:32,869 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-09-10 02:17:32,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 02:17:32,870 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-09-10 02:17:32,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:32,870 INFO L225 Difference]: With dead ends: 33 [2019-09-10 02:17:32,870 INFO L226 Difference]: Without dead ends: 33 [2019-09-10 02:17:32,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-10 02:17:32,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-10 02:17:32,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-09-10 02:17:32,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-10 02:17:32,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-09-10 02:17:32,874 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 22 [2019-09-10 02:17:32,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:32,874 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-09-10 02:17:32,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 02:17:32,875 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-09-10 02:17:32,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-10 02:17:32,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:32,875 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:32,876 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:32,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:32,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1026643766, now seen corresponding path program 11 times [2019-09-10 02:17:32,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:32,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:32,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:32,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:32,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:33,045 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:33,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:33,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:33,046 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:33,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:33,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:33,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:33,064 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:17:33,064 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:17:49,297 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-10 02:17:49,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:17:49,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 02:17:49,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:49,357 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:49,357 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:49,705 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:49,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:49,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-09-10 02:17:49,711 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:49,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 02:17:49,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 02:17:49,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-10 02:17:49,712 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 15 states. [2019-09-10 02:17:49,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:49,905 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-09-10 02:17:49,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:17:49,906 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2019-09-10 02:17:49,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:49,906 INFO L225 Difference]: With dead ends: 34 [2019-09-10 02:17:49,906 INFO L226 Difference]: Without dead ends: 34 [2019-09-10 02:17:49,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-10 02:17:49,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-10 02:17:49,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-09-10 02:17:49,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-10 02:17:49,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-10 02:17:49,910 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 23 [2019-09-10 02:17:49,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:49,910 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-10 02:17:49,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 02:17:49,911 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-10 02:17:49,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-10 02:17:49,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:49,911 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:49,912 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:49,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:49,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1788411755, now seen corresponding path program 12 times [2019-09-10 02:17:49,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:49,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:49,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:17:49,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:49,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:50,088 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:50,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:50,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:50,088 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:50,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:50,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:50,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:50,100 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:17:50,100 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:17:50,113 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:17:50,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:17:50,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-10 02:17:50,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:50,149 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:50,149 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:50,541 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:50,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:50,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-09-10 02:17:50,544 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:50,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 02:17:50,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 02:17:50,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-10 02:17:50,546 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 16 states. [2019-09-10 02:17:50,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:50,734 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-09-10 02:17:50,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 02:17:50,734 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2019-09-10 02:17:50,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:50,735 INFO L225 Difference]: With dead ends: 35 [2019-09-10 02:17:50,735 INFO L226 Difference]: Without dead ends: 35 [2019-09-10 02:17:50,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-10 02:17:50,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-10 02:17:50,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-09-10 02:17:50,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-10 02:17:50,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-09-10 02:17:50,739 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 24 [2019-09-10 02:17:50,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:50,739 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-09-10 02:17:50,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 02:17:50,740 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-09-10 02:17:50,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-10 02:17:50,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:50,740 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:50,740 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:50,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:50,741 INFO L82 PathProgramCache]: Analyzing trace with hash -366584362, now seen corresponding path program 13 times [2019-09-10 02:17:50,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:50,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:50,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:17:50,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:50,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:50,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:50,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:50,951 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:50,951 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:50,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:50,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:50,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:50,961 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:17:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:50,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-10 02:17:50,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:51,006 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:51,006 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:51,464 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:51,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:51,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-09-10 02:17:51,471 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:51,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 02:17:51,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 02:17:51,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-10 02:17:51,472 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 17 states. [2019-09-10 02:17:51,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:51,656 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-09-10 02:17:51,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 02:17:51,659 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2019-09-10 02:17:51,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:51,660 INFO L225 Difference]: With dead ends: 36 [2019-09-10 02:17:51,660 INFO L226 Difference]: Without dead ends: 36 [2019-09-10 02:17:51,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-10 02:17:51,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-10 02:17:51,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-09-10 02:17:51,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-10 02:17:51,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-10 02:17:51,667 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 25 [2019-09-10 02:17:51,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:51,670 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-10 02:17:51,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 02:17:51,670 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-10 02:17:51,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-10 02:17:51,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:51,671 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:51,671 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:51,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:51,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1548012747, now seen corresponding path program 14 times [2019-09-10 02:17:51,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:51,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:51,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:51,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:51,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:51,931 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:51,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:51,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:51,931 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:51,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:51,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:51,932 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:51,951 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:17:51,951 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:18:36,068 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-10 02:18:36,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:18:36,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-10 02:18:36,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:18:36,305 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:36,305 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:18:36,825 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:36,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:18:36,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-09-10 02:18:36,832 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:18:36,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 02:18:36,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 02:18:36,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 02:18:36,833 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 18 states. [2019-09-10 02:18:37,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:18:37,046 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-09-10 02:18:37,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 02:18:37,047 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2019-09-10 02:18:37,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:18:37,048 INFO L225 Difference]: With dead ends: 37 [2019-09-10 02:18:37,048 INFO L226 Difference]: Without dead ends: 37 [2019-09-10 02:18:37,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 02:18:37,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-10 02:18:37,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-09-10 02:18:37,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-10 02:18:37,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-09-10 02:18:37,055 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 26 [2019-09-10 02:18:37,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:18:37,055 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-09-10 02:18:37,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 02:18:37,055 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-09-10 02:18:37,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-10 02:18:37,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:37,056 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:37,056 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:37,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:37,057 INFO L82 PathProgramCache]: Analyzing trace with hash 770980982, now seen corresponding path program 15 times [2019-09-10 02:18:37,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:37,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:37,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:18:37,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:37,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:37,271 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:37,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:37,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:18:37,272 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:18:37,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:18:37,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:37,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:18:37,283 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:18:37,283 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:18:37,296 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:18:37,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:18:37,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-10 02:18:37,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:18:37,329 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:37,330 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:18:37,877 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:37,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:18:37,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-09-10 02:18:37,881 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:18:37,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 02:18:37,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 02:18:37,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 02:18:37,882 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 19 states. [2019-09-10 02:18:38,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:18:38,128 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-09-10 02:18:38,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 02:18:38,128 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 27 [2019-09-10 02:18:38,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:18:38,129 INFO L225 Difference]: With dead ends: 38 [2019-09-10 02:18:38,129 INFO L226 Difference]: Without dead ends: 38 [2019-09-10 02:18:38,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 02:18:38,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-10 02:18:38,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-09-10 02:18:38,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-10 02:18:38,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-09-10 02:18:38,135 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 27 [2019-09-10 02:18:38,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:18:38,135 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-09-10 02:18:38,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 02:18:38,135 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-09-10 02:18:38,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-10 02:18:38,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:38,136 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:38,136 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:38,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:38,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1842167253, now seen corresponding path program 16 times [2019-09-10 02:18:38,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:38,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:38,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:18:38,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:38,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:38,424 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:38,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:38,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:18:38,425 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:18:38,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:18:38,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:38,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:18:38,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:38,435 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:18:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:38,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-10 02:18:38,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:18:38,487 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:38,488 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:18:39,133 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:39,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:18:39,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-09-10 02:18:39,138 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:18:39,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 02:18:39,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 02:18:39,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 02:18:39,139 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 20 states. [2019-09-10 02:18:39,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:18:39,451 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-09-10 02:18:39,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 02:18:39,451 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2019-09-10 02:18:39,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:18:39,452 INFO L225 Difference]: With dead ends: 39 [2019-09-10 02:18:39,452 INFO L226 Difference]: Without dead ends: 39 [2019-09-10 02:18:39,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 02:18:39,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-10 02:18:39,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-09-10 02:18:39,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-10 02:18:39,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-09-10 02:18:39,456 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 28 [2019-09-10 02:18:39,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:18:39,456 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-09-10 02:18:39,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 02:18:39,456 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-09-10 02:18:39,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-10 02:18:39,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:39,457 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:39,457 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:39,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:39,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1245383914, now seen corresponding path program 17 times [2019-09-10 02:18:39,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:39,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:39,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:39,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:39,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:39,757 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:39,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:39,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:18:39,758 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:18:39,758 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:18:39,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:39,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:18:39,776 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:18:39,776 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:18:40,308 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-10 02:18:40,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:18:40,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-10 02:18:40,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:18:40,348 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:40,348 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:18:41,319 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:41,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:18:41,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-09-10 02:18:41,325 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:18:41,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 02:18:41,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 02:18:41,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 02:18:41,327 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 21 states. [2019-09-10 02:18:41,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:18:41,628 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-09-10 02:18:41,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 02:18:41,628 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2019-09-10 02:18:41,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:18:41,628 INFO L225 Difference]: With dead ends: 40 [2019-09-10 02:18:41,629 INFO L226 Difference]: Without dead ends: 40 [2019-09-10 02:18:41,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 02:18:41,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-10 02:18:41,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-09-10 02:18:41,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-10 02:18:41,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-10 02:18:41,632 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 29 [2019-09-10 02:18:41,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:18:41,632 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-10 02:18:41,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 02:18:41,632 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-10 02:18:41,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-10 02:18:41,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:41,633 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:41,633 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:41,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:41,634 INFO L82 PathProgramCache]: Analyzing trace with hash 75030411, now seen corresponding path program 18 times [2019-09-10 02:18:41,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:41,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:41,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:18:41,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:41,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:41,930 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:41,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:41,930 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:18:41,931 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:18:41,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:18:41,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:41,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:18:41,941 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:18:41,942 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:18:41,964 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:18:41,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:18:41,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-10 02:18:41,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:18:42,007 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:42,008 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:18:42,936 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:42,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:18:42,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-09-10 02:18:42,939 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:18:42,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 02:18:42,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 02:18:42,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 02:18:42,940 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 22 states. [2019-09-10 02:18:43,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:18:43,304 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-09-10 02:18:43,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 02:18:43,306 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-09-10 02:18:43,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:18:43,307 INFO L225 Difference]: With dead ends: 41 [2019-09-10 02:18:43,307 INFO L226 Difference]: Without dead ends: 41 [2019-09-10 02:18:43,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 02:18:43,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-10 02:18:43,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-09-10 02:18:43,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-10 02:18:43,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-09-10 02:18:43,315 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 30 [2019-09-10 02:18:43,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:18:43,315 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-09-10 02:18:43,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 02:18:43,315 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-09-10 02:18:43,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-10 02:18:43,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:43,316 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:43,316 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:43,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:43,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1941798474, now seen corresponding path program 19 times [2019-09-10 02:18:43,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:43,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:43,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:18:43,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:43,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:43,659 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:43,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:43,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:18:43,660 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:18:43,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:18:43,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:43,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:18:43,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:43,670 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:18:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:43,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-10 02:18:43,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:18:43,719 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:43,719 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:18:44,772 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:44,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:18:44,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-09-10 02:18:44,775 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:18:44,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 02:18:44,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 02:18:44,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 02:18:44,777 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 23 states. [2019-09-10 02:18:45,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:18:45,161 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-09-10 02:18:45,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 02:18:45,162 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 31 [2019-09-10 02:18:45,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:18:45,163 INFO L225 Difference]: With dead ends: 42 [2019-09-10 02:18:45,163 INFO L226 Difference]: Without dead ends: 42 [2019-09-10 02:18:45,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 02:18:45,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-10 02:18:45,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-09-10 02:18:45,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-10 02:18:45,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-09-10 02:18:45,167 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 31 [2019-09-10 02:18:45,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:18:45,167 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-09-10 02:18:45,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 02:18:45,167 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-09-10 02:18:45,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-10 02:18:45,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:45,168 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:45,168 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:45,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:45,169 INFO L82 PathProgramCache]: Analyzing trace with hash -38984469, now seen corresponding path program 20 times [2019-09-10 02:18:45,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:45,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:45,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:45,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:45,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:45,565 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:45,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:45,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:18:45,566 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:18:45,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:18:45,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:45,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:18:45,604 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:18:45,604 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:19:51,564 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-10 02:19:51,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:19:51,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 02:19:51,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:19:51,781 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:19:51,782 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:20:13,293 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 12 [2019-09-10 02:21:25,464 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 204 refuted. 6 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:21:25,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:21:25,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-09-10 02:21:25,472 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:21:25,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 02:21:25,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 02:21:25,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=1379, Unknown=31, NotChecked=0, Total=1980 [2019-09-10 02:21:25,474 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 24 states. [2019-09-10 02:21:25,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:21:25,917 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-09-10 02:21:25,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 02:21:25,923 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2019-09-10 02:21:25,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:21:25,924 INFO L225 Difference]: With dead ends: 43 [2019-09-10 02:21:25,924 INFO L226 Difference]: Without dead ends: 43 [2019-09-10 02:21:25,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 94.0s TimeCoverageRelationStatistics Valid=570, Invalid=1379, Unknown=31, NotChecked=0, Total=1980 [2019-09-10 02:21:25,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-10 02:21:25,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-09-10 02:21:25,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-10 02:21:25,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-09-10 02:21:25,930 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 32 [2019-09-10 02:21:25,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:21:25,931 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-09-10 02:21:25,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 02:21:25,931 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-09-10 02:21:25,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-10 02:21:25,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:21:25,932 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:21:25,932 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:21:25,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:21:25,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1181292458, now seen corresponding path program 21 times [2019-09-10 02:21:25,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:21:25,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:21:25,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:21:25,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:21:25,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:21:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:21:26,373 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:21:26,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:21:26,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:21:26,374 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:21:26,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:21:26,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:21:26,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:21:26,390 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:21:26,391 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:21:26,411 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:21:26,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:21:26,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-10 02:21:26,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:21:26,454 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:21:26,454 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:21:27,502 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:21:27,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:21:27,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-09-10 02:21:27,505 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:21:27,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 02:21:27,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 02:21:27,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 02:21:27,506 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 25 states. [2019-09-10 02:21:27,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:21:27,968 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-09-10 02:21:27,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 02:21:27,969 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 33 [2019-09-10 02:21:27,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:21:27,970 INFO L225 Difference]: With dead ends: 44 [2019-09-10 02:21:27,970 INFO L226 Difference]: Without dead ends: 44 [2019-09-10 02:21:27,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 02:21:27,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-10 02:21:27,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-09-10 02:21:27,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-10 02:21:27,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-09-10 02:21:27,973 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 33 [2019-09-10 02:21:27,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:21:27,974 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-09-10 02:21:27,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 02:21:27,974 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-09-10 02:21:27,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-10 02:21:27,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:21:27,974 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:21:27,975 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:21:27,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:21:27,975 INFO L82 PathProgramCache]: Analyzing trace with hash 2061865547, now seen corresponding path program 22 times [2019-09-10 02:21:27,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:21:27,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:21:27,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:21:27,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:21:27,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:21:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:21:28,342 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:21:28,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:21:28,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:21:28,343 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:21:28,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:21:28,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:21:28,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:21:28,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:21:28,352 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:21:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:21:28,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-10 02:21:28,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:21:28,436 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:21:28,436 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:21:29,627 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:21:29,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:21:29,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-09-10 02:21:29,630 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:21:29,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 02:21:29,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 02:21:29,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 02:21:29,632 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 26 states. [2019-09-10 02:21:30,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:21:30,108 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-09-10 02:21:30,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 02:21:30,108 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 34 [2019-09-10 02:21:30,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:21:30,109 INFO L225 Difference]: With dead ends: 45 [2019-09-10 02:21:30,109 INFO L226 Difference]: Without dead ends: 45 [2019-09-10 02:21:30,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 02:21:30,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-10 02:21:30,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-09-10 02:21:30,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-10 02:21:30,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-09-10 02:21:30,113 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 34 [2019-09-10 02:21:30,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:21:30,113 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-09-10 02:21:30,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 02:21:30,113 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-09-10 02:21:30,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-10 02:21:30,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:21:30,114 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:21:30,114 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:21:30,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:21:30,115 INFO L82 PathProgramCache]: Analyzing trace with hash -479451402, now seen corresponding path program 23 times [2019-09-10 02:21:30,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:21:30,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:21:30,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:21:30,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:21:30,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:21:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:21:30,504 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:21:30,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:21:30,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:21:30,504 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:21:30,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:21:30,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:21:30,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:21:30,515 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:21:30,515 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:23:25,802 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-10 02:23:25,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:23:25,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-10 02:23:25,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:23:25,891 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:23:25,891 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:23:27,449 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:23:27,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:23:27,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-09-10 02:23:27,456 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:23:27,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 02:23:27,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 02:23:27,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 02:23:27,457 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 27 states. [2019-09-10 02:23:27,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:23:27,981 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2019-09-10 02:23:27,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 02:23:27,981 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 35 [2019-09-10 02:23:27,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:23:27,982 INFO L225 Difference]: With dead ends: 46 [2019-09-10 02:23:27,982 INFO L226 Difference]: Without dead ends: 46 [2019-09-10 02:23:27,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 02:23:27,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-10 02:23:27,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-09-10 02:23:27,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-10 02:23:27,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-09-10 02:23:27,986 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 35 [2019-09-10 02:23:27,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:23:27,986 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-09-10 02:23:27,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 02:23:27,986 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-09-10 02:23:27,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-10 02:23:27,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:23:27,987 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:23:27,987 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:23:27,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:23:27,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1950865493, now seen corresponding path program 24 times [2019-09-10 02:23:27,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:23:27,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:23:27,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:23:27,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:23:27,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:23:27,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:23:28,510 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:23:28,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:23:28,510 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:23:28,511 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:23:28,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:23:28,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:23:28,511 INFO 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) [2019-09-10 02:23:28,524 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:23:28,524 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:23:28,545 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:23:28,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:23:28,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-10 02:23:28,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:23:28,589 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:23:28,589 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:23:29,894 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:23:29,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:23:29,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-09-10 02:23:29,898 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:23:29,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 02:23:29,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 02:23:29,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 02:23:29,899 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 28 states. [2019-09-10 02:23:30,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:23:30,460 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-09-10 02:23:30,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 02:23:30,460 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 36 [2019-09-10 02:23:30,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:23:30,461 INFO L225 Difference]: With dead ends: 47 [2019-09-10 02:23:30,461 INFO L226 Difference]: Without dead ends: 47 [2019-09-10 02:23:30,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 02:23:30,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-10 02:23:30,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-09-10 02:23:30,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-10 02:23:30,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-09-10 02:23:30,464 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 36 [2019-09-10 02:23:30,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:23:30,464 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-09-10 02:23:30,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 02:23:30,464 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-09-10 02:23:30,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-10 02:23:30,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:23:30,465 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:23:30,465 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:23:30,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:23:30,466 INFO L82 PathProgramCache]: Analyzing trace with hash -320062058, now seen corresponding path program 25 times [2019-09-10 02:23:30,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:23:30,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:23:30,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:23:30,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:23:30,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:23:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:23:30,921 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:23:30,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:23:30,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:23:30,921 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:23:30,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:23:30,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:23:30,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:23:30,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:23:30,931 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:23:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:23:30,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-10 02:23:30,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:23:30,990 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:23:30,990 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:23:32,554 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:23:32,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:23:32,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-09-10 02:23:32,558 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:23:32,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-10 02:23:32,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-10 02:23:32,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 02:23:32,560 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 29 states. [2019-09-10 02:23:33,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:23:33,157 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-09-10 02:23:33,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 02:23:33,158 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 37 [2019-09-10 02:23:33,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:23:33,158 INFO L225 Difference]: With dead ends: 48 [2019-09-10 02:23:33,158 INFO L226 Difference]: Without dead ends: 48 [2019-09-10 02:23:33,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 02:23:33,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-10 02:23:33,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-09-10 02:23:33,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-10 02:23:33,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-09-10 02:23:33,162 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 37 [2019-09-10 02:23:33,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:23:33,162 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-09-10 02:23:33,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-10 02:23:33,162 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-09-10 02:23:33,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-10 02:23:33,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:23:33,162 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:23:33,163 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:23:33,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:23:33,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1304763125, now seen corresponding path program 26 times [2019-09-10 02:23:33,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:23:33,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:23:33,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:23:33,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:23:33,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:23:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:23:33,669 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:23:33,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:23:33,669 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:23:33,669 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:23:33,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:23:33,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:23:33,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:23:33,681 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:23:33,682 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:24:11,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-10 02:24:11,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:24:12,543 WARN L254 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-10 02:24:12,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:24:12,596 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:24:12,596 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:27:10,276 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 342 refuted. 9 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:27:10,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:27:10,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-09-10 02:27:10,284 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:27:10,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 02:27:10,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 02:27:10,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=894, Invalid=2234, Unknown=64, NotChecked=0, Total=3192 [2019-09-10 02:27:10,285 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 30 states. [2019-09-10 02:27:10,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:27:10,884 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-09-10 02:27:10,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 02:27:10,884 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 38 [2019-09-10 02:27:10,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:27:10,885 INFO L225 Difference]: With dead ends: 49 [2019-09-10 02:27:10,885 INFO L226 Difference]: Without dead ends: 49 [2019-09-10 02:27:10,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 178.1s TimeCoverageRelationStatistics Valid=894, Invalid=2234, Unknown=64, NotChecked=0, Total=3192 [2019-09-10 02:27:10,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-10 02:27:10,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-09-10 02:27:10,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-10 02:27:10,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-09-10 02:27:10,889 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 38 [2019-09-10 02:27:10,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:27:10,890 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-09-10 02:27:10,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 02:27:10,890 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-09-10 02:27:10,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-10 02:27:10,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:27:10,890 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:27:10,891 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:27:10,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:27:10,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1765725130, now seen corresponding path program 27 times [2019-09-10 02:27:10,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:27:10,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:27:10,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:27:10,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:27:10,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:27:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:27:11,389 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:27:11,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:27:11,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:27:11,389 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:27:11,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:27:11,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:27:11,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:27:11,412 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:27:11,412 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:27:11,434 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:27:11,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:27:11,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-10 02:27:11,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:27:11,479 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:27:11,479 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:27:13,221 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:27:13,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:27:13,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-09-10 02:27:13,225 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:27:13,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 02:27:13,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 02:27:13,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 02:27:13,226 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 31 states. [2019-09-10 02:27:13,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:27:13,881 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-09-10 02:27:13,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 02:27:13,882 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 39 [2019-09-10 02:27:13,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:27:13,883 INFO L225 Difference]: With dead ends: 50 [2019-09-10 02:27:13,883 INFO L226 Difference]: Without dead ends: 50 [2019-09-10 02:27:13,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 02:27:13,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-10 02:27:13,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-09-10 02:27:13,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-10 02:27:13,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-09-10 02:27:13,886 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 39 [2019-09-10 02:27:13,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:27:13,886 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-09-10 02:27:13,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 02:27:13,887 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-09-10 02:27:13,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-10 02:27:13,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:27:13,887 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:27:13,887 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:27:13,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:27:13,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1124321899, now seen corresponding path program 28 times [2019-09-10 02:27:13,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:27:13,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:27:13,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:27:13,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:27:13,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:27:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:27:14,432 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:27:14,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:27:14,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:27:14,433 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:27:14,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:27:14,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:27:14,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10 02:27:14,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:27:14,445 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:27:14,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:27:14,468 WARN L254 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-10 02:27:14,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:27:14,505 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:27:14,506 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:27:16,565 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:27:16,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:27:16,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-09-10 02:27:16,568 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:27:16,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 02:27:16,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 02:27:16,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 02:27:16,569 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 32 states. [2019-09-10 02:27:17,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:27:17,280 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-09-10 02:27:17,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 02:27:17,281 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2019-09-10 02:27:17,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:27:17,282 INFO L225 Difference]: With dead ends: 51 [2019-09-10 02:27:17,282 INFO L226 Difference]: Without dead ends: 51 [2019-09-10 02:27:17,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 02:27:17,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-10 02:27:17,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-09-10 02:27:17,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-10 02:27:17,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-09-10 02:27:17,285 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 40 [2019-09-10 02:27:17,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:27:17,285 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-09-10 02:27:17,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 02:27:17,285 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-09-10 02:27:17,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-10 02:27:17,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:27:17,286 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:27:17,286 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:27:17,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:27:17,287 INFO L82 PathProgramCache]: Analyzing trace with hash 521466582, now seen corresponding path program 29 times [2019-09-10 02:27:17,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:27:17,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:27:17,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:27:17,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:27:17,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:27:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:27:17,968 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:27:17,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:27:17,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:27:17,968 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:27:17,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:27:17,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:27:17,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:27:17,981 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:27:17,981 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:29:42,341 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-10 02:29:42,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:29:42,450 WARN L254 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-10 02:29:42,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:29:42,488 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:29:42,488 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:29:44,358 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:29:44,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:29:44,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-09-10 02:29:44,365 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:29:44,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-10 02:29:44,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-10 02:29:44,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=2823, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 02:29:44,366 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 33 states. [2019-09-10 02:29:45,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:29:45,154 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2019-09-10 02:29:45,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 02:29:45,155 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 41 [2019-09-10 02:29:45,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:29:45,155 INFO L225 Difference]: With dead ends: 52 [2019-09-10 02:29:45,155 INFO L226 Difference]: Without dead ends: 52 [2019-09-10 02:29:45,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1083, Invalid=2823, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 02:29:45,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-10 02:29:45,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-09-10 02:29:45,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-10 02:29:45,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-09-10 02:29:45,158 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 41 [2019-09-10 02:29:45,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:29:45,158 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-09-10 02:29:45,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-10 02:29:45,159 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-09-10 02:29:45,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-10 02:29:45,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:29:45,159 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:29:45,159 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:29:45,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:29:45,160 INFO L82 PathProgramCache]: Analyzing trace with hash -987179061, now seen corresponding path program 30 times [2019-09-10 02:29:45,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:29:45,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:29:45,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:29:45,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:29:45,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:29:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:29:45,799 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:29:45,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:29:45,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:29:45,800 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:29:45,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:29:45,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:29:45,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:29:45,811 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:29:45,811 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:29:45,834 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:29:45,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:29:45,836 WARN L254 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-10 02:29:45,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:29:45,887 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:29:45,887 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:29:47,935 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:29:47,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:29:47,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-09-10 02:29:47,942 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:29:47,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-10 02:29:47,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-10 02:29:47,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1150, Invalid=3010, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 02:29:47,943 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 34 states. [2019-09-10 02:29:48,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:29:48,809 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2019-09-10 02:29:48,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 02:29:48,810 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 42 [2019-09-10 02:29:48,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:29:48,811 INFO L225 Difference]: With dead ends: 53 [2019-09-10 02:29:48,811 INFO L226 Difference]: Without dead ends: 53 [2019-09-10 02:29:48,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1150, Invalid=3010, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 02:29:48,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-10 02:29:48,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-09-10 02:29:48,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-10 02:29:48,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-09-10 02:29:48,815 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 42 [2019-09-10 02:29:48,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:29:48,815 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-09-10 02:29:48,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-10 02:29:48,815 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-09-10 02:29:48,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-10 02:29:48,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:29:48,816 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:29:48,816 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:29:48,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:29:48,816 INFO L82 PathProgramCache]: Analyzing trace with hash -510553738, now seen corresponding path program 31 times [2019-09-10 02:29:48,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:29:48,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:29:48,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:29:48,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:29:48,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:29:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:29:49,682 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:29:49,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:29:49,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:29:49,683 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:29:49,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:29:49,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:29:49,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:29:49,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:29:49,705 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:29:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:29:49,729 WARN L254 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-10 02:29:49,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:29:49,779 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:29:49,779 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:29:52,370 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:29:52,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:29:52,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-09-10 02:29:52,373 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:29:52,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-10 02:29:52,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-10 02:29:52,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1219, Invalid=3203, Unknown=0, NotChecked=0, Total=4422 [2019-09-10 02:29:52,374 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 35 states. [2019-09-10 02:29:53,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:29:53,253 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2019-09-10 02:29:53,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 02:29:53,254 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 43 [2019-09-10 02:29:53,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:29:53,255 INFO L225 Difference]: With dead ends: 54 [2019-09-10 02:29:53,255 INFO L226 Difference]: Without dead ends: 54 [2019-09-10 02:29:53,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1219, Invalid=3203, Unknown=0, NotChecked=0, Total=4422 [2019-09-10 02:29:53,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-10 02:29:53,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-09-10 02:29:53,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-10 02:29:53,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-09-10 02:29:53,259 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 43 [2019-09-10 02:29:53,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:29:53,259 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-09-10 02:29:53,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-10 02:29:53,259 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-09-10 02:29:53,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-10 02:29:53,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:29:53,260 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:29:53,260 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:29:53,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:29:53,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1379929387, now seen corresponding path program 32 times [2019-09-10 02:29:53,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:29:53,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:29:53,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:29:53,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:29:53,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:29:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:29:53,961 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:29:53,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:29:53,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:29:53,962 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:29:53,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:29:53,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:29:53,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:29:53,972 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:29:53,972 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)