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/locks/test_locks_14-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:49:36,501 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:49:36,503 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:49:36,515 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:49:36,516 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:49:36,517 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:49:36,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:49:36,520 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:49:36,522 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:49:36,523 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:49:36,524 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:49:36,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:49:36,526 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:49:36,527 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:49:36,528 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:49:36,529 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:49:36,530 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:49:36,531 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:49:36,533 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:49:36,535 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:49:36,537 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:49:36,538 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:49:36,539 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:49:36,540 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:49:36,543 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:49:36,543 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:49:36,544 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:49:36,545 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:49:36,545 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:49:36,546 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:49:36,546 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:49:36,547 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:49:36,548 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:49:36,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:49:36,550 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:49:36,551 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:49:36,551 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:49:36,552 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:49:36,552 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:49:36,553 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:49:36,554 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:49:36,555 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-09 05:49:36,569 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:49:36,571 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:49:36,572 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:49:36,572 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:49:36,573 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:49:36,573 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:49:36,573 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:49:36,573 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:49:36,573 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:49:36,574 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:49:36,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:49:36,575 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:49:36,575 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:49:36,575 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:49:36,576 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:49:36,576 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:49:36,576 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:49:36,576 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:49:36,577 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:49:36,577 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:49:36,577 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:49:36,577 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:49:36,577 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:49:36,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:49:36,578 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:49:36,579 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:49:36,579 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:49:36,579 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:49:36,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:49:36,580 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:49:36,630 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:49:36,646 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:49:36,649 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:49:36,651 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:49:36,652 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:49:36,653 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_14-1.c [2019-09-09 05:49:36,724 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c2072f6f/f4d1100827364a289b47afc0b3dc8b7d/FLAGfe3675cab [2019-09-09 05:49:37,148 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:49:37,149 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14-1.c [2019-09-09 05:49:37,157 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c2072f6f/f4d1100827364a289b47afc0b3dc8b7d/FLAGfe3675cab [2019-09-09 05:49:37,529 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c2072f6f/f4d1100827364a289b47afc0b3dc8b7d [2019-09-09 05:49:37,541 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:49:37,543 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:49:37,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:49:37,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:49:37,549 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:49:37,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:49:37" (1/1) ... [2019-09-09 05:49:37,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20b00aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:37, skipping insertion in model container [2019-09-09 05:49:37,553 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:49:37" (1/1) ... [2019-09-09 05:49:37,560 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:49:37,588 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:49:37,773 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:49:37,777 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:49:37,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:49:37,936 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:49:37,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:37 WrapperNode [2019-09-09 05:49:37,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:49:37,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:49:37,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:49:37,937 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:49:37,947 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:37" (1/1) ... [2019-09-09 05:49:37,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:37" (1/1) ... [2019-09-09 05:49:37,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:37" (1/1) ... [2019-09-09 05:49:37,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:37" (1/1) ... [2019-09-09 05:49:37,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:37" (1/1) ... [2019-09-09 05:49:37,968 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:37" (1/1) ... [2019-09-09 05:49:37,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:37" (1/1) ... [2019-09-09 05:49:37,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:49:37,973 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:49:37,973 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:49:37,973 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:49:37,974 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:37" (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-09 05:49:38,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:49:38,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:49:38,022 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:49:38,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:49:38,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:49:38,022 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:49:38,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:49:38,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:49:38,381 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:49:38,381 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:49:38,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:49:38 BoogieIcfgContainer [2019-09-09 05:49:38,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:49:38,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:49:38,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:49:38,386 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:49:38,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:49:37" (1/3) ... [2019-09-09 05:49:38,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58870f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:49:38, skipping insertion in model container [2019-09-09 05:49:38,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:37" (2/3) ... [2019-09-09 05:49:38,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58870f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:49:38, skipping insertion in model container [2019-09-09 05:49:38,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:49:38" (3/3) ... [2019-09-09 05:49:38,392 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2019-09-09 05:49:38,402 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:49:38,408 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:49:38,422 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:49:38,447 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:49:38,448 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:49:38,448 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:49:38,448 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:49:38,448 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:49:38,448 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:49:38,448 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:49:38,449 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:49:38,464 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2019-09-09 05:49:38,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-09 05:49:38,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:38,473 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:38,475 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:38,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:38,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1694520263, now seen corresponding path program 1 times [2019-09-09 05:49:38,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:38,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:38,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:38,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:38,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:38,666 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-09 05:49:38,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:38,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:38,668 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:38,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:38,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:38,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:38,691 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 3 states. [2019-09-09 05:49:38,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:38,774 INFO L93 Difference]: Finished difference Result 104 states and 185 transitions. [2019-09-09 05:49:38,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:38,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-09 05:49:38,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:38,789 INFO L225 Difference]: With dead ends: 104 [2019-09-09 05:49:38,790 INFO L226 Difference]: Without dead ends: 96 [2019-09-09 05:49:38,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:38,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-09 05:49:38,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2019-09-09 05:49:38,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-09 05:49:38,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 121 transitions. [2019-09-09 05:49:38,859 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 121 transitions. Word has length 24 [2019-09-09 05:49:38,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:38,860 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 121 transitions. [2019-09-09 05:49:38,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:38,860 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 121 transitions. [2019-09-09 05:49:38,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-09 05:49:38,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:38,863 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:38,864 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:38,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:38,865 INFO L82 PathProgramCache]: Analyzing trace with hash 106172361, now seen corresponding path program 1 times [2019-09-09 05:49:38,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:38,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:38,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:38,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:38,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:38,952 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-09 05:49:38,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:38,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:38,953 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:38,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:38,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:38,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:38,955 INFO L87 Difference]: Start difference. First operand 66 states and 121 transitions. Second operand 3 states. [2019-09-09 05:49:39,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:39,010 INFO L93 Difference]: Finished difference Result 96 states and 174 transitions. [2019-09-09 05:49:39,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:39,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-09 05:49:39,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:39,013 INFO L225 Difference]: With dead ends: 96 [2019-09-09 05:49:39,013 INFO L226 Difference]: Without dead ends: 96 [2019-09-09 05:49:39,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:39,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-09 05:49:39,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-09-09 05:49:39,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-09-09 05:49:39,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 173 transitions. [2019-09-09 05:49:39,033 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 173 transitions. Word has length 24 [2019-09-09 05:49:39,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:39,033 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 173 transitions. [2019-09-09 05:49:39,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:39,034 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 173 transitions. [2019-09-09 05:49:39,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-09 05:49:39,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:39,035 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:39,037 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:39,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:39,037 INFO L82 PathProgramCache]: Analyzing trace with hash 990732685, now seen corresponding path program 1 times [2019-09-09 05:49:39,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:39,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:39,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:39,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:39,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:39,092 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-09 05:49:39,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:39,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:39,093 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:39,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:39,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:39,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:39,094 INFO L87 Difference]: Start difference. First operand 94 states and 173 transitions. Second operand 3 states. [2019-09-09 05:49:39,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:39,112 INFO L93 Difference]: Finished difference Result 99 states and 176 transitions. [2019-09-09 05:49:39,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:39,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-09 05:49:39,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:39,114 INFO L225 Difference]: With dead ends: 99 [2019-09-09 05:49:39,114 INFO L226 Difference]: Without dead ends: 99 [2019-09-09 05:49:39,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:39,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-09 05:49:39,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-09-09 05:49:39,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-09 05:49:39,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 175 transitions. [2019-09-09 05:49:39,125 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 175 transitions. Word has length 25 [2019-09-09 05:49:39,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:39,125 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 175 transitions. [2019-09-09 05:49:39,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:39,125 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 175 transitions. [2019-09-09 05:49:39,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-09 05:49:39,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:39,127 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:39,127 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:39,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:39,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1003412021, now seen corresponding path program 1 times [2019-09-09 05:49:39,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:39,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:39,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:39,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:39,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:39,191 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-09 05:49:39,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:39,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:39,192 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:39,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:39,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:39,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:39,193 INFO L87 Difference]: Start difference. First operand 97 states and 175 transitions. Second operand 3 states. [2019-09-09 05:49:39,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:39,227 INFO L93 Difference]: Finished difference Result 182 states and 333 transitions. [2019-09-09 05:49:39,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:39,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-09 05:49:39,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:39,229 INFO L225 Difference]: With dead ends: 182 [2019-09-09 05:49:39,230 INFO L226 Difference]: Without dead ends: 182 [2019-09-09 05:49:39,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:39,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-09 05:49:39,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 128. [2019-09-09 05:49:39,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-09 05:49:39,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 232 transitions. [2019-09-09 05:49:39,242 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 232 transitions. Word has length 25 [2019-09-09 05:49:39,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:39,243 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 232 transitions. [2019-09-09 05:49:39,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:39,243 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 232 transitions. [2019-09-09 05:49:39,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-09 05:49:39,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:39,244 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:39,245 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:39,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:39,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1703207373, now seen corresponding path program 1 times [2019-09-09 05:49:39,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:39,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:39,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:39,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:39,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:39,286 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-09 05:49:39,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:39,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:39,287 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:39,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:39,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:39,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:39,289 INFO L87 Difference]: Start difference. First operand 128 states and 232 transitions. Second operand 3 states. [2019-09-09 05:49:39,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:39,316 INFO L93 Difference]: Finished difference Result 184 states and 331 transitions. [2019-09-09 05:49:39,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:39,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-09 05:49:39,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:39,318 INFO L225 Difference]: With dead ends: 184 [2019-09-09 05:49:39,318 INFO L226 Difference]: Without dead ends: 184 [2019-09-09 05:49:39,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:39,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-09 05:49:39,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2019-09-09 05:49:39,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-09 05:49:39,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 330 transitions. [2019-09-09 05:49:39,331 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 330 transitions. Word has length 25 [2019-09-09 05:49:39,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:39,332 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 330 transitions. [2019-09-09 05:49:39,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:39,332 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 330 transitions. [2019-09-09 05:49:39,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-09 05:49:39,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:39,334 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:39,334 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:39,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:39,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1040789154, now seen corresponding path program 1 times [2019-09-09 05:49:39,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:39,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:39,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:39,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:39,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:39,383 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-09 05:49:39,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:39,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:39,383 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:39,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:39,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:39,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:39,385 INFO L87 Difference]: Start difference. First operand 182 states and 330 transitions. Second operand 3 states. [2019-09-09 05:49:39,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:39,405 INFO L93 Difference]: Finished difference Result 186 states and 331 transitions. [2019-09-09 05:49:39,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:39,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-09 05:49:39,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:39,407 INFO L225 Difference]: With dead ends: 186 [2019-09-09 05:49:39,407 INFO L226 Difference]: Without dead ends: 186 [2019-09-09 05:49:39,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:39,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-09 05:49:39,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2019-09-09 05:49:39,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-09 05:49:39,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 330 transitions. [2019-09-09 05:49:39,418 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 330 transitions. Word has length 26 [2019-09-09 05:49:39,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:39,418 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 330 transitions. [2019-09-09 05:49:39,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:39,418 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 330 transitions. [2019-09-09 05:49:39,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-09 05:49:39,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:39,420 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:39,420 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:39,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:39,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1260033436, now seen corresponding path program 1 times [2019-09-09 05:49:39,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:39,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:39,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:39,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:39,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:39,463 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-09 05:49:39,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:39,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:39,464 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:39,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:39,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:39,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:39,465 INFO L87 Difference]: Start difference. First operand 184 states and 330 transitions. Second operand 3 states. [2019-09-09 05:49:39,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:39,490 INFO L93 Difference]: Finished difference Result 346 states and 627 transitions. [2019-09-09 05:49:39,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:39,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-09 05:49:39,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:39,494 INFO L225 Difference]: With dead ends: 346 [2019-09-09 05:49:39,494 INFO L226 Difference]: Without dead ends: 346 [2019-09-09 05:49:39,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:39,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-09-09 05:49:39,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 248. [2019-09-09 05:49:39,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-09 05:49:39,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 442 transitions. [2019-09-09 05:49:39,508 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 442 transitions. Word has length 26 [2019-09-09 05:49:39,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:39,508 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 442 transitions. [2019-09-09 05:49:39,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:39,508 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 442 transitions. [2019-09-09 05:49:39,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-09 05:49:39,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:39,511 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:39,511 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:39,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:39,512 INFO L82 PathProgramCache]: Analyzing trace with hash -328314466, now seen corresponding path program 1 times [2019-09-09 05:49:39,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:39,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:39,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:39,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:39,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:39,575 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-09 05:49:39,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:39,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:39,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:39,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:39,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:39,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:39,578 INFO L87 Difference]: Start difference. First operand 248 states and 442 transitions. Second operand 3 states. [2019-09-09 05:49:39,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:39,605 INFO L93 Difference]: Finished difference Result 354 states and 627 transitions. [2019-09-09 05:49:39,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:39,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-09 05:49:39,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:39,608 INFO L225 Difference]: With dead ends: 354 [2019-09-09 05:49:39,608 INFO L226 Difference]: Without dead ends: 354 [2019-09-09 05:49:39,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:39,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-09-09 05:49:39,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2019-09-09 05:49:39,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-09 05:49:39,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 626 transitions. [2019-09-09 05:49:39,620 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 626 transitions. Word has length 26 [2019-09-09 05:49:39,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:39,620 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 626 transitions. [2019-09-09 05:49:39,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:39,620 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 626 transitions. [2019-09-09 05:49:39,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-09 05:49:39,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:39,630 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:39,631 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:39,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:39,631 INFO L82 PathProgramCache]: Analyzing trace with hash 406543618, now seen corresponding path program 1 times [2019-09-09 05:49:39,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:39,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:39,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:39,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:39,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:39,681 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-09 05:49:39,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:39,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:39,682 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:39,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:39,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:39,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:39,683 INFO L87 Difference]: Start difference. First operand 352 states and 626 transitions. Second operand 3 states. [2019-09-09 05:49:39,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:39,696 INFO L93 Difference]: Finished difference Result 358 states and 627 transitions. [2019-09-09 05:49:39,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:39,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-09 05:49:39,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:39,699 INFO L225 Difference]: With dead ends: 358 [2019-09-09 05:49:39,699 INFO L226 Difference]: Without dead ends: 358 [2019-09-09 05:49:39,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:39,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-09-09 05:49:39,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-09-09 05:49:39,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-09-09 05:49:39,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 626 transitions. [2019-09-09 05:49:39,710 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 626 transitions. Word has length 27 [2019-09-09 05:49:39,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:39,710 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 626 transitions. [2019-09-09 05:49:39,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:39,711 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 626 transitions. [2019-09-09 05:49:39,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-09 05:49:39,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:39,712 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:39,712 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:39,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:39,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1587601088, now seen corresponding path program 1 times [2019-09-09 05:49:39,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:39,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:39,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:39,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:39,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:39,743 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-09 05:49:39,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:39,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:39,744 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:39,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:39,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:39,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:39,745 INFO L87 Difference]: Start difference. First operand 356 states and 626 transitions. Second operand 3 states. [2019-09-09 05:49:39,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:39,761 INFO L93 Difference]: Finished difference Result 666 states and 1183 transitions. [2019-09-09 05:49:39,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:39,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-09 05:49:39,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:39,765 INFO L225 Difference]: With dead ends: 666 [2019-09-09 05:49:39,766 INFO L226 Difference]: Without dead ends: 666 [2019-09-09 05:49:39,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:39,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-09-09 05:49:39,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 488. [2019-09-09 05:49:39,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-09 05:49:39,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 846 transitions. [2019-09-09 05:49:39,784 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 846 transitions. Word has length 27 [2019-09-09 05:49:39,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:39,786 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 846 transitions. [2019-09-09 05:49:39,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:39,786 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 846 transitions. [2019-09-09 05:49:39,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-09 05:49:39,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:39,789 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:39,790 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:39,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:39,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1119018306, now seen corresponding path program 1 times [2019-09-09 05:49:39,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:39,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:39,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:39,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:39,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:39,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:39,831 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-09 05:49:39,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:39,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:39,832 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:39,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:39,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:39,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:39,833 INFO L87 Difference]: Start difference. First operand 488 states and 846 transitions. Second operand 3 states. [2019-09-09 05:49:39,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:39,854 INFO L93 Difference]: Finished difference Result 690 states and 1191 transitions. [2019-09-09 05:49:39,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:39,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-09 05:49:39,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:39,859 INFO L225 Difference]: With dead ends: 690 [2019-09-09 05:49:39,859 INFO L226 Difference]: Without dead ends: 690 [2019-09-09 05:49:39,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:39,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-09-09 05:49:39,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 688. [2019-09-09 05:49:39,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2019-09-09 05:49:39,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1190 transitions. [2019-09-09 05:49:39,876 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1190 transitions. Word has length 27 [2019-09-09 05:49:39,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:39,876 INFO L475 AbstractCegarLoop]: Abstraction has 688 states and 1190 transitions. [2019-09-09 05:49:39,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:39,876 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1190 transitions. [2019-09-09 05:49:39,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-09 05:49:39,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:39,878 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:39,878 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:39,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:39,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1970780365, now seen corresponding path program 1 times [2019-09-09 05:49:39,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:39,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:39,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:39,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:39,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:39,909 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-09 05:49:39,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:39,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:39,910 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:39,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:39,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:39,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:39,911 INFO L87 Difference]: Start difference. First operand 688 states and 1190 transitions. Second operand 3 states. [2019-09-09 05:49:39,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:39,930 INFO L93 Difference]: Finished difference Result 698 states and 1191 transitions. [2019-09-09 05:49:39,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:39,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-09 05:49:39,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:39,935 INFO L225 Difference]: With dead ends: 698 [2019-09-09 05:49:39,935 INFO L226 Difference]: Without dead ends: 698 [2019-09-09 05:49:39,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:39,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-09-09 05:49:39,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2019-09-09 05:49:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-09-09 05:49:39,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1190 transitions. [2019-09-09 05:49:39,952 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1190 transitions. Word has length 28 [2019-09-09 05:49:39,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:39,953 INFO L475 AbstractCegarLoop]: Abstraction has 696 states and 1190 transitions. [2019-09-09 05:49:39,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:39,953 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1190 transitions. [2019-09-09 05:49:39,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-09 05:49:39,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:39,954 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:39,955 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:39,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:39,956 INFO L82 PathProgramCache]: Analyzing trace with hash 330042225, now seen corresponding path program 1 times [2019-09-09 05:49:39,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:39,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:39,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:39,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:39,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:39,989 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-09 05:49:39,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:39,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:39,989 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:39,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:39,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:39,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:39,990 INFO L87 Difference]: Start difference. First operand 696 states and 1190 transitions. Second operand 3 states. [2019-09-09 05:49:40,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:40,011 INFO L93 Difference]: Finished difference Result 1290 states and 2231 transitions. [2019-09-09 05:49:40,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:40,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-09 05:49:40,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:40,018 INFO L225 Difference]: With dead ends: 1290 [2019-09-09 05:49:40,018 INFO L226 Difference]: Without dead ends: 1290 [2019-09-09 05:49:40,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:40,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2019-09-09 05:49:40,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 968. [2019-09-09 05:49:40,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-09-09 05:49:40,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1622 transitions. [2019-09-09 05:49:40,048 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1622 transitions. Word has length 28 [2019-09-09 05:49:40,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:40,049 INFO L475 AbstractCegarLoop]: Abstraction has 968 states and 1622 transitions. [2019-09-09 05:49:40,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:40,049 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1622 transitions. [2019-09-09 05:49:40,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-09 05:49:40,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:40,051 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:40,051 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:40,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:40,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1258305677, now seen corresponding path program 1 times [2019-09-09 05:49:40,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:40,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:40,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:40,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:40,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:40,080 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-09 05:49:40,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:40,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:40,081 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:40,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:40,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:40,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:40,082 INFO L87 Difference]: Start difference. First operand 968 states and 1622 transitions. Second operand 3 states. [2019-09-09 05:49:40,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:40,104 INFO L93 Difference]: Finished difference Result 1354 states and 2263 transitions. [2019-09-09 05:49:40,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:40,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-09 05:49:40,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:40,112 INFO L225 Difference]: With dead ends: 1354 [2019-09-09 05:49:40,112 INFO L226 Difference]: Without dead ends: 1354 [2019-09-09 05:49:40,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:40,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-09-09 05:49:40,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2019-09-09 05:49:40,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-09-09 05:49:40,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2262 transitions. [2019-09-09 05:49:40,143 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2262 transitions. Word has length 28 [2019-09-09 05:49:40,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:40,143 INFO L475 AbstractCegarLoop]: Abstraction has 1352 states and 2262 transitions. [2019-09-09 05:49:40,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:40,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2262 transitions. [2019-09-09 05:49:40,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-09 05:49:40,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:40,146 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:40,146 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:40,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:40,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1641587831, now seen corresponding path program 1 times [2019-09-09 05:49:40,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:40,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:40,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:40,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:40,148 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:40,177 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-09 05:49:40,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:40,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:40,178 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:40,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:40,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:40,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:40,179 INFO L87 Difference]: Start difference. First operand 1352 states and 2262 transitions. Second operand 3 states. [2019-09-09 05:49:40,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:40,210 INFO L93 Difference]: Finished difference Result 1370 states and 2263 transitions. [2019-09-09 05:49:40,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:40,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-09 05:49:40,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:40,221 INFO L225 Difference]: With dead ends: 1370 [2019-09-09 05:49:40,222 INFO L226 Difference]: Without dead ends: 1370 [2019-09-09 05:49:40,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:40,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2019-09-09 05:49:40,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1368. [2019-09-09 05:49:40,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2019-09-09 05:49:40,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2262 transitions. [2019-09-09 05:49:40,278 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2262 transitions. Word has length 29 [2019-09-09 05:49:40,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:40,279 INFO L475 AbstractCegarLoop]: Abstraction has 1368 states and 2262 transitions. [2019-09-09 05:49:40,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:40,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2262 transitions. [2019-09-09 05:49:40,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-09 05:49:40,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:40,283 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:40,283 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:40,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:40,284 INFO L82 PathProgramCache]: Analyzing trace with hash -352556875, now seen corresponding path program 1 times [2019-09-09 05:49:40,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:40,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:40,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:40,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:40,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:40,356 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-09 05:49:40,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:40,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:40,356 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:40,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:40,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:40,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:40,357 INFO L87 Difference]: Start difference. First operand 1368 states and 2262 transitions. Second operand 3 states. [2019-09-09 05:49:40,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:40,391 INFO L93 Difference]: Finished difference Result 2506 states and 4199 transitions. [2019-09-09 05:49:40,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:40,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-09 05:49:40,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:40,409 INFO L225 Difference]: With dead ends: 2506 [2019-09-09 05:49:40,409 INFO L226 Difference]: Without dead ends: 2506 [2019-09-09 05:49:40,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:40,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2019-09-09 05:49:40,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 1928. [2019-09-09 05:49:40,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2019-09-09 05:49:40,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 3110 transitions. [2019-09-09 05:49:40,484 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 3110 transitions. Word has length 29 [2019-09-09 05:49:40,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:40,484 INFO L475 AbstractCegarLoop]: Abstraction has 1928 states and 3110 transitions. [2019-09-09 05:49:40,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:40,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 3110 transitions. [2019-09-09 05:49:40,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-09 05:49:40,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:40,490 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:40,490 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:40,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:40,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1940904777, now seen corresponding path program 1 times [2019-09-09 05:49:40,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:40,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:40,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:40,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:40,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:40,516 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-09 05:49:40,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:40,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:40,517 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:40,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:40,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:40,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:40,518 INFO L87 Difference]: Start difference. First operand 1928 states and 3110 transitions. Second operand 3 states. [2019-09-09 05:49:40,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:40,563 INFO L93 Difference]: Finished difference Result 2666 states and 4295 transitions. [2019-09-09 05:49:40,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:40,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-09 05:49:40,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:40,580 INFO L225 Difference]: With dead ends: 2666 [2019-09-09 05:49:40,580 INFO L226 Difference]: Without dead ends: 2666 [2019-09-09 05:49:40,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:40,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2019-09-09 05:49:40,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2664. [2019-09-09 05:49:40,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2664 states. [2019-09-09 05:49:40,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 4294 transitions. [2019-09-09 05:49:40,671 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 4294 transitions. Word has length 29 [2019-09-09 05:49:40,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:40,671 INFO L475 AbstractCegarLoop]: Abstraction has 2664 states and 4294 transitions. [2019-09-09 05:49:40,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:40,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 4294 transitions. [2019-09-09 05:49:40,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-09 05:49:40,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:40,677 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:40,679 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:40,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:40,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1955852552, now seen corresponding path program 1 times [2019-09-09 05:49:40,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:40,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:40,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:40,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:40,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:40,716 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-09 05:49:40,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:40,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:40,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:40,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:40,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:40,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:40,719 INFO L87 Difference]: Start difference. First operand 2664 states and 4294 transitions. Second operand 3 states. [2019-09-09 05:49:40,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:40,763 INFO L93 Difference]: Finished difference Result 2698 states and 4295 transitions. [2019-09-09 05:49:40,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:40,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-09 05:49:40,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:40,782 INFO L225 Difference]: With dead ends: 2698 [2019-09-09 05:49:40,782 INFO L226 Difference]: Without dead ends: 2698 [2019-09-09 05:49:40,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:40,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2019-09-09 05:49:40,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2696. [2019-09-09 05:49:40,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2696 states. [2019-09-09 05:49:40,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 4294 transitions. [2019-09-09 05:49:40,884 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 4294 transitions. Word has length 30 [2019-09-09 05:49:40,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:40,885 INFO L475 AbstractCegarLoop]: Abstraction has 2696 states and 4294 transitions. [2019-09-09 05:49:40,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:40,885 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 4294 transitions. [2019-09-09 05:49:40,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-09 05:49:40,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:40,891 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:40,891 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:40,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:40,892 INFO L82 PathProgramCache]: Analyzing trace with hash -38292154, now seen corresponding path program 1 times [2019-09-09 05:49:40,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:40,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:40,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:40,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:40,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:40,919 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-09 05:49:40,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:40,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:40,920 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:40,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:40,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:40,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:40,922 INFO L87 Difference]: Start difference. First operand 2696 states and 4294 transitions. Second operand 3 states. [2019-09-09 05:49:40,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:40,976 INFO L93 Difference]: Finished difference Result 4874 states and 7879 transitions. [2019-09-09 05:49:40,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:40,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-09 05:49:40,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:41,009 INFO L225 Difference]: With dead ends: 4874 [2019-09-09 05:49:41,009 INFO L226 Difference]: Without dead ends: 4874 [2019-09-09 05:49:41,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:41,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2019-09-09 05:49:41,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 3848. [2019-09-09 05:49:41,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3848 states. [2019-09-09 05:49:41,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3848 states to 3848 states and 5958 transitions. [2019-09-09 05:49:41,156 INFO L78 Accepts]: Start accepts. Automaton has 3848 states and 5958 transitions. Word has length 30 [2019-09-09 05:49:41,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:41,157 INFO L475 AbstractCegarLoop]: Abstraction has 3848 states and 5958 transitions. [2019-09-09 05:49:41,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:41,157 INFO L276 IsEmpty]: Start isEmpty. Operand 3848 states and 5958 transitions. [2019-09-09 05:49:41,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-09 05:49:41,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:41,168 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:41,169 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:41,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:41,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1626640056, now seen corresponding path program 1 times [2019-09-09 05:49:41,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:41,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:41,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:41,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:41,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:41,216 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-09 05:49:41,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:41,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:41,217 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:41,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:41,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:41,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:41,218 INFO L87 Difference]: Start difference. First operand 3848 states and 5958 transitions. Second operand 3 states. [2019-09-09 05:49:41,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:41,287 INFO L93 Difference]: Finished difference Result 5258 states and 8135 transitions. [2019-09-09 05:49:41,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:41,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-09 05:49:41,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:41,332 INFO L225 Difference]: With dead ends: 5258 [2019-09-09 05:49:41,332 INFO L226 Difference]: Without dead ends: 5258 [2019-09-09 05:49:41,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:41,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2019-09-09 05:49:41,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 5256. [2019-09-09 05:49:41,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5256 states. [2019-09-09 05:49:41,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5256 states to 5256 states and 8134 transitions. [2019-09-09 05:49:41,515 INFO L78 Accepts]: Start accepts. Automaton has 5256 states and 8134 transitions. Word has length 30 [2019-09-09 05:49:41,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:41,516 INFO L475 AbstractCegarLoop]: Abstraction has 5256 states and 8134 transitions. [2019-09-09 05:49:41,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:41,516 INFO L276 IsEmpty]: Start isEmpty. Operand 5256 states and 8134 transitions. [2019-09-09 05:49:41,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-09 05:49:41,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:41,523 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:41,523 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:41,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:41,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1186842644, now seen corresponding path program 1 times [2019-09-09 05:49:41,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:41,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:41,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:41,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:41,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:41,544 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-09 05:49:41,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:41,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:41,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:41,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:41,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:41,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:41,546 INFO L87 Difference]: Start difference. First operand 5256 states and 8134 transitions. Second operand 3 states. [2019-09-09 05:49:41,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:41,589 INFO L93 Difference]: Finished difference Result 5322 states and 8135 transitions. [2019-09-09 05:49:41,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:41,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-09 05:49:41,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:41,608 INFO L225 Difference]: With dead ends: 5322 [2019-09-09 05:49:41,608 INFO L226 Difference]: Without dead ends: 5322 [2019-09-09 05:49:41,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:41,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2019-09-09 05:49:41,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 5320. [2019-09-09 05:49:41,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5320 states. [2019-09-09 05:49:41,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5320 states to 5320 states and 8134 transitions. [2019-09-09 05:49:41,728 INFO L78 Accepts]: Start accepts. Automaton has 5320 states and 8134 transitions. Word has length 31 [2019-09-09 05:49:41,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:41,728 INFO L475 AbstractCegarLoop]: Abstraction has 5320 states and 8134 transitions. [2019-09-09 05:49:41,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:41,728 INFO L276 IsEmpty]: Start isEmpty. Operand 5320 states and 8134 transitions. [2019-09-09 05:49:41,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-09 05:49:41,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:41,737 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:41,737 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:41,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:41,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1113979946, now seen corresponding path program 1 times [2019-09-09 05:49:41,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:41,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:41,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:41,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:41,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:41,766 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-09 05:49:41,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:41,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:41,767 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:41,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:41,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:41,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:41,768 INFO L87 Difference]: Start difference. First operand 5320 states and 8134 transitions. Second operand 3 states. [2019-09-09 05:49:41,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:41,836 INFO L93 Difference]: Finished difference Result 10378 states and 15495 transitions. [2019-09-09 05:49:41,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:41,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-09 05:49:41,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:41,860 INFO L225 Difference]: With dead ends: 10378 [2019-09-09 05:49:41,860 INFO L226 Difference]: Without dead ends: 10378 [2019-09-09 05:49:41,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:41,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10378 states. [2019-09-09 05:49:42,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10378 to 10376. [2019-09-09 05:49:42,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2019-09-09 05:49:42,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15494 transitions. [2019-09-09 05:49:42,131 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15494 transitions. Word has length 31 [2019-09-09 05:49:42,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:42,131 INFO L475 AbstractCegarLoop]: Abstraction has 10376 states and 15494 transitions. [2019-09-09 05:49:42,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:42,131 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15494 transitions. [2019-09-09 05:49:42,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-09 05:49:42,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:42,149 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:42,149 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:42,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:42,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1592639448, now seen corresponding path program 1 times [2019-09-09 05:49:42,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:42,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:42,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:42,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:42,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:42,174 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-09 05:49:42,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:42,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:42,174 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:42,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:42,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:42,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:42,176 INFO L87 Difference]: Start difference. First operand 10376 states and 15494 transitions. Second operand 3 states. [2019-09-09 05:49:42,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:42,241 INFO L93 Difference]: Finished difference Result 12170 states and 18695 transitions. [2019-09-09 05:49:42,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:42,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-09 05:49:42,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:42,273 INFO L225 Difference]: With dead ends: 12170 [2019-09-09 05:49:42,273 INFO L226 Difference]: Without dead ends: 12170 [2019-09-09 05:49:42,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:42,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2019-09-09 05:49:42,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 10376. [2019-09-09 05:49:42,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2019-09-09 05:49:42,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15366 transitions. [2019-09-09 05:49:42,485 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15366 transitions. Word has length 31 [2019-09-09 05:49:42,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:42,486 INFO L475 AbstractCegarLoop]: Abstraction has 10376 states and 15366 transitions. [2019-09-09 05:49:42,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:42,486 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15366 transitions. [2019-09-09 05:49:42,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-09 05:49:42,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:42,499 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:42,500 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:42,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:42,501 INFO L82 PathProgramCache]: Analyzing trace with hash 173854429, now seen corresponding path program 1 times [2019-09-09 05:49:42,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:42,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:42,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:42,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:42,502 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:42,520 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-09 05:49:42,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:42,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:42,521 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:42,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:42,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:42,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:42,522 INFO L87 Difference]: Start difference. First operand 10376 states and 15366 transitions. Second operand 3 states. [2019-09-09 05:49:42,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:42,584 INFO L93 Difference]: Finished difference Result 18314 states and 27527 transitions. [2019-09-09 05:49:42,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:42,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-09 05:49:42,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:42,624 INFO L225 Difference]: With dead ends: 18314 [2019-09-09 05:49:42,624 INFO L226 Difference]: Without dead ends: 18314 [2019-09-09 05:49:42,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:42,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18314 states. [2019-09-09 05:49:43,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18314 to 15240. [2019-09-09 05:49:43,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15240 states. [2019-09-09 05:49:43,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15240 states to 15240 states and 21894 transitions. [2019-09-09 05:49:43,412 INFO L78 Accepts]: Start accepts. Automaton has 15240 states and 21894 transitions. Word has length 32 [2019-09-09 05:49:43,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:43,413 INFO L475 AbstractCegarLoop]: Abstraction has 15240 states and 21894 transitions. [2019-09-09 05:49:43,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:43,413 INFO L276 IsEmpty]: Start isEmpty. Operand 15240 states and 21894 transitions. [2019-09-09 05:49:43,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-09 05:49:43,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:43,436 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:43,436 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:43,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:43,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1414493473, now seen corresponding path program 1 times [2019-09-09 05:49:43,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:43,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:43,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:43,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:43,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:43,455 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-09 05:49:43,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:43,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:43,455 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:43,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:43,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:43,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:43,456 INFO L87 Difference]: Start difference. First operand 15240 states and 21894 transitions. Second operand 3 states. [2019-09-09 05:49:43,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:43,514 INFO L93 Difference]: Finished difference Result 20362 states and 29191 transitions. [2019-09-09 05:49:43,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:43,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-09 05:49:43,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:43,558 INFO L225 Difference]: With dead ends: 20362 [2019-09-09 05:49:43,559 INFO L226 Difference]: Without dead ends: 20362 [2019-09-09 05:49:43,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:43,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20362 states. [2019-09-09 05:49:43,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20362 to 20360. [2019-09-09 05:49:43,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20360 states. [2019-09-09 05:49:43,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20360 states to 20360 states and 29190 transitions. [2019-09-09 05:49:43,822 INFO L78 Accepts]: Start accepts. Automaton has 20360 states and 29190 transitions. Word has length 32 [2019-09-09 05:49:43,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:43,822 INFO L475 AbstractCegarLoop]: Abstraction has 20360 states and 29190 transitions. [2019-09-09 05:49:43,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:43,823 INFO L276 IsEmpty]: Start isEmpty. Operand 20360 states and 29190 transitions. [2019-09-09 05:49:43,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-09 05:49:43,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:43,846 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:43,846 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:43,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:43,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1094734815, now seen corresponding path program 1 times [2019-09-09 05:49:43,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:43,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:43,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:43,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:43,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:43,863 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-09 05:49:43,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:43,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:43,864 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:43,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:43,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:43,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:43,865 INFO L87 Difference]: Start difference. First operand 20360 states and 29190 transitions. Second operand 3 states. [2019-09-09 05:49:43,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:43,922 INFO L93 Difference]: Finished difference Result 20746 states and 29447 transitions. [2019-09-09 05:49:43,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:43,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-09 05:49:43,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:43,959 INFO L225 Difference]: With dead ends: 20746 [2019-09-09 05:49:43,960 INFO L226 Difference]: Without dead ends: 20746 [2019-09-09 05:49:43,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:43,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20746 states. [2019-09-09 05:49:44,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20746 to 20744. [2019-09-09 05:49:44,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20744 states. [2019-09-09 05:49:44,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20744 states to 20744 states and 29446 transitions. [2019-09-09 05:49:44,282 INFO L78 Accepts]: Start accepts. Automaton has 20744 states and 29446 transitions. Word has length 33 [2019-09-09 05:49:44,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:44,282 INFO L475 AbstractCegarLoop]: Abstraction has 20744 states and 29446 transitions. [2019-09-09 05:49:44,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:44,282 INFO L276 IsEmpty]: Start isEmpty. Operand 20744 states and 29446 transitions. [2019-09-09 05:49:44,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-09 05:49:44,304 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:44,304 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:44,305 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:44,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:44,305 INFO L82 PathProgramCache]: Analyzing trace with hash -899409891, now seen corresponding path program 1 times [2019-09-09 05:49:44,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:44,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:44,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:44,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:44,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:44,324 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-09 05:49:44,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:44,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:44,324 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:44,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:44,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:44,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:44,325 INFO L87 Difference]: Start difference. First operand 20744 states and 29446 transitions. Second operand 3 states. [2019-09-09 05:49:44,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:44,408 INFO L93 Difference]: Finished difference Result 35850 states and 51463 transitions. [2019-09-09 05:49:44,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:44,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-09 05:49:44,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:44,472 INFO L225 Difference]: With dead ends: 35850 [2019-09-09 05:49:44,473 INFO L226 Difference]: Without dead ends: 35850 [2019-09-09 05:49:44,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:44,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35850 states. [2019-09-09 05:49:45,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35850 to 30728. [2019-09-09 05:49:45,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30728 states. [2019-09-09 05:49:45,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30728 states to 30728 states and 42246 transitions. [2019-09-09 05:49:45,453 INFO L78 Accepts]: Start accepts. Automaton has 30728 states and 42246 transitions. Word has length 33 [2019-09-09 05:49:45,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:45,454 INFO L475 AbstractCegarLoop]: Abstraction has 30728 states and 42246 transitions. [2019-09-09 05:49:45,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:45,454 INFO L276 IsEmpty]: Start isEmpty. Operand 30728 states and 42246 transitions. [2019-09-09 05:49:45,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-09 05:49:45,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:45,489 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:45,490 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:45,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:45,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1807209503, now seen corresponding path program 1 times [2019-09-09 05:49:45,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:45,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:45,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:45,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:45,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:45,511 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-09 05:49:45,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:45,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:45,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:45,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:45,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:45,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:45,512 INFO L87 Difference]: Start difference. First operand 30728 states and 42246 transitions. Second operand 3 states. [2019-09-09 05:49:45,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:45,597 INFO L93 Difference]: Finished difference Result 40458 states and 55303 transitions. [2019-09-09 05:49:45,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:45,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-09 05:49:45,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:45,639 INFO L225 Difference]: With dead ends: 40458 [2019-09-09 05:49:45,639 INFO L226 Difference]: Without dead ends: 40458 [2019-09-09 05:49:45,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:45,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40458 states. [2019-09-09 05:49:46,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40458 to 40456. [2019-09-09 05:49:46,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40456 states. [2019-09-09 05:49:46,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40456 states to 40456 states and 55302 transitions. [2019-09-09 05:49:46,256 INFO L78 Accepts]: Start accepts. Automaton has 40456 states and 55302 transitions. Word has length 33 [2019-09-09 05:49:46,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:46,256 INFO L475 AbstractCegarLoop]: Abstraction has 40456 states and 55302 transitions. [2019-09-09 05:49:46,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:46,256 INFO L276 IsEmpty]: Start isEmpty. Operand 40456 states and 55302 transitions. [2019-09-09 05:49:46,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-09 05:49:46,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:46,289 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:46,289 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:46,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:46,290 INFO L82 PathProgramCache]: Analyzing trace with hash -2111687692, now seen corresponding path program 1 times [2019-09-09 05:49:46,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:46,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:46,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:46,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:46,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:46,312 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-09 05:49:46,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:46,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:46,313 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:46,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:46,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:46,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:46,314 INFO L87 Difference]: Start difference. First operand 40456 states and 55302 transitions. Second operand 3 states. [2019-09-09 05:49:46,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:46,425 INFO L93 Difference]: Finished difference Result 40970 states and 55303 transitions. [2019-09-09 05:49:46,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:46,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-09 05:49:46,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:46,467 INFO L225 Difference]: With dead ends: 40970 [2019-09-09 05:49:46,467 INFO L226 Difference]: Without dead ends: 40970 [2019-09-09 05:49:46,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:46,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40970 states. [2019-09-09 05:49:46,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40970 to 40968. [2019-09-09 05:49:46,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40968 states. [2019-09-09 05:49:46,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40968 states to 40968 states and 55302 transitions. [2019-09-09 05:49:46,895 INFO L78 Accepts]: Start accepts. Automaton has 40968 states and 55302 transitions. Word has length 34 [2019-09-09 05:49:46,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:46,896 INFO L475 AbstractCegarLoop]: Abstraction has 40968 states and 55302 transitions. [2019-09-09 05:49:46,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:46,896 INFO L276 IsEmpty]: Start isEmpty. Operand 40968 states and 55302 transitions. [2019-09-09 05:49:46,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-09 05:49:46,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:46,928 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:46,929 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:46,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:46,929 INFO L82 PathProgramCache]: Analyzing trace with hash 189134898, now seen corresponding path program 1 times [2019-09-09 05:49:46,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:46,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:46,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:46,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:46,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:46,949 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-09 05:49:46,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:46,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:46,950 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:46,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:46,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:46,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:46,951 INFO L87 Difference]: Start difference. First operand 40968 states and 55302 transitions. Second operand 3 states. [2019-09-09 05:49:47,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:47,926 INFO L93 Difference]: Finished difference Result 69642 states and 94727 transitions. [2019-09-09 05:49:47,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:47,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-09 05:49:47,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:47,987 INFO L225 Difference]: With dead ends: 69642 [2019-09-09 05:49:47,987 INFO L226 Difference]: Without dead ends: 69642 [2019-09-09 05:49:47,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:48,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69642 states. [2019-09-09 05:49:48,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69642 to 61448. [2019-09-09 05:49:48,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61448 states. [2019-09-09 05:49:48,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61448 states to 61448 states and 80390 transitions. [2019-09-09 05:49:48,562 INFO L78 Accepts]: Start accepts. Automaton has 61448 states and 80390 transitions. Word has length 34 [2019-09-09 05:49:48,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:48,562 INFO L475 AbstractCegarLoop]: Abstraction has 61448 states and 80390 transitions. [2019-09-09 05:49:48,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:48,562 INFO L276 IsEmpty]: Start isEmpty. Operand 61448 states and 80390 transitions. [2019-09-09 05:49:48,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-09 05:49:48,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:48,770 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:48,770 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:48,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:48,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1399213004, now seen corresponding path program 1 times [2019-09-09 05:49:48,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:48,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:48,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:48,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:48,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:48,788 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-09 05:49:48,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:48,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:48,789 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:48,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:48,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:48,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:48,790 INFO L87 Difference]: Start difference. First operand 61448 states and 80390 transitions. Second operand 3 states. [2019-09-09 05:49:48,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:48,962 INFO L93 Difference]: Finished difference Result 79882 states and 103431 transitions. [2019-09-09 05:49:48,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:48,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-09 05:49:48,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:49,038 INFO L225 Difference]: With dead ends: 79882 [2019-09-09 05:49:49,039 INFO L226 Difference]: Without dead ends: 79882 [2019-09-09 05:49:49,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:49,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79882 states. [2019-09-09 05:49:49,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79882 to 79880. [2019-09-09 05:49:49,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79880 states. [2019-09-09 05:49:51,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79880 states to 79880 states and 103430 transitions. [2019-09-09 05:49:51,467 INFO L78 Accepts]: Start accepts. Automaton has 79880 states and 103430 transitions. Word has length 34 [2019-09-09 05:49:51,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:51,467 INFO L475 AbstractCegarLoop]: Abstraction has 79880 states and 103430 transitions. [2019-09-09 05:49:51,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:51,467 INFO L276 IsEmpty]: Start isEmpty. Operand 79880 states and 103430 transitions. [2019-09-09 05:49:51,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-09 05:49:51,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:51,491 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:51,491 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:51,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:51,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1568430036, now seen corresponding path program 1 times [2019-09-09 05:49:51,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:51,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:51,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:51,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:51,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:51,510 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-09 05:49:51,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:51,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:51,510 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:51,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:51,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:51,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:51,511 INFO L87 Difference]: Start difference. First operand 79880 states and 103430 transitions. Second operand 3 states. [2019-09-09 05:49:51,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:51,709 INFO L93 Difference]: Finished difference Result 80906 states and 103431 transitions. [2019-09-09 05:49:51,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:51,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-09-09 05:49:51,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:51,792 INFO L225 Difference]: With dead ends: 80906 [2019-09-09 05:49:51,792 INFO L226 Difference]: Without dead ends: 80906 [2019-09-09 05:49:51,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:51,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80906 states. [2019-09-09 05:49:52,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80906 to 80904. [2019-09-09 05:49:52,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80904 states. [2019-09-09 05:49:52,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80904 states to 80904 states and 103430 transitions. [2019-09-09 05:49:52,763 INFO L78 Accepts]: Start accepts. Automaton has 80904 states and 103430 transitions. Word has length 35 [2019-09-09 05:49:52,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:52,763 INFO L475 AbstractCegarLoop]: Abstraction has 80904 states and 103430 transitions. [2019-09-09 05:49:52,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:52,763 INFO L276 IsEmpty]: Start isEmpty. Operand 80904 states and 103430 transitions. [2019-09-09 05:49:52,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-09 05:49:52,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:52,788 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:52,788 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:52,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:52,789 INFO L82 PathProgramCache]: Analyzing trace with hash -425714670, now seen corresponding path program 1 times [2019-09-09 05:49:52,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:52,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:52,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:52,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:52,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:52,805 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-09 05:49:52,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:52,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:52,806 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:52,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:52,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:52,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:52,807 INFO L87 Difference]: Start difference. First operand 80904 states and 103430 transitions. Second operand 3 states. [2019-09-09 05:49:53,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:53,049 INFO L93 Difference]: Finished difference Result 135178 states and 173063 transitions. [2019-09-09 05:49:53,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:53,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-09-09 05:49:53,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:53,158 INFO L225 Difference]: With dead ends: 135178 [2019-09-09 05:49:53,158 INFO L226 Difference]: Without dead ends: 135178 [2019-09-09 05:49:53,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:53,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135178 states. [2019-09-09 05:49:55,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135178 to 122888. [2019-09-09 05:49:55,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122888 states. [2019-09-09 05:49:55,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122888 states to 122888 states and 152582 transitions. [2019-09-09 05:49:55,676 INFO L78 Accepts]: Start accepts. Automaton has 122888 states and 152582 transitions. Word has length 35 [2019-09-09 05:49:55,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:55,676 INFO L475 AbstractCegarLoop]: Abstraction has 122888 states and 152582 transitions. [2019-09-09 05:49:55,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:55,676 INFO L276 IsEmpty]: Start isEmpty. Operand 122888 states and 152582 transitions. [2019-09-09 05:49:55,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-09 05:49:55,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:55,726 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:55,726 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:55,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:55,727 INFO L82 PathProgramCache]: Analyzing trace with hash -2014062572, now seen corresponding path program 1 times [2019-09-09 05:49:55,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:55,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:55,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:55,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:55,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:55,743 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-09 05:49:55,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:55,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:55,743 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:55,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:55,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:55,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:55,744 INFO L87 Difference]: Start difference. First operand 122888 states and 152582 transitions. Second operand 3 states. [2019-09-09 05:49:56,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:56,048 INFO L93 Difference]: Finished difference Result 157706 states and 192519 transitions. [2019-09-09 05:49:56,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:56,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-09-09 05:49:56,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:56,165 INFO L225 Difference]: With dead ends: 157706 [2019-09-09 05:49:56,165 INFO L226 Difference]: Without dead ends: 157706 [2019-09-09 05:49:56,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:56,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157706 states. [2019-09-09 05:49:57,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157706 to 157704. [2019-09-09 05:49:57,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157704 states. [2019-09-09 05:49:57,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157704 states to 157704 states and 192518 transitions. [2019-09-09 05:49:57,735 INFO L78 Accepts]: Start accepts. Automaton has 157704 states and 192518 transitions. Word has length 35 [2019-09-09 05:49:57,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:57,735 INFO L475 AbstractCegarLoop]: Abstraction has 157704 states and 192518 transitions. [2019-09-09 05:49:57,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:57,736 INFO L276 IsEmpty]: Start isEmpty. Operand 157704 states and 192518 transitions. [2019-09-09 05:49:57,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-09 05:49:57,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:57,793 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:57,794 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:57,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:57,794 INFO L82 PathProgramCache]: Analyzing trace with hash -312037047, now seen corresponding path program 1 times [2019-09-09 05:49:57,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:57,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:57,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:57,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:57,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:57,809 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-09 05:49:57,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:57,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:57,810 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:57,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:57,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:57,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:57,811 INFO L87 Difference]: Start difference. First operand 157704 states and 192518 transitions. Second operand 3 states. [2019-09-09 05:50:00,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:00,404 INFO L93 Difference]: Finished difference Result 159754 states and 192519 transitions. [2019-09-09 05:50:00,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:00,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-09-09 05:50:00,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:00,508 INFO L225 Difference]: With dead ends: 159754 [2019-09-09 05:50:00,509 INFO L226 Difference]: Without dead ends: 159754 [2019-09-09 05:50:00,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:00,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159754 states. [2019-09-09 05:50:01,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159754 to 159752. [2019-09-09 05:50:01,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159752 states. [2019-09-09 05:50:01,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159752 states to 159752 states and 192518 transitions. [2019-09-09 05:50:01,856 INFO L78 Accepts]: Start accepts. Automaton has 159752 states and 192518 transitions. Word has length 36 [2019-09-09 05:50:01,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:01,856 INFO L475 AbstractCegarLoop]: Abstraction has 159752 states and 192518 transitions. [2019-09-09 05:50:01,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:01,857 INFO L276 IsEmpty]: Start isEmpty. Operand 159752 states and 192518 transitions. [2019-09-09 05:50:01,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-09 05:50:01,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:01,909 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:01,909 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:01,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:01,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1988785543, now seen corresponding path program 1 times [2019-09-09 05:50:01,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:01,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:01,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:01,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:01,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:01,936 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-09 05:50:01,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:01,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:01,937 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:01,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:01,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:01,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:01,938 INFO L87 Difference]: Start difference. First operand 159752 states and 192518 transitions. Second operand 3 states. [2019-09-09 05:50:02,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:02,320 INFO L93 Difference]: Finished difference Result 262154 states and 313351 transitions. [2019-09-09 05:50:02,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:02,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-09-09 05:50:02,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:02,552 INFO L225 Difference]: With dead ends: 262154 [2019-09-09 05:50:02,552 INFO L226 Difference]: Without dead ends: 262154 [2019-09-09 05:50:02,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:02,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262154 states. [2019-09-09 05:50:04,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262154 to 245768. [2019-09-09 05:50:04,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245768 states. [2019-09-09 05:50:04,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245768 states to 245768 states and 288774 transitions. [2019-09-09 05:50:04,772 INFO L78 Accepts]: Start accepts. Automaton has 245768 states and 288774 transitions. Word has length 36 [2019-09-09 05:50:04,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:04,772 INFO L475 AbstractCegarLoop]: Abstraction has 245768 states and 288774 transitions. [2019-09-09 05:50:04,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:04,772 INFO L276 IsEmpty]: Start isEmpty. Operand 245768 states and 288774 transitions. [2019-09-09 05:50:04,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-09 05:50:04,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:04,880 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:04,880 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:04,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:04,880 INFO L82 PathProgramCache]: Analyzing trace with hash 400437641, now seen corresponding path program 1 times [2019-09-09 05:50:04,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:04,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:04,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:04,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:04,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:04,902 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-09 05:50:04,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:04,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:04,903 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:04,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:04,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:04,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:04,903 INFO L87 Difference]: Start difference. First operand 245768 states and 288774 transitions. Second operand 3 states. [2019-09-09 05:50:06,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:06,309 INFO L93 Difference]: Finished difference Result 311306 states and 356359 transitions. [2019-09-09 05:50:06,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:06,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-09-09 05:50:06,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:06,579 INFO L225 Difference]: With dead ends: 311306 [2019-09-09 05:50:06,579 INFO L226 Difference]: Without dead ends: 311306 [2019-09-09 05:50:06,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:06,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311306 states. [2019-09-09 05:50:12,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311306 to 311304. [2019-09-09 05:50:12,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311304 states. [2019-09-09 05:50:12,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311304 states to 311304 states and 356358 transitions. [2019-09-09 05:50:12,360 INFO L78 Accepts]: Start accepts. Automaton has 311304 states and 356358 transitions. Word has length 36 [2019-09-09 05:50:12,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:12,360 INFO L475 AbstractCegarLoop]: Abstraction has 311304 states and 356358 transitions. [2019-09-09 05:50:12,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:12,360 INFO L276 IsEmpty]: Start isEmpty. Operand 311304 states and 356358 transitions. [2019-09-09 05:50:12,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-09 05:50:12,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:12,477 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:12,477 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:12,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:12,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1523025865, now seen corresponding path program 1 times [2019-09-09 05:50:12,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:12,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:12,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:12,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:12,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:12,493 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-09 05:50:12,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:12,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:12,494 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:12,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:12,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:12,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:12,495 INFO L87 Difference]: Start difference. First operand 311304 states and 356358 transitions. Second operand 3 states. [2019-09-09 05:50:14,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:14,261 INFO L93 Difference]: Finished difference Result 315402 states and 356359 transitions. [2019-09-09 05:50:14,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:14,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-09-09 05:50:14,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:14,511 INFO L225 Difference]: With dead ends: 315402 [2019-09-09 05:50:14,511 INFO L226 Difference]: Without dead ends: 315402 [2019-09-09 05:50:14,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:14,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315402 states. [2019-09-09 05:50:20,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315402 to 315400. [2019-09-09 05:50:20,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315400 states. [2019-09-09 05:50:21,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315400 states to 315400 states and 356358 transitions. [2019-09-09 05:50:21,037 INFO L78 Accepts]: Start accepts. Automaton has 315400 states and 356358 transitions. Word has length 37 [2019-09-09 05:50:21,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:21,037 INFO L475 AbstractCegarLoop]: Abstraction has 315400 states and 356358 transitions. [2019-09-09 05:50:21,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:21,038 INFO L276 IsEmpty]: Start isEmpty. Operand 315400 states and 356358 transitions. [2019-09-09 05:50:21,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-09 05:50:21,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:21,153 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:21,153 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:21,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:21,154 INFO L82 PathProgramCache]: Analyzing trace with hash -471118841, now seen corresponding path program 1 times [2019-09-09 05:50:21,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:21,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:21,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:21,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:21,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:21,169 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-09 05:50:21,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:21,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:21,170 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:21,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:21,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:21,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:21,171 INFO L87 Difference]: Start difference. First operand 315400 states and 356358 transitions. Second operand 3 states. [2019-09-09 05:50:23,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:23,077 INFO L93 Difference]: Finished difference Result 507912 states and 561158 transitions. [2019-09-09 05:50:23,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:23,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-09-09 05:50:23,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:23,558 INFO L225 Difference]: With dead ends: 507912 [2019-09-09 05:50:23,558 INFO L226 Difference]: Without dead ends: 507912 [2019-09-09 05:50:23,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:23,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507912 states. [2019-09-09 05:50:31,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507912 to 491528. [2019-09-09 05:50:31,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491528 states. [2019-09-09 05:50:32,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491528 states to 491528 states and 544774 transitions. [2019-09-09 05:50:32,173 INFO L78 Accepts]: Start accepts. Automaton has 491528 states and 544774 transitions. Word has length 37 [2019-09-09 05:50:32,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:32,173 INFO L475 AbstractCegarLoop]: Abstraction has 491528 states and 544774 transitions. [2019-09-09 05:50:32,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:32,173 INFO L276 IsEmpty]: Start isEmpty. Operand 491528 states and 544774 transitions. [2019-09-09 05:50:32,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-09 05:50:32,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:32,424 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:32,424 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:32,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:32,424 INFO L82 PathProgramCache]: Analyzing trace with hash -2059466743, now seen corresponding path program 1 times [2019-09-09 05:50:32,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:32,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:32,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:32,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:32,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:32,463 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-09 05:50:32,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:32,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:32,464 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:32,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:32,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:32,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:32,465 INFO L87 Difference]: Start difference. First operand 491528 states and 544774 transitions. Second operand 3 states. [2019-09-09 05:50:34,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:34,489 INFO L93 Difference]: Finished difference Result 614406 states and 655365 transitions. [2019-09-09 05:50:34,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:34,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-09-09 05:50:34,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:34,490 INFO L225 Difference]: With dead ends: 614406 [2019-09-09 05:50:34,490 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:50:34,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:34,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:50:34,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:50:34,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:50:34,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:50:34,491 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-09-09 05:50:34,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:34,491 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:50:34,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:34,491 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:50:34,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:50:34,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:50:34 BoogieIcfgContainer [2019-09-09 05:50:34,497 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:50:34,499 INFO L168 Benchmark]: Toolchain (without parser) took 56955.67 ms. Allocated memory was 136.8 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 84.1 MB in the beginning and 1.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-09-09 05:50:34,500 INFO L168 Benchmark]: CDTParser took 1.04 ms. Allocated memory is still 136.8 MB. Free memory was 103.0 MB in the beginning and 102.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 05:50:34,500 INFO L168 Benchmark]: CACSL2BoogieTranslator took 391.52 ms. Allocated memory was 136.8 MB in the beginning and 197.1 MB in the end (delta: 60.3 MB). Free memory was 83.9 MB in the beginning and 174.3 MB in the end (delta: -90.3 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-09-09 05:50:34,501 INFO L168 Benchmark]: Boogie Preprocessor took 35.17 ms. Allocated memory is still 197.1 MB. Free memory was 174.3 MB in the beginning and 172.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-09-09 05:50:34,501 INFO L168 Benchmark]: RCFGBuilder took 410.09 ms. Allocated memory is still 197.1 MB. Free memory was 172.2 MB in the beginning and 149.9 MB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-09-09 05:50:34,502 INFO L168 Benchmark]: TraceAbstraction took 56113.21 ms. Allocated memory was 197.1 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 149.3 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-09-09 05:50:34,505 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.04 ms. Allocated memory is still 136.8 MB. Free memory was 103.0 MB in the beginning and 102.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 391.52 ms. Allocated memory was 136.8 MB in the beginning and 197.1 MB in the end (delta: 60.3 MB). Free memory was 83.9 MB in the beginning and 174.3 MB in the end (delta: -90.3 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.17 ms. Allocated memory is still 197.1 MB. Free memory was 174.3 MB in the beginning and 172.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 410.09 ms. Allocated memory is still 197.1 MB. Free memory was 172.2 MB in the beginning and 149.9 MB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 56113.21 ms. Allocated memory was 197.1 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 149.3 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 217]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 56 locations, 1 error locations. SAFE Result, 56.0s OverallTime, 40 OverallIterations, 1 TraceHistogramMax, 15.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4632 SDtfs, 2311 SDslu, 3194 SDs, 0 SdLazy, 213 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=491528occurred in iteration=39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 37.4s AutomataMinimizationTime, 40 MinimizatonAttempts, 65580 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1225 NumberOfCodeBlocks, 1225 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1185 ConstructedInterpolants, 0 QuantifiedInterpolants, 74775 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...