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_9.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:31:05,421 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:31:05,423 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:31:05,435 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:31:05,436 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:31:05,437 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:31:05,438 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:31:05,440 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:31:05,442 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:31:05,443 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:31:05,444 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:31:05,445 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:31:05,445 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:31:05,446 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:31:05,447 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:31:05,449 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:31:05,449 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:31:05,450 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:31:05,452 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:31:05,455 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:31:05,459 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:31:05,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:31:05,466 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:31:05,467 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:31:05,470 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:31:05,470 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:31:05,470 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:31:05,471 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:31:05,471 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:31:05,472 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:31:05,473 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:31:05,473 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:31:05,474 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:31:05,475 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:31:05,476 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:31:05,476 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:31:05,477 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:31:05,477 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:31:05,477 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:31:05,478 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:31:05,479 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:31:05,479 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-10-03 02:31:05,501 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:31:05,502 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:31:05,503 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:31:05,503 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:31:05,504 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:31:05,504 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:31:05,504 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:31:05,504 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:31:05,504 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:31:05,505 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:31:05,507 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:31:05,507 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:31:05,508 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:31:05,508 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:31:05,508 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:31:05,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:31:05,509 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:31:05,509 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:31:05,509 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:31:05,509 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:31:05,510 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:31:05,510 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:31:05,510 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:31:05,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:31:05,511 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:31:05,511 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:31:05,511 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:31:05,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:31:05,511 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:31:05,512 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:31:05,557 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:31:05,578 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:31:05,584 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:31:05,585 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:31:05,586 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:31:05,587 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_9.c [2019-10-03 02:31:05,666 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a690d6d7/06f9f86dd7ea42d78a7538276f3dae8e/FLAG15aa41696 [2019-10-03 02:31:06,186 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:31:06,188 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c [2019-10-03 02:31:06,198 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a690d6d7/06f9f86dd7ea42d78a7538276f3dae8e/FLAG15aa41696 [2019-10-03 02:31:06,517 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a690d6d7/06f9f86dd7ea42d78a7538276f3dae8e [2019-10-03 02:31:06,526 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:31:06,528 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:31:06,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:31:06,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:31:06,533 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:31:06,534 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:31:06" (1/1) ... [2019-10-03 02:31:06,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dfa82b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:06, skipping insertion in model container [2019-10-03 02:31:06,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:31:06" (1/1) ... [2019-10-03 02:31:06,544 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:31:06,566 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:31:06,787 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:31:06,791 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:31:06,925 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:31:06,939 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:31:06,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:06 WrapperNode [2019-10-03 02:31:06,940 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:31:06,940 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:31:06,940 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:31:06,940 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:31:06,952 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:06" (1/1) ... [2019-10-03 02:31:06,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:06" (1/1) ... [2019-10-03 02:31:06,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:06" (1/1) ... [2019-10-03 02:31:06,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:06" (1/1) ... [2019-10-03 02:31:06,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:06" (1/1) ... [2019-10-03 02:31:06,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:06" (1/1) ... [2019-10-03 02:31:06,973 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:06" (1/1) ... [2019-10-03 02:31:06,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:31:06,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:31:06,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:31:06,977 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:31:06,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:06" (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-10-03 02:31:07,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:31:07,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:31:07,037 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:31:07,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:31:07,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:31:07,038 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:31:07,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:31:07,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:31:07,330 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:31:07,330 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-03 02:31:07,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:31:07 BoogieIcfgContainer [2019-10-03 02:31:07,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:31:07,335 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:31:07,335 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:31:07,343 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:31:07,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:31:06" (1/3) ... [2019-10-03 02:31:07,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55d8ad27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:31:07, skipping insertion in model container [2019-10-03 02:31:07,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:06" (2/3) ... [2019-10-03 02:31:07,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55d8ad27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:31:07, skipping insertion in model container [2019-10-03 02:31:07,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:31:07" (3/3) ... [2019-10-03 02:31:07,351 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2019-10-03 02:31:07,370 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:31:07,381 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:31:07,407 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:31:07,456 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:31:07,457 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:31:07,457 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:31:07,457 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:31:07,457 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:31:07,457 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:31:07,458 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:31:07,458 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:31:07,476 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-10-03 02:31:07,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-03 02:31:07,488 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:07,489 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:07,492 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:07,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:07,497 INFO L82 PathProgramCache]: Analyzing trace with hash 691982780, now seen corresponding path program 1 times [2019-10-03 02:31:07,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:07,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:07,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:07,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:07,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:07,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-10-03 02:31:07,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:07,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:07,719 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:07,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:07,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:07,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:07,737 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2019-10-03 02:31:07,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:07,798 INFO L93 Difference]: Finished difference Result 74 states and 125 transitions. [2019-10-03 02:31:07,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:07,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-03 02:31:07,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:07,810 INFO L225 Difference]: With dead ends: 74 [2019-10-03 02:31:07,811 INFO L226 Difference]: Without dead ends: 66 [2019-10-03 02:31:07,813 INFO L640 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-10-03 02:31:07,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-03 02:31:07,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-10-03 02:31:07,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-03 02:31:07,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 81 transitions. [2019-10-03 02:31:07,856 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 81 transitions. Word has length 19 [2019-10-03 02:31:07,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:07,857 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 81 transitions. [2019-10-03 02:31:07,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:07,857 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 81 transitions. [2019-10-03 02:31:07,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-03 02:31:07,858 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:07,858 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:07,859 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:07,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:07,860 INFO L82 PathProgramCache]: Analyzing trace with hash 950148218, now seen corresponding path program 1 times [2019-10-03 02:31:07,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:07,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:07,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:07,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:07,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:07,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:07,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:07,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:07,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:07,919 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:07,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:07,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:07,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:07,923 INFO L87 Difference]: Start difference. First operand 46 states and 81 transitions. Second operand 3 states. [2019-10-03 02:31:07,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:07,964 INFO L93 Difference]: Finished difference Result 66 states and 114 transitions. [2019-10-03 02:31:07,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:07,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-03 02:31:07,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:07,966 INFO L225 Difference]: With dead ends: 66 [2019-10-03 02:31:07,967 INFO L226 Difference]: Without dead ends: 66 [2019-10-03 02:31:07,968 INFO L640 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-10-03 02:31:07,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-03 02:31:07,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-10-03 02:31:07,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-03 02:31:07,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 113 transitions. [2019-10-03 02:31:07,978 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 113 transitions. Word has length 19 [2019-10-03 02:31:07,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:07,979 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 113 transitions. [2019-10-03 02:31:07,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:07,979 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 113 transitions. [2019-10-03 02:31:07,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-03 02:31:07,980 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:07,980 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:07,981 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:07,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:07,981 INFO L82 PathProgramCache]: Analyzing trace with hash -23156596, now seen corresponding path program 1 times [2019-10-03 02:31:07,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:07,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:07,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:07,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:07,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:08,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:08,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:08,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:08,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:08,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:08,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:08,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:08,035 INFO L87 Difference]: Start difference. First operand 64 states and 113 transitions. Second operand 3 states. [2019-10-03 02:31:08,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:08,059 INFO L93 Difference]: Finished difference Result 69 states and 116 transitions. [2019-10-03 02:31:08,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:08,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-03 02:31:08,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:08,061 INFO L225 Difference]: With dead ends: 69 [2019-10-03 02:31:08,061 INFO L226 Difference]: Without dead ends: 69 [2019-10-03 02:31:08,062 INFO L640 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-10-03 02:31:08,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-03 02:31:08,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-10-03 02:31:08,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-03 02:31:08,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 115 transitions. [2019-10-03 02:31:08,071 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 115 transitions. Word has length 20 [2019-10-03 02:31:08,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:08,071 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 115 transitions. [2019-10-03 02:31:08,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:08,072 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2019-10-03 02:31:08,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-03 02:31:08,073 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:08,073 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:08,074 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:08,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:08,074 INFO L82 PathProgramCache]: Analyzing trace with hash -609962610, now seen corresponding path program 1 times [2019-10-03 02:31:08,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:08,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:08,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:08,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:08,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:08,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:08,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:08,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:08,147 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:08,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:08,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:08,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:08,148 INFO L87 Difference]: Start difference. First operand 67 states and 115 transitions. Second operand 3 states. [2019-10-03 02:31:08,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:08,179 INFO L93 Difference]: Finished difference Result 122 states and 213 transitions. [2019-10-03 02:31:08,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:08,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-03 02:31:08,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:08,183 INFO L225 Difference]: With dead ends: 122 [2019-10-03 02:31:08,184 INFO L226 Difference]: Without dead ends: 122 [2019-10-03 02:31:08,184 INFO L640 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-10-03 02:31:08,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-10-03 02:31:08,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 88. [2019-10-03 02:31:08,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-03 02:31:08,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 152 transitions. [2019-10-03 02:31:08,205 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 152 transitions. Word has length 20 [2019-10-03 02:31:08,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:08,205 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 152 transitions. [2019-10-03 02:31:08,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:08,205 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 152 transitions. [2019-10-03 02:31:08,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-03 02:31:08,206 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:08,207 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:08,207 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:08,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:08,207 INFO L82 PathProgramCache]: Analyzing trace with hash -351797172, now seen corresponding path program 1 times [2019-10-03 02:31:08,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:08,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:08,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:08,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:08,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:08,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:08,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:08,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:08,254 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:08,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:08,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:08,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:08,255 INFO L87 Difference]: Start difference. First operand 88 states and 152 transitions. Second operand 3 states. [2019-10-03 02:31:08,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:08,273 INFO L93 Difference]: Finished difference Result 124 states and 211 transitions. [2019-10-03 02:31:08,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:08,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-03 02:31:08,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:08,276 INFO L225 Difference]: With dead ends: 124 [2019-10-03 02:31:08,276 INFO L226 Difference]: Without dead ends: 124 [2019-10-03 02:31:08,277 INFO L640 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-10-03 02:31:08,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-10-03 02:31:08,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-10-03 02:31:08,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-10-03 02:31:08,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 210 transitions. [2019-10-03 02:31:08,287 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 210 transitions. Word has length 20 [2019-10-03 02:31:08,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:08,288 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 210 transitions. [2019-10-03 02:31:08,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:08,288 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 210 transitions. [2019-10-03 02:31:08,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-03 02:31:08,289 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:08,290 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:08,290 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:08,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:08,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1728757681, now seen corresponding path program 1 times [2019-10-03 02:31:08,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:08,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:08,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:08,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:08,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:08,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:08,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:08,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:08,334 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:08,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:08,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:08,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:08,335 INFO L87 Difference]: Start difference. First operand 122 states and 210 transitions. Second operand 3 states. [2019-10-03 02:31:08,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:08,358 INFO L93 Difference]: Finished difference Result 126 states and 211 transitions. [2019-10-03 02:31:08,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:08,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-03 02:31:08,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:08,360 INFO L225 Difference]: With dead ends: 126 [2019-10-03 02:31:08,360 INFO L226 Difference]: Without dead ends: 126 [2019-10-03 02:31:08,361 INFO L640 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-10-03 02:31:08,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-03 02:31:08,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2019-10-03 02:31:08,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-10-03 02:31:08,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 210 transitions. [2019-10-03 02:31:08,370 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 210 transitions. Word has length 21 [2019-10-03 02:31:08,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:08,370 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 210 transitions. [2019-10-03 02:31:08,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:08,371 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 210 transitions. [2019-10-03 02:31:08,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-03 02:31:08,372 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:08,372 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:08,373 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:08,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:08,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1979403601, now seen corresponding path program 1 times [2019-10-03 02:31:08,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:08,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:08,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:08,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:08,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:08,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:08,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:08,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:08,412 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:08,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:08,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:08,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:08,414 INFO L87 Difference]: Start difference. First operand 124 states and 210 transitions. Second operand 3 states. [2019-10-03 02:31:08,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:08,439 INFO L93 Difference]: Finished difference Result 226 states and 387 transitions. [2019-10-03 02:31:08,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:08,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-03 02:31:08,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:08,441 INFO L225 Difference]: With dead ends: 226 [2019-10-03 02:31:08,442 INFO L226 Difference]: Without dead ends: 226 [2019-10-03 02:31:08,442 INFO L640 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-10-03 02:31:08,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-10-03 02:31:08,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 168. [2019-10-03 02:31:08,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-10-03 02:31:08,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 282 transitions. [2019-10-03 02:31:08,453 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 282 transitions. Word has length 21 [2019-10-03 02:31:08,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:08,454 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 282 transitions. [2019-10-03 02:31:08,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:08,454 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 282 transitions. [2019-10-03 02:31:08,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-03 02:31:08,456 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:08,456 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:08,456 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:08,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:08,457 INFO L82 PathProgramCache]: Analyzing trace with hash -2057398257, now seen corresponding path program 1 times [2019-10-03 02:31:08,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:08,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:08,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:08,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:08,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:08,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:08,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:08,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:08,523 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:08,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:08,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:08,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:08,525 INFO L87 Difference]: Start difference. First operand 168 states and 282 transitions. Second operand 3 states. [2019-10-03 02:31:08,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:08,558 INFO L93 Difference]: Finished difference Result 234 states and 387 transitions. [2019-10-03 02:31:08,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:08,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-03 02:31:08,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:08,560 INFO L225 Difference]: With dead ends: 234 [2019-10-03 02:31:08,560 INFO L226 Difference]: Without dead ends: 234 [2019-10-03 02:31:08,561 INFO L640 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-10-03 02:31:08,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-10-03 02:31:08,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2019-10-03 02:31:08,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-03 02:31:08,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 386 transitions. [2019-10-03 02:31:08,583 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 386 transitions. Word has length 21 [2019-10-03 02:31:08,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:08,586 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 386 transitions. [2019-10-03 02:31:08,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:08,586 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 386 transitions. [2019-10-03 02:31:08,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-03 02:31:08,591 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:08,591 INFO L411 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] [2019-10-03 02:31:08,592 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:08,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:08,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1232183873, now seen corresponding path program 1 times [2019-10-03 02:31:08,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:08,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:08,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:08,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:08,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:08,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:08,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:08,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:08,662 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:08,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:08,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:08,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:08,664 INFO L87 Difference]: Start difference. First operand 232 states and 386 transitions. Second operand 3 states. [2019-10-03 02:31:08,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:08,693 INFO L93 Difference]: Finished difference Result 238 states and 387 transitions. [2019-10-03 02:31:08,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:08,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-03 02:31:08,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:08,695 INFO L225 Difference]: With dead ends: 238 [2019-10-03 02:31:08,696 INFO L226 Difference]: Without dead ends: 238 [2019-10-03 02:31:08,696 INFO L640 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-10-03 02:31:08,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-10-03 02:31:08,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2019-10-03 02:31:08,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-10-03 02:31:08,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 386 transitions. [2019-10-03 02:31:08,704 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 386 transitions. Word has length 22 [2019-10-03 02:31:08,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:08,704 INFO L475 AbstractCegarLoop]: Abstraction has 236 states and 386 transitions. [2019-10-03 02:31:08,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:08,704 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 386 transitions. [2019-10-03 02:31:08,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-03 02:31:08,706 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:08,706 INFO L411 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] [2019-10-03 02:31:08,706 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:08,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:08,707 INFO L82 PathProgramCache]: Analyzing trace with hash 645377859, now seen corresponding path program 1 times [2019-10-03 02:31:08,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:08,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:08,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:08,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:08,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:08,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:08,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:08,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:08,739 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:08,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:08,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:08,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:08,742 INFO L87 Difference]: Start difference. First operand 236 states and 386 transitions. Second operand 3 states. [2019-10-03 02:31:08,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:08,762 INFO L93 Difference]: Finished difference Result 426 states and 703 transitions. [2019-10-03 02:31:08,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:08,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-03 02:31:08,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:08,766 INFO L225 Difference]: With dead ends: 426 [2019-10-03 02:31:08,766 INFO L226 Difference]: Without dead ends: 426 [2019-10-03 02:31:08,767 INFO L640 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-10-03 02:31:08,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-10-03 02:31:08,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 328. [2019-10-03 02:31:08,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-10-03 02:31:08,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 526 transitions. [2019-10-03 02:31:08,780 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 526 transitions. Word has length 22 [2019-10-03 02:31:08,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:08,781 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 526 transitions. [2019-10-03 02:31:08,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:08,781 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 526 transitions. [2019-10-03 02:31:08,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-03 02:31:08,783 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:08,783 INFO L411 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] [2019-10-03 02:31:08,783 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:08,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:08,784 INFO L82 PathProgramCache]: Analyzing trace with hash 903543297, now seen corresponding path program 1 times [2019-10-03 02:31:08,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:08,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:08,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:08,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:08,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:08,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:08,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:08,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:08,809 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:08,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:08,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:08,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:08,810 INFO L87 Difference]: Start difference. First operand 328 states and 526 transitions. Second operand 3 states. [2019-10-03 02:31:08,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:08,831 INFO L93 Difference]: Finished difference Result 450 states and 711 transitions. [2019-10-03 02:31:08,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:08,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-03 02:31:08,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:08,834 INFO L225 Difference]: With dead ends: 450 [2019-10-03 02:31:08,834 INFO L226 Difference]: Without dead ends: 450 [2019-10-03 02:31:08,834 INFO L640 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-10-03 02:31:08,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-10-03 02:31:08,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 448. [2019-10-03 02:31:08,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-10-03 02:31:08,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 710 transitions. [2019-10-03 02:31:08,848 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 710 transitions. Word has length 22 [2019-10-03 02:31:08,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:08,849 INFO L475 AbstractCegarLoop]: Abstraction has 448 states and 710 transitions. [2019-10-03 02:31:08,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:08,849 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 710 transitions. [2019-10-03 02:31:08,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-03 02:31:08,850 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:08,850 INFO L411 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] [2019-10-03 02:31:08,850 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:08,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:08,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1467908124, now seen corresponding path program 1 times [2019-10-03 02:31:08,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:08,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:08,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:08,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:08,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:08,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:08,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:08,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:08,890 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:08,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:08,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:08,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:08,891 INFO L87 Difference]: Start difference. First operand 448 states and 710 transitions. Second operand 3 states. [2019-10-03 02:31:08,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:08,909 INFO L93 Difference]: Finished difference Result 458 states and 711 transitions. [2019-10-03 02:31:08,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:08,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-03 02:31:08,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:08,912 INFO L225 Difference]: With dead ends: 458 [2019-10-03 02:31:08,912 INFO L226 Difference]: Without dead ends: 458 [2019-10-03 02:31:08,913 INFO L640 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-10-03 02:31:08,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-10-03 02:31:08,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 456. [2019-10-03 02:31:08,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-10-03 02:31:08,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 710 transitions. [2019-10-03 02:31:08,924 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 710 transitions. Word has length 23 [2019-10-03 02:31:08,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:08,926 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 710 transitions. [2019-10-03 02:31:08,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:08,926 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 710 transitions. [2019-10-03 02:31:08,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-03 02:31:08,929 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:08,930 INFO L411 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] [2019-10-03 02:31:08,930 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:08,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:08,930 INFO L82 PathProgramCache]: Analyzing trace with hash -2054714138, now seen corresponding path program 1 times [2019-10-03 02:31:08,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:08,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:08,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:08,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:08,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:08,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:08,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:08,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:08,973 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:08,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:08,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:08,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:08,974 INFO L87 Difference]: Start difference. First operand 456 states and 710 transitions. Second operand 3 states. [2019-10-03 02:31:08,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:08,996 INFO L93 Difference]: Finished difference Result 810 states and 1271 transitions. [2019-10-03 02:31:08,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:08,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-03 02:31:08,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:09,001 INFO L225 Difference]: With dead ends: 810 [2019-10-03 02:31:09,002 INFO L226 Difference]: Without dead ends: 810 [2019-10-03 02:31:09,002 INFO L640 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-10-03 02:31:09,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2019-10-03 02:31:09,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 648. [2019-10-03 02:31:09,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-03 02:31:09,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 982 transitions. [2019-10-03 02:31:09,019 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 982 transitions. Word has length 23 [2019-10-03 02:31:09,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:09,021 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 982 transitions. [2019-10-03 02:31:09,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:09,021 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 982 transitions. [2019-10-03 02:31:09,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-03 02:31:09,023 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:09,023 INFO L411 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] [2019-10-03 02:31:09,023 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:09,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:09,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1796548700, now seen corresponding path program 1 times [2019-10-03 02:31:09,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:09,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:09,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:09,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:09,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:09,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:09,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:09,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:09,062 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:09,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:09,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:09,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:09,064 INFO L87 Difference]: Start difference. First operand 648 states and 982 transitions. Second operand 3 states. [2019-10-03 02:31:09,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:09,085 INFO L93 Difference]: Finished difference Result 874 states and 1303 transitions. [2019-10-03 02:31:09,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:09,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-03 02:31:09,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:09,090 INFO L225 Difference]: With dead ends: 874 [2019-10-03 02:31:09,090 INFO L226 Difference]: Without dead ends: 874 [2019-10-03 02:31:09,091 INFO L640 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-10-03 02:31:09,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-10-03 02:31:09,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 872. [2019-10-03 02:31:09,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-10-03 02:31:09,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1302 transitions. [2019-10-03 02:31:09,116 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1302 transitions. Word has length 23 [2019-10-03 02:31:09,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:09,116 INFO L475 AbstractCegarLoop]: Abstraction has 872 states and 1302 transitions. [2019-10-03 02:31:09,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:09,116 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1302 transitions. [2019-10-03 02:31:09,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-03 02:31:09,118 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:09,118 INFO L411 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-10-03 02:31:09,118 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:09,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:09,119 INFO L82 PathProgramCache]: Analyzing trace with hash 728586230, now seen corresponding path program 1 times [2019-10-03 02:31:09,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:09,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:09,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:09,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:09,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:09,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:09,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:09,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:09,144 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:09,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:09,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:09,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:09,145 INFO L87 Difference]: Start difference. First operand 872 states and 1302 transitions. Second operand 3 states. [2019-10-03 02:31:09,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:09,165 INFO L93 Difference]: Finished difference Result 890 states and 1303 transitions. [2019-10-03 02:31:09,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:09,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-03 02:31:09,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:09,171 INFO L225 Difference]: With dead ends: 890 [2019-10-03 02:31:09,171 INFO L226 Difference]: Without dead ends: 890 [2019-10-03 02:31:09,173 INFO L640 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-10-03 02:31:09,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2019-10-03 02:31:09,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 888. [2019-10-03 02:31:09,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2019-10-03 02:31:09,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1302 transitions. [2019-10-03 02:31:09,194 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1302 transitions. Word has length 24 [2019-10-03 02:31:09,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:09,194 INFO L475 AbstractCegarLoop]: Abstraction has 888 states and 1302 transitions. [2019-10-03 02:31:09,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:09,194 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1302 transitions. [2019-10-03 02:31:09,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-03 02:31:09,197 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:09,197 INFO L411 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-10-03 02:31:09,197 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:09,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:09,198 INFO L82 PathProgramCache]: Analyzing trace with hash 141780216, now seen corresponding path program 1 times [2019-10-03 02:31:09,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:09,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:09,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:09,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:09,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:09,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:09,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:09,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:09,224 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:09,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:09,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:09,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:09,225 INFO L87 Difference]: Start difference. First operand 888 states and 1302 transitions. Second operand 3 states. [2019-10-03 02:31:09,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:09,247 INFO L93 Difference]: Finished difference Result 1546 states and 2279 transitions. [2019-10-03 02:31:09,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:09,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-03 02:31:09,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:09,254 INFO L225 Difference]: With dead ends: 1546 [2019-10-03 02:31:09,254 INFO L226 Difference]: Without dead ends: 1546 [2019-10-03 02:31:09,255 INFO L640 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-10-03 02:31:09,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2019-10-03 02:31:09,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1288. [2019-10-03 02:31:09,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2019-10-03 02:31:09,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1830 transitions. [2019-10-03 02:31:09,287 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1830 transitions. Word has length 24 [2019-10-03 02:31:09,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:09,288 INFO L475 AbstractCegarLoop]: Abstraction has 1288 states and 1830 transitions. [2019-10-03 02:31:09,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:09,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1830 transitions. [2019-10-03 02:31:09,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-03 02:31:09,291 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:09,291 INFO L411 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-10-03 02:31:09,292 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:09,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:09,292 INFO L82 PathProgramCache]: Analyzing trace with hash 399945654, now seen corresponding path program 1 times [2019-10-03 02:31:09,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:09,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:09,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:09,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:09,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:09,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:09,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:09,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:09,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:09,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:09,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:09,324 INFO L87 Difference]: Start difference. First operand 1288 states and 1830 transitions. Second operand 3 states. [2019-10-03 02:31:09,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:09,348 INFO L93 Difference]: Finished difference Result 1706 states and 2375 transitions. [2019-10-03 02:31:09,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:09,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-03 02:31:09,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:09,357 INFO L225 Difference]: With dead ends: 1706 [2019-10-03 02:31:09,358 INFO L226 Difference]: Without dead ends: 1706 [2019-10-03 02:31:09,358 INFO L640 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-10-03 02:31:09,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2019-10-03 02:31:09,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1704. [2019-10-03 02:31:09,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-10-03 02:31:09,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2374 transitions. [2019-10-03 02:31:09,405 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2374 transitions. Word has length 24 [2019-10-03 02:31:09,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:09,405 INFO L475 AbstractCegarLoop]: Abstraction has 1704 states and 2374 transitions. [2019-10-03 02:31:09,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:09,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2374 transitions. [2019-10-03 02:31:09,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-03 02:31:09,409 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:09,409 INFO L411 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-10-03 02:31:09,409 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:09,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:09,410 INFO L82 PathProgramCache]: Analyzing trace with hash 100434809, now seen corresponding path program 1 times [2019-10-03 02:31:09,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:09,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:09,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:09,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:09,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:09,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:09,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:09,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:09,450 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:09,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:09,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:09,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:09,451 INFO L87 Difference]: Start difference. First operand 1704 states and 2374 transitions. Second operand 3 states. [2019-10-03 02:31:09,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:09,482 INFO L93 Difference]: Finished difference Result 1738 states and 2375 transitions. [2019-10-03 02:31:09,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:09,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-03 02:31:09,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:09,490 INFO L225 Difference]: With dead ends: 1738 [2019-10-03 02:31:09,490 INFO L226 Difference]: Without dead ends: 1738 [2019-10-03 02:31:09,491 INFO L640 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-10-03 02:31:09,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-10-03 02:31:09,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1736. [2019-10-03 02:31:09,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1736 states. [2019-10-03 02:31:09,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2374 transitions. [2019-10-03 02:31:09,529 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2374 transitions. Word has length 25 [2019-10-03 02:31:09,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:09,530 INFO L475 AbstractCegarLoop]: Abstraction has 1736 states and 2374 transitions. [2019-10-03 02:31:09,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:09,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2374 transitions. [2019-10-03 02:31:09,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-03 02:31:09,533 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:09,533 INFO L411 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-10-03 02:31:09,533 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:09,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:09,533 INFO L82 PathProgramCache]: Analyzing trace with hash -486371205, now seen corresponding path program 1 times [2019-10-03 02:31:09,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:09,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:09,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:09,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:09,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:09,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:09,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:09,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:09,555 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:09,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:09,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:09,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:09,556 INFO L87 Difference]: Start difference. First operand 1736 states and 2374 transitions. Second operand 3 states. [2019-10-03 02:31:09,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:09,584 INFO L93 Difference]: Finished difference Result 2954 states and 4039 transitions. [2019-10-03 02:31:09,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:09,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-03 02:31:09,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:09,600 INFO L225 Difference]: With dead ends: 2954 [2019-10-03 02:31:09,601 INFO L226 Difference]: Without dead ends: 2954 [2019-10-03 02:31:09,602 INFO L640 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-10-03 02:31:09,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2019-10-03 02:31:09,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2568. [2019-10-03 02:31:09,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2568 states. [2019-10-03 02:31:09,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 3398 transitions. [2019-10-03 02:31:09,686 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 3398 transitions. Word has length 25 [2019-10-03 02:31:09,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:09,686 INFO L475 AbstractCegarLoop]: Abstraction has 2568 states and 3398 transitions. [2019-10-03 02:31:09,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:09,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3398 transitions. [2019-10-03 02:31:09,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-03 02:31:09,691 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:09,692 INFO L411 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-10-03 02:31:09,692 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:09,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:09,693 INFO L82 PathProgramCache]: Analyzing trace with hash -228205767, now seen corresponding path program 1 times [2019-10-03 02:31:09,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:09,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:09,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:09,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:09,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:09,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:09,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:09,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:09,745 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:09,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:09,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:09,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:09,747 INFO L87 Difference]: Start difference. First operand 2568 states and 3398 transitions. Second operand 3 states. [2019-10-03 02:31:09,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:09,790 INFO L93 Difference]: Finished difference Result 3338 states and 4295 transitions. [2019-10-03 02:31:09,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:09,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-03 02:31:09,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:09,812 INFO L225 Difference]: With dead ends: 3338 [2019-10-03 02:31:09,812 INFO L226 Difference]: Without dead ends: 3338 [2019-10-03 02:31:09,813 INFO L640 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-10-03 02:31:09,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2019-10-03 02:31:09,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3336. [2019-10-03 02:31:09,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2019-10-03 02:31:09,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4294 transitions. [2019-10-03 02:31:09,925 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4294 transitions. Word has length 25 [2019-10-03 02:31:09,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:09,925 INFO L475 AbstractCegarLoop]: Abstraction has 3336 states and 4294 transitions. [2019-10-03 02:31:09,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:09,925 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4294 transitions. [2019-10-03 02:31:09,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-03 02:31:09,932 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:09,932 INFO L411 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-10-03 02:31:09,933 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:09,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:09,933 INFO L82 PathProgramCache]: Analyzing trace with hash 2102577579, now seen corresponding path program 1 times [2019-10-03 02:31:09,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:09,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:09,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:09,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:09,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:09,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:09,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:09,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:09,956 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:09,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:09,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:09,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:09,957 INFO L87 Difference]: Start difference. First operand 3336 states and 4294 transitions. Second operand 3 states. [2019-10-03 02:31:09,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:09,998 INFO L93 Difference]: Finished difference Result 3402 states and 4295 transitions. [2019-10-03 02:31:09,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:09,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-03 02:31:09,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:10,018 INFO L225 Difference]: With dead ends: 3402 [2019-10-03 02:31:10,018 INFO L226 Difference]: Without dead ends: 3402 [2019-10-03 02:31:10,019 INFO L640 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-10-03 02:31:10,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2019-10-03 02:31:10,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3400. [2019-10-03 02:31:10,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3400 states. [2019-10-03 02:31:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 4294 transitions. [2019-10-03 02:31:10,111 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 4294 transitions. Word has length 26 [2019-10-03 02:31:10,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:10,112 INFO L475 AbstractCegarLoop]: Abstraction has 3400 states and 4294 transitions. [2019-10-03 02:31:10,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:10,112 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4294 transitions. [2019-10-03 02:31:10,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-03 02:31:10,117 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:10,117 INFO L411 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-10-03 02:31:10,117 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:10,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:10,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1515771565, now seen corresponding path program 1 times [2019-10-03 02:31:10,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:10,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:10,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:10,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:10,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:10,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:10,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:10,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:10,143 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:10,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:10,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:10,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:10,144 INFO L87 Difference]: Start difference. First operand 3400 states and 4294 transitions. Second operand 3 states. [2019-10-03 02:31:10,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:10,193 INFO L93 Difference]: Finished difference Result 6538 states and 7815 transitions. [2019-10-03 02:31:10,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:10,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-03 02:31:10,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:10,244 INFO L225 Difference]: With dead ends: 6538 [2019-10-03 02:31:10,244 INFO L226 Difference]: Without dead ends: 6538 [2019-10-03 02:31:10,245 INFO L640 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-10-03 02:31:10,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6538 states. [2019-10-03 02:31:10,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6538 to 6536. [2019-10-03 02:31:10,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2019-10-03 02:31:10,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7814 transitions. [2019-10-03 02:31:10,423 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7814 transitions. Word has length 26 [2019-10-03 02:31:10,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:10,424 INFO L475 AbstractCegarLoop]: Abstraction has 6536 states and 7814 transitions. [2019-10-03 02:31:10,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:10,424 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7814 transitions. [2019-10-03 02:31:10,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-03 02:31:10,433 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:10,433 INFO L411 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-10-03 02:31:10,434 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:10,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:10,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1257606127, now seen corresponding path program 1 times [2019-10-03 02:31:10,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:10,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:10,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:10,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:10,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:10,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:10,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:10,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:10,457 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:10,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:10,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:10,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:10,458 INFO L87 Difference]: Start difference. First operand 6536 states and 7814 transitions. Second operand 3 states. [2019-10-03 02:31:10,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:10,501 INFO L93 Difference]: Finished difference Result 7050 states and 8455 transitions. [2019-10-03 02:31:10,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:10,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-03 02:31:10,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:10,517 INFO L225 Difference]: With dead ends: 7050 [2019-10-03 02:31:10,517 INFO L226 Difference]: Without dead ends: 7050 [2019-10-03 02:31:10,518 INFO L640 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-10-03 02:31:10,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2019-10-03 02:31:10,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 6536. [2019-10-03 02:31:10,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2019-10-03 02:31:10,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7686 transitions. [2019-10-03 02:31:10,646 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7686 transitions. Word has length 26 [2019-10-03 02:31:10,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:10,646 INFO L475 AbstractCegarLoop]: Abstraction has 6536 states and 7686 transitions. [2019-10-03 02:31:10,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:10,646 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7686 transitions. [2019-10-03 02:31:10,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-03 02:31:10,658 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:10,658 INFO L411 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-10-03 02:31:10,658 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:10,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:10,659 INFO L82 PathProgramCache]: Analyzing trace with hash -255505650, now seen corresponding path program 1 times [2019-10-03 02:31:10,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:10,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:10,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:10,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:10,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:10,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:10,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:10,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:10,680 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:10,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:10,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:10,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:10,682 INFO L87 Difference]: Start difference. First operand 6536 states and 7686 transitions. Second operand 3 states. [2019-10-03 02:31:10,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:10,729 INFO L93 Difference]: Finished difference Result 10632 states and 12166 transitions. [2019-10-03 02:31:10,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:10,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-03 02:31:10,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:10,756 INFO L225 Difference]: With dead ends: 10632 [2019-10-03 02:31:10,756 INFO L226 Difference]: Without dead ends: 10632 [2019-10-03 02:31:10,761 INFO L640 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-10-03 02:31:10,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10632 states. [2019-10-03 02:31:10,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10632 to 10120. [2019-10-03 02:31:10,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10120 states. [2019-10-03 02:31:10,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10120 states to 10120 states and 11654 transitions. [2019-10-03 02:31:10,994 INFO L78 Accepts]: Start accepts. Automaton has 10120 states and 11654 transitions. Word has length 27 [2019-10-03 02:31:10,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:10,995 INFO L475 AbstractCegarLoop]: Abstraction has 10120 states and 11654 transitions. [2019-10-03 02:31:10,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:10,995 INFO L276 IsEmpty]: Start isEmpty. Operand 10120 states and 11654 transitions. [2019-10-03 02:31:11,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-03 02:31:11,012 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:11,012 INFO L411 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-10-03 02:31:11,012 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:11,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:11,013 INFO L82 PathProgramCache]: Analyzing trace with hash 2659788, now seen corresponding path program 1 times [2019-10-03 02:31:11,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:11,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:11,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:11,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:11,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:11,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:11,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:11,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:11,034 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:11,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:11,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:11,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:11,035 INFO L87 Difference]: Start difference. First operand 10120 states and 11654 transitions. Second operand 3 states. [2019-10-03 02:31:11,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:11,091 INFO L93 Difference]: Finished difference Result 12678 states and 13829 transitions. [2019-10-03 02:31:11,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:11,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-03 02:31:11,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:11,092 INFO L225 Difference]: With dead ends: 12678 [2019-10-03 02:31:11,093 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:31:11,093 INFO L640 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-10-03 02:31:11,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:31:11,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:31:11,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:31:11,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:31:11,094 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2019-10-03 02:31:11,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:11,094 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:31:11,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:11,094 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:31:11,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:31:11,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:31:11 BoogieIcfgContainer [2019-10-03 02:31:11,102 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:31:11,106 INFO L168 Benchmark]: Toolchain (without parser) took 4575.81 ms. Allocated memory was 131.6 MB in the beginning and 337.1 MB in the end (delta: 205.5 MB). Free memory was 87.2 MB in the beginning and 233.4 MB in the end (delta: -146.3 MB). Peak memory consumption was 59.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:31:11,107 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 131.6 MB. Free memory was 105.8 MB in the beginning and 105.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:31:11,109 INFO L168 Benchmark]: CACSL2BoogieTranslator took 411.09 ms. Allocated memory was 131.6 MB in the beginning and 199.2 MB in the end (delta: 67.6 MB). Free memory was 86.9 MB in the beginning and 175.2 MB in the end (delta: -88.3 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:31:11,110 INFO L168 Benchmark]: Boogie Preprocessor took 35.58 ms. Allocated memory is still 199.2 MB. Free memory was 175.2 MB in the beginning and 173.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-10-03 02:31:11,113 INFO L168 Benchmark]: RCFGBuilder took 356.99 ms. Allocated memory is still 199.2 MB. Free memory was 173.3 MB in the beginning and 155.0 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. [2019-10-03 02:31:11,114 INFO L168 Benchmark]: TraceAbstraction took 3766.63 ms. Allocated memory was 199.2 MB in the beginning and 337.1 MB in the end (delta: 137.9 MB). Free memory was 155.0 MB in the beginning and 233.4 MB in the end (delta: -78.5 MB). Peak memory consumption was 59.4 MB. Max. memory is 7.1 GB. [2019-10-03 02:31:11,123 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 131.6 MB. Free memory was 105.8 MB in the beginning and 105.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 411.09 ms. Allocated memory was 131.6 MB in the beginning and 199.2 MB in the end (delta: 67.6 MB). Free memory was 86.9 MB in the beginning and 175.2 MB in the end (delta: -88.3 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.58 ms. Allocated memory is still 199.2 MB. Free memory was 175.2 MB in the beginning and 173.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 356.99 ms. Allocated memory is still 199.2 MB. Free memory was 173.3 MB in the beginning and 155.0 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3766.63 ms. Allocated memory was 199.2 MB in the beginning and 337.1 MB in the end (delta: 137.9 MB). Free memory was 155.0 MB in the beginning and 233.4 MB in the end (delta: -78.5 MB). Peak memory consumption was 59.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: 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, 41 locations, 1 error locations. SAFE Result, 3.6s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1937 SDtfs, 926 SDslu, 1314 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10120occurred in iteration=24, 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: 1.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 550 ConstructedInterpolants, 0 QuantifiedInterpolants, 23930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...