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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/locks/test_locks_10.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:04:10,470 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:04:10,473 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:04:10,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:04:10,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:04:10,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:04:10,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:04:10,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:04:10,490 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:04:10,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:04:10,492 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:04:10,493 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:04:10,493 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:04:10,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:04:10,495 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:04:10,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:04:10,497 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:04:10,498 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:04:10,500 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:04:10,501 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:04:10,503 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:04:10,504 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:04:10,505 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:04:10,506 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:04:10,508 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:04:10,508 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:04:10,508 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:04:10,509 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:04:10,510 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:04:10,510 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:04:10,511 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:04:10,511 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:04:10,512 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:04:10,513 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:04:10,514 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:04:10,514 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:04:10,515 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:04:10,515 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:04:10,515 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:04:10,516 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:04:10,517 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:04:10,517 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:04:10,538 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:04:10,538 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:04:10,540 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:04:10,541 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:04:10,541 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:04:10,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:04:10,541 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:04:10,541 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:04:10,542 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:04:10,542 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:04:10,543 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:04:10,543 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:04:10,543 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:04:10,544 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:04:10,544 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:04:10,544 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:04:10,544 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:04:10,544 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:04:10,544 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:04:10,545 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:04:10,545 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:04:10,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:04:10,546 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:04:10,546 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:04:10,546 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:04:10,547 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:04:10,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:04:10,547 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:04:10,547 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:04:10,836 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:04:10,850 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:04:10,854 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:04:10,855 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:04:10,856 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:04:10,856 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_10.c [2019-10-15 01:04:10,916 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a797d3e7d/305b1ce014654a03b986bbee0a21eb8d/FLAG2148bb32d [2019-10-15 01:04:11,303 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:04:11,304 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10.c [2019-10-15 01:04:11,312 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a797d3e7d/305b1ce014654a03b986bbee0a21eb8d/FLAG2148bb32d [2019-10-15 01:04:11,729 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a797d3e7d/305b1ce014654a03b986bbee0a21eb8d [2019-10-15 01:04:11,737 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:04:11,739 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:04:11,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:04:11,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:04:11,743 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:04:11,744 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:04:11" (1/1) ... [2019-10-15 01:04:11,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fbcd6a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:11, skipping insertion in model container [2019-10-15 01:04:11,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:04:11" (1/1) ... [2019-10-15 01:04:11,754 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:04:11,777 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:04:11,942 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:04:11,946 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:04:11,969 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:04:12,064 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:04:12,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:12 WrapperNode [2019-10-15 01:04:12,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:04:12,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:04:12,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:04:12,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:04:12,075 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:12" (1/1) ... [2019-10-15 01:04:12,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:12" (1/1) ... [2019-10-15 01:04:12,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:12" (1/1) ... [2019-10-15 01:04:12,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:12" (1/1) ... [2019-10-15 01:04:12,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:12" (1/1) ... [2019-10-15 01:04:12,096 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:12" (1/1) ... [2019-10-15 01:04:12,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:12" (1/1) ... [2019-10-15 01:04:12,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:04:12,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:04:12,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:04:12,101 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:04:12,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:12" (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-15 01:04:12,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:04:12,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:04:12,167 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:04:12,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:04:12,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:04:12,168 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:04:12,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:04:12,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:04:12,545 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:04:12,545 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:04:12,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:04:12 BoogieIcfgContainer [2019-10-15 01:04:12,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:04:12,547 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:04:12,548 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:04:12,552 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:04:12,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:04:11" (1/3) ... [2019-10-15 01:04:12,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78de9a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:04:12, skipping insertion in model container [2019-10-15 01:04:12,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:12" (2/3) ... [2019-10-15 01:04:12,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78de9a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:04:12, skipping insertion in model container [2019-10-15 01:04:12,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:04:12" (3/3) ... [2019-10-15 01:04:12,556 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2019-10-15 01:04:12,568 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:04:12,577 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:04:12,591 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:04:12,623 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:04:12,623 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:04:12,624 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:04:12,624 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:04:12,624 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:04:12,624 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:04:12,624 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:04:12,624 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:04:12,668 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-10-15 01:04:12,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 01:04:12,682 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:12,686 INFO L380 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-15 01:04:12,688 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:12,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:12,694 INFO L82 PathProgramCache]: Analyzing trace with hash -917347053, now seen corresponding path program 1 times [2019-10-15 01:04:12,704 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:12,704 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228835804] [2019-10-15 01:04:12,705 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:12,705 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:12,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:12,958 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-15 01:04:12,959 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228835804] [2019-10-15 01:04:12,960 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:12,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:12,960 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362783249] [2019-10-15 01:04:12,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:12,966 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:12,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:12,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:12,983 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-10-15 01:04:13,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:13,036 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2019-10-15 01:04:13,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:13,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-15 01:04:13,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:13,049 INFO L225 Difference]: With dead ends: 87 [2019-10-15 01:04:13,049 INFO L226 Difference]: Without dead ends: 72 [2019-10-15 01:04:13,052 INFO L600 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-15 01:04:13,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-15 01:04:13,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-10-15 01:04:13,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-15 01:04:13,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 89 transitions. [2019-10-15 01:04:13,116 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 89 transitions. Word has length 20 [2019-10-15 01:04:13,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:13,117 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 89 transitions. [2019-10-15 01:04:13,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:13,117 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 89 transitions. [2019-10-15 01:04:13,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 01:04:13,118 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:13,118 INFO L380 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-15 01:04:13,119 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:13,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:13,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1504153067, now seen corresponding path program 1 times [2019-10-15 01:04:13,120 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:13,120 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170465177] [2019-10-15 01:04:13,120 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:13,120 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:13,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:13,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:13,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170465177] [2019-10-15 01:04:13,217 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:13,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:13,218 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323670834] [2019-10-15 01:04:13,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:13,220 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:13,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:13,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:13,221 INFO L87 Difference]: Start difference. First operand 50 states and 89 transitions. Second operand 3 states. [2019-10-15 01:04:13,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:13,253 INFO L93 Difference]: Finished difference Result 117 states and 212 transitions. [2019-10-15 01:04:13,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:13,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-15 01:04:13,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:13,256 INFO L225 Difference]: With dead ends: 117 [2019-10-15 01:04:13,256 INFO L226 Difference]: Without dead ends: 72 [2019-10-15 01:04:13,257 INFO L600 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-15 01:04:13,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-15 01:04:13,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-10-15 01:04:13,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-15 01:04:13,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 125 transitions. [2019-10-15 01:04:13,269 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 125 transitions. Word has length 20 [2019-10-15 01:04:13,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:13,269 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 125 transitions. [2019-10-15 01:04:13,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:13,270 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 125 transitions. [2019-10-15 01:04:13,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 01:04:13,271 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:13,271 INFO L380 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-15 01:04:13,271 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:13,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:13,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1627225809, now seen corresponding path program 1 times [2019-10-15 01:04:13,272 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:13,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879935236] [2019-10-15 01:04:13,273 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:13,273 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:13,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:13,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:13,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879935236] [2019-10-15 01:04:13,313 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:13,313 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:13,314 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659735738] [2019-10-15 01:04:13,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:13,314 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:13,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:13,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:13,315 INFO L87 Difference]: Start difference. First operand 70 states and 125 transitions. Second operand 3 states. [2019-10-15 01:04:13,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:13,361 INFO L93 Difference]: Finished difference Result 108 states and 189 transitions. [2019-10-15 01:04:13,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:13,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-15 01:04:13,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:13,363 INFO L225 Difference]: With dead ends: 108 [2019-10-15 01:04:13,363 INFO L226 Difference]: Without dead ends: 75 [2019-10-15 01:04:13,364 INFO L600 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-15 01:04:13,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-15 01:04:13,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-10-15 01:04:13,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-15 01:04:13,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 127 transitions. [2019-10-15 01:04:13,378 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 127 transitions. Word has length 21 [2019-10-15 01:04:13,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:13,378 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 127 transitions. [2019-10-15 01:04:13,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:13,379 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2019-10-15 01:04:13,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 01:04:13,380 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:13,380 INFO L380 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-15 01:04:13,381 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:13,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:13,381 INFO L82 PathProgramCache]: Analyzing trace with hash 616108559, now seen corresponding path program 1 times [2019-10-15 01:04:13,382 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:13,382 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121098457] [2019-10-15 01:04:13,382 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:13,382 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:13,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:13,431 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-15 01:04:13,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121098457] [2019-10-15 01:04:13,432 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:13,432 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:13,432 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391626656] [2019-10-15 01:04:13,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:13,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:13,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:13,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:13,434 INFO L87 Difference]: Start difference. First operand 73 states and 127 transitions. Second operand 3 states. [2019-10-15 01:04:13,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:13,454 INFO L93 Difference]: Finished difference Result 136 states and 240 transitions. [2019-10-15 01:04:13,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:13,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-15 01:04:13,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:13,457 INFO L225 Difference]: With dead ends: 136 [2019-10-15 01:04:13,457 INFO L226 Difference]: Without dead ends: 134 [2019-10-15 01:04:13,458 INFO L600 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-15 01:04:13,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-10-15 01:04:13,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2019-10-15 01:04:13,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-15 01:04:13,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 168 transitions. [2019-10-15 01:04:13,476 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 168 transitions. Word has length 21 [2019-10-15 01:04:13,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:13,478 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 168 transitions. [2019-10-15 01:04:13,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:13,478 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 168 transitions. [2019-10-15 01:04:13,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 01:04:13,480 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:13,480 INFO L380 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-15 01:04:13,482 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:13,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:13,482 INFO L82 PathProgramCache]: Analyzing trace with hash 29302545, now seen corresponding path program 1 times [2019-10-15 01:04:13,482 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:13,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463825166] [2019-10-15 01:04:13,483 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:13,483 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:13,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:13,557 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-15 01:04:13,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463825166] [2019-10-15 01:04:13,558 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:13,558 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:13,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564464193] [2019-10-15 01:04:13,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:13,560 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:13,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:13,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:13,560 INFO L87 Difference]: Start difference. First operand 96 states and 168 transitions. Second operand 3 states. [2019-10-15 01:04:13,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:13,597 INFO L93 Difference]: Finished difference Result 224 states and 398 transitions. [2019-10-15 01:04:13,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:13,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-15 01:04:13,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:13,600 INFO L225 Difference]: With dead ends: 224 [2019-10-15 01:04:13,602 INFO L226 Difference]: Without dead ends: 136 [2019-10-15 01:04:13,603 INFO L600 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-15 01:04:13,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-10-15 01:04:13,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2019-10-15 01:04:13,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-10-15 01:04:13,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 234 transitions. [2019-10-15 01:04:13,622 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 234 transitions. Word has length 21 [2019-10-15 01:04:13,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:13,623 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 234 transitions. [2019-10-15 01:04:13,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:13,623 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 234 transitions. [2019-10-15 01:04:13,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 01:04:13,624 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:13,625 INFO L380 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-15 01:04:13,625 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:13,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:13,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1919709866, now seen corresponding path program 1 times [2019-10-15 01:04:13,626 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:13,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343040039] [2019-10-15 01:04:13,626 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:13,626 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:13,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:13,680 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-15 01:04:13,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343040039] [2019-10-15 01:04:13,681 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:13,681 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:13,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351826180] [2019-10-15 01:04:13,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:13,682 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:13,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:13,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:13,683 INFO L87 Difference]: Start difference. First operand 134 states and 234 transitions. Second operand 3 states. [2019-10-15 01:04:13,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:13,701 INFO L93 Difference]: Finished difference Result 201 states and 349 transitions. [2019-10-15 01:04:13,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:13,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-15 01:04:13,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:13,703 INFO L225 Difference]: With dead ends: 201 [2019-10-15 01:04:13,703 INFO L226 Difference]: Without dead ends: 138 [2019-10-15 01:04:13,704 INFO L600 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-15 01:04:13,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-10-15 01:04:13,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-10-15 01:04:13,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-15 01:04:13,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 234 transitions. [2019-10-15 01:04:13,723 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 234 transitions. Word has length 22 [2019-10-15 01:04:13,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:13,728 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 234 transitions. [2019-10-15 01:04:13,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:13,729 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 234 transitions. [2019-10-15 01:04:13,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 01:04:13,732 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:13,732 INFO L380 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-15 01:04:13,733 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:13,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:13,734 INFO L82 PathProgramCache]: Analyzing trace with hash 908592616, now seen corresponding path program 1 times [2019-10-15 01:04:13,734 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:13,735 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987550823] [2019-10-15 01:04:13,735 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:13,737 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:13,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:13,798 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-15 01:04:13,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987550823] [2019-10-15 01:04:13,799 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:13,799 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:13,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881703675] [2019-10-15 01:04:13,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:13,801 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:13,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:13,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:13,801 INFO L87 Difference]: Start difference. First operand 136 states and 234 transitions. Second operand 3 states. [2019-10-15 01:04:13,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:13,829 INFO L93 Difference]: Finished difference Result 252 states and 440 transitions. [2019-10-15 01:04:13,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:13,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-15 01:04:13,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:13,831 INFO L225 Difference]: With dead ends: 252 [2019-10-15 01:04:13,831 INFO L226 Difference]: Without dead ends: 250 [2019-10-15 01:04:13,832 INFO L600 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-15 01:04:13,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-10-15 01:04:13,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 184. [2019-10-15 01:04:13,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-10-15 01:04:13,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 314 transitions. [2019-10-15 01:04:13,859 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 314 transitions. Word has length 22 [2019-10-15 01:04:13,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:13,860 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 314 transitions. [2019-10-15 01:04:13,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:13,860 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 314 transitions. [2019-10-15 01:04:13,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 01:04:13,861 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:13,862 INFO L380 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-15 01:04:13,862 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:13,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:13,862 INFO L82 PathProgramCache]: Analyzing trace with hash 321786602, now seen corresponding path program 1 times [2019-10-15 01:04:13,863 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:13,863 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359551087] [2019-10-15 01:04:13,863 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:13,863 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:13,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:13,913 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-15 01:04:13,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359551087] [2019-10-15 01:04:13,914 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:13,914 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:13,914 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163331006] [2019-10-15 01:04:13,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:13,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:13,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:13,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:13,916 INFO L87 Difference]: Start difference. First operand 184 states and 314 transitions. Second operand 3 states. [2019-10-15 01:04:13,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:13,952 INFO L93 Difference]: Finished difference Result 432 states and 744 transitions. [2019-10-15 01:04:13,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:13,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-15 01:04:13,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:13,954 INFO L225 Difference]: With dead ends: 432 [2019-10-15 01:04:13,955 INFO L226 Difference]: Without dead ends: 258 [2019-10-15 01:04:13,956 INFO L600 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-15 01:04:13,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-10-15 01:04:13,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-10-15 01:04:13,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-10-15 01:04:13,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 434 transitions. [2019-10-15 01:04:13,979 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 434 transitions. Word has length 22 [2019-10-15 01:04:13,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:13,980 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 434 transitions. [2019-10-15 01:04:13,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:13,980 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 434 transitions. [2019-10-15 01:04:13,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-15 01:04:13,981 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:13,982 INFO L380 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-15 01:04:13,982 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:13,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:13,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1898185914, now seen corresponding path program 1 times [2019-10-15 01:04:13,983 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:13,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956039013] [2019-10-15 01:04:13,984 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:13,985 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:13,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:14,024 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-15 01:04:14,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956039013] [2019-10-15 01:04:14,025 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:14,025 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:14,025 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837608181] [2019-10-15 01:04:14,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:14,026 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:14,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:14,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:14,027 INFO L87 Difference]: Start difference. First operand 256 states and 434 transitions. Second operand 3 states. [2019-10-15 01:04:14,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:14,059 INFO L93 Difference]: Finished difference Result 384 states and 648 transitions. [2019-10-15 01:04:14,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:14,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-15 01:04:14,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:14,062 INFO L225 Difference]: With dead ends: 384 [2019-10-15 01:04:14,062 INFO L226 Difference]: Without dead ends: 262 [2019-10-15 01:04:14,063 INFO L600 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-15 01:04:14,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-10-15 01:04:14,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2019-10-15 01:04:14,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-15 01:04:14,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 434 transitions. [2019-10-15 01:04:14,086 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 434 transitions. Word has length 23 [2019-10-15 01:04:14,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:14,087 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 434 transitions. [2019-10-15 01:04:14,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:14,087 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 434 transitions. [2019-10-15 01:04:14,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-15 01:04:14,088 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:14,089 INFO L380 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-15 01:04:14,089 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:14,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:14,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1385664132, now seen corresponding path program 1 times [2019-10-15 01:04:14,091 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:14,091 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572635560] [2019-10-15 01:04:14,091 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,094 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:14,131 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-15 01:04:14,131 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572635560] [2019-10-15 01:04:14,132 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:14,132 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:14,135 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211006647] [2019-10-15 01:04:14,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:14,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:14,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:14,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:14,136 INFO L87 Difference]: Start difference. First operand 260 states and 434 transitions. Second operand 3 states. [2019-10-15 01:04:14,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:14,160 INFO L93 Difference]: Finished difference Result 476 states and 808 transitions. [2019-10-15 01:04:14,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:14,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-15 01:04:14,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:14,165 INFO L225 Difference]: With dead ends: 476 [2019-10-15 01:04:14,165 INFO L226 Difference]: Without dead ends: 474 [2019-10-15 01:04:14,168 INFO L600 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-15 01:04:14,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-10-15 01:04:14,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 360. [2019-10-15 01:04:14,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-10-15 01:04:14,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 590 transitions. [2019-10-15 01:04:14,184 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 590 transitions. Word has length 23 [2019-10-15 01:04:14,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:14,184 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 590 transitions. [2019-10-15 01:04:14,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:14,185 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 590 transitions. [2019-10-15 01:04:14,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-15 01:04:14,186 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:14,186 INFO L380 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-15 01:04:14,186 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:14,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:14,187 INFO L82 PathProgramCache]: Analyzing trace with hash 798858118, now seen corresponding path program 1 times [2019-10-15 01:04:14,187 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:14,187 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809937355] [2019-10-15 01:04:14,187 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,187 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:14,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:14,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809937355] [2019-10-15 01:04:14,217 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:14,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:14,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125885684] [2019-10-15 01:04:14,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:14,218 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:14,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:14,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:14,219 INFO L87 Difference]: Start difference. First operand 360 states and 590 transitions. Second operand 3 states. [2019-10-15 01:04:14,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:14,266 INFO L93 Difference]: Finished difference Result 844 states and 1392 transitions. [2019-10-15 01:04:14,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:14,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-15 01:04:14,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:14,269 INFO L225 Difference]: With dead ends: 844 [2019-10-15 01:04:14,269 INFO L226 Difference]: Without dead ends: 498 [2019-10-15 01:04:14,271 INFO L600 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-15 01:04:14,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-10-15 01:04:14,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2019-10-15 01:04:14,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-10-15 01:04:14,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 806 transitions. [2019-10-15 01:04:14,298 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 806 transitions. Word has length 23 [2019-10-15 01:04:14,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:14,298 INFO L462 AbstractCegarLoop]: Abstraction has 496 states and 806 transitions. [2019-10-15 01:04:14,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:14,299 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 806 transitions. [2019-10-15 01:04:14,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:04:14,302 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:14,302 INFO L380 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-15 01:04:14,303 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:14,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:14,303 INFO L82 PathProgramCache]: Analyzing trace with hash 6129535, now seen corresponding path program 1 times [2019-10-15 01:04:14,303 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:14,304 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499170332] [2019-10-15 01:04:14,304 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,304 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:14,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-15 01:04:14,334 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499170332] [2019-10-15 01:04:14,334 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:14,334 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:14,335 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273780062] [2019-10-15 01:04:14,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:14,335 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:14,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:14,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:14,336 INFO L87 Difference]: Start difference. First operand 496 states and 806 transitions. Second operand 3 states. [2019-10-15 01:04:14,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:14,358 INFO L93 Difference]: Finished difference Result 744 states and 1204 transitions. [2019-10-15 01:04:14,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:14,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-15 01:04:14,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:14,363 INFO L225 Difference]: With dead ends: 744 [2019-10-15 01:04:14,363 INFO L226 Difference]: Without dead ends: 506 [2019-10-15 01:04:14,364 INFO L600 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-15 01:04:14,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-10-15 01:04:14,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2019-10-15 01:04:14,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-10-15 01:04:14,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 806 transitions. [2019-10-15 01:04:14,387 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 806 transitions. Word has length 24 [2019-10-15 01:04:14,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:14,388 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 806 transitions. [2019-10-15 01:04:14,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:14,388 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 806 transitions. [2019-10-15 01:04:14,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:04:14,389 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:14,390 INFO L380 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-15 01:04:14,390 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:14,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:14,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1004987715, now seen corresponding path program 1 times [2019-10-15 01:04:14,391 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:14,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837951056] [2019-10-15 01:04:14,392 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,392 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:14,426 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-15 01:04:14,427 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837951056] [2019-10-15 01:04:14,427 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:14,427 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:14,427 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212786599] [2019-10-15 01:04:14,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:14,428 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:14,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:14,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:14,429 INFO L87 Difference]: Start difference. First operand 504 states and 806 transitions. Second operand 3 states. [2019-10-15 01:04:14,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:14,461 INFO L93 Difference]: Finished difference Result 908 states and 1480 transitions. [2019-10-15 01:04:14,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:14,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-15 01:04:14,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:14,471 INFO L225 Difference]: With dead ends: 908 [2019-10-15 01:04:14,471 INFO L226 Difference]: Without dead ends: 906 [2019-10-15 01:04:14,472 INFO L600 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-15 01:04:14,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2019-10-15 01:04:14,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 712. [2019-10-15 01:04:14,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-10-15 01:04:14,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1110 transitions. [2019-10-15 01:04:14,496 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1110 transitions. Word has length 24 [2019-10-15 01:04:14,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:14,497 INFO L462 AbstractCegarLoop]: Abstraction has 712 states and 1110 transitions. [2019-10-15 01:04:14,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:14,497 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1110 transitions. [2019-10-15 01:04:14,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:04:14,499 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:14,499 INFO L380 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-15 01:04:14,500 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:14,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:14,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1591793729, now seen corresponding path program 1 times [2019-10-15 01:04:14,500 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:14,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804040723] [2019-10-15 01:04:14,501 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,501 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:14,528 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-15 01:04:14,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804040723] [2019-10-15 01:04:14,529 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:14,529 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:14,529 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262549263] [2019-10-15 01:04:14,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:14,530 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:14,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:14,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:14,530 INFO L87 Difference]: Start difference. First operand 712 states and 1110 transitions. Second operand 3 states. [2019-10-15 01:04:14,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:14,557 INFO L93 Difference]: Finished difference Result 1660 states and 2600 transitions. [2019-10-15 01:04:14,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:14,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-15 01:04:14,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:14,563 INFO L225 Difference]: With dead ends: 1660 [2019-10-15 01:04:14,563 INFO L226 Difference]: Without dead ends: 970 [2019-10-15 01:04:14,565 INFO L600 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-15 01:04:14,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2019-10-15 01:04:14,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 968. [2019-10-15 01:04:14,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-10-15 01:04:14,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1494 transitions. [2019-10-15 01:04:14,596 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1494 transitions. Word has length 24 [2019-10-15 01:04:14,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:14,597 INFO L462 AbstractCegarLoop]: Abstraction has 968 states and 1494 transitions. [2019-10-15 01:04:14,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:14,597 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1494 transitions. [2019-10-15 01:04:14,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:04:14,599 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:14,599 INFO L380 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-15 01:04:14,599 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:14,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:14,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1089633349, now seen corresponding path program 1 times [2019-10-15 01:04:14,600 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:14,600 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026497581] [2019-10-15 01:04:14,601 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,601 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:14,623 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-15 01:04:14,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026497581] [2019-10-15 01:04:14,624 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:14,624 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:14,624 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9072401] [2019-10-15 01:04:14,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:14,625 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:14,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:14,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:14,626 INFO L87 Difference]: Start difference. First operand 968 states and 1494 transitions. Second operand 3 states. [2019-10-15 01:04:14,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:14,656 INFO L93 Difference]: Finished difference Result 1452 states and 2232 transitions. [2019-10-15 01:04:14,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:14,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 01:04:14,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:14,661 INFO L225 Difference]: With dead ends: 1452 [2019-10-15 01:04:14,662 INFO L226 Difference]: Without dead ends: 986 [2019-10-15 01:04:14,664 INFO L600 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-15 01:04:14,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2019-10-15 01:04:14,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 984. [2019-10-15 01:04:14,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-10-15 01:04:14,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1494 transitions. [2019-10-15 01:04:14,698 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1494 transitions. Word has length 25 [2019-10-15 01:04:14,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:14,699 INFO L462 AbstractCegarLoop]: Abstraction has 984 states and 1494 transitions. [2019-10-15 01:04:14,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:14,699 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1494 transitions. [2019-10-15 01:04:14,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:04:14,702 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:14,702 INFO L380 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-15 01:04:14,702 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:14,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:14,703 INFO L82 PathProgramCache]: Analyzing trace with hash -2100750599, now seen corresponding path program 1 times [2019-10-15 01:04:14,703 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:14,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106258994] [2019-10-15 01:04:14,703 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,704 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:14,728 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-15 01:04:14,729 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106258994] [2019-10-15 01:04:14,729 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:14,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:14,730 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841155102] [2019-10-15 01:04:14,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:14,732 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:14,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:14,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:14,733 INFO L87 Difference]: Start difference. First operand 984 states and 1494 transitions. Second operand 3 states. [2019-10-15 01:04:14,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:14,777 INFO L93 Difference]: Finished difference Result 1740 states and 2696 transitions. [2019-10-15 01:04:14,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:14,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 01:04:14,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:14,786 INFO L225 Difference]: With dead ends: 1740 [2019-10-15 01:04:14,786 INFO L226 Difference]: Without dead ends: 1738 [2019-10-15 01:04:14,787 INFO L600 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-15 01:04:14,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-10-15 01:04:14,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1416. [2019-10-15 01:04:14,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2019-10-15 01:04:14,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2086 transitions. [2019-10-15 01:04:14,828 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2086 transitions. Word has length 25 [2019-10-15 01:04:14,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:14,829 INFO L462 AbstractCegarLoop]: Abstraction has 1416 states and 2086 transitions. [2019-10-15 01:04:14,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:14,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2086 transitions. [2019-10-15 01:04:14,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:04:14,832 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:14,832 INFO L380 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-15 01:04:14,833 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:14,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:14,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1607410683, now seen corresponding path program 1 times [2019-10-15 01:04:14,833 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:14,833 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445379690] [2019-10-15 01:04:14,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:14,867 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-15 01:04:14,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445379690] [2019-10-15 01:04:14,868 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:14,868 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:14,869 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311168918] [2019-10-15 01:04:14,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:14,870 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:14,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:14,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:14,871 INFO L87 Difference]: Start difference. First operand 1416 states and 2086 transitions. Second operand 3 states. [2019-10-15 01:04:14,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:14,934 INFO L93 Difference]: Finished difference Result 3276 states and 4840 transitions. [2019-10-15 01:04:14,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:14,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 01:04:14,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:14,944 INFO L225 Difference]: With dead ends: 3276 [2019-10-15 01:04:14,945 INFO L226 Difference]: Without dead ends: 1898 [2019-10-15 01:04:14,949 INFO L600 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-15 01:04:14,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2019-10-15 01:04:15,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1896. [2019-10-15 01:04:15,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2019-10-15 01:04:15,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2758 transitions. [2019-10-15 01:04:15,030 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2758 transitions. Word has length 25 [2019-10-15 01:04:15,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:15,031 INFO L462 AbstractCegarLoop]: Abstraction has 1896 states and 2758 transitions. [2019-10-15 01:04:15,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:15,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2758 transitions. [2019-10-15 01:04:15,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 01:04:15,035 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:15,036 INFO L380 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-15 01:04:15,036 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:15,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:15,037 INFO L82 PathProgramCache]: Analyzing trace with hash -698544044, now seen corresponding path program 1 times [2019-10-15 01:04:15,037 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:15,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890224576] [2019-10-15 01:04:15,038 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,038 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:15,064 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-15 01:04:15,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890224576] [2019-10-15 01:04:15,065 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:15,065 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:15,065 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961822786] [2019-10-15 01:04:15,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:15,067 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:15,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:15,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:15,068 INFO L87 Difference]: Start difference. First operand 1896 states and 2758 transitions. Second operand 3 states. [2019-10-15 01:04:15,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:15,121 INFO L93 Difference]: Finished difference Result 2844 states and 4120 transitions. [2019-10-15 01:04:15,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:15,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-15 01:04:15,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:15,134 INFO L225 Difference]: With dead ends: 2844 [2019-10-15 01:04:15,135 INFO L226 Difference]: Without dead ends: 1930 [2019-10-15 01:04:15,138 INFO L600 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-15 01:04:15,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2019-10-15 01:04:15,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1928. [2019-10-15 01:04:15,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2019-10-15 01:04:15,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2758 transitions. [2019-10-15 01:04:15,217 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2758 transitions. Word has length 26 [2019-10-15 01:04:15,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:15,218 INFO L462 AbstractCegarLoop]: Abstraction has 1928 states and 2758 transitions. [2019-10-15 01:04:15,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:15,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2758 transitions. [2019-10-15 01:04:15,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 01:04:15,221 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:15,221 INFO L380 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-15 01:04:15,221 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:15,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:15,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1709661294, now seen corresponding path program 1 times [2019-10-15 01:04:15,222 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:15,222 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435653285] [2019-10-15 01:04:15,222 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,222 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:15,266 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-15 01:04:15,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435653285] [2019-10-15 01:04:15,267 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:15,267 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:15,267 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124900840] [2019-10-15 01:04:15,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:15,268 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:15,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:15,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:15,268 INFO L87 Difference]: Start difference. First operand 1928 states and 2758 transitions. Second operand 3 states. [2019-10-15 01:04:15,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:15,323 INFO L93 Difference]: Finished difference Result 3340 states and 4872 transitions. [2019-10-15 01:04:15,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:15,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-15 01:04:15,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:15,338 INFO L225 Difference]: With dead ends: 3340 [2019-10-15 01:04:15,338 INFO L226 Difference]: Without dead ends: 3338 [2019-10-15 01:04:15,340 INFO L600 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-15 01:04:15,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2019-10-15 01:04:15,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2824. [2019-10-15 01:04:15,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2824 states. [2019-10-15 01:04:15,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 3910 transitions. [2019-10-15 01:04:15,435 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 3910 transitions. Word has length 26 [2019-10-15 01:04:15,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:15,435 INFO L462 AbstractCegarLoop]: Abstraction has 2824 states and 3910 transitions. [2019-10-15 01:04:15,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:15,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 3910 transitions. [2019-10-15 01:04:15,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 01:04:15,440 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:15,440 INFO L380 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-15 01:04:15,440 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:15,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:15,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1998499988, now seen corresponding path program 1 times [2019-10-15 01:04:15,441 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:15,441 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61401995] [2019-10-15 01:04:15,441 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,441 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:15,458 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-15 01:04:15,459 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61401995] [2019-10-15 01:04:15,459 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:15,459 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:15,459 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910755246] [2019-10-15 01:04:15,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:15,460 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:15,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:15,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:15,461 INFO L87 Difference]: Start difference. First operand 2824 states and 3910 transitions. Second operand 3 states. [2019-10-15 01:04:15,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:15,521 INFO L93 Difference]: Finished difference Result 6476 states and 8968 transitions. [2019-10-15 01:04:15,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:15,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-15 01:04:15,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:15,538 INFO L225 Difference]: With dead ends: 6476 [2019-10-15 01:04:15,538 INFO L226 Difference]: Without dead ends: 3722 [2019-10-15 01:04:15,543 INFO L600 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-15 01:04:15,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2019-10-15 01:04:15,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3720. [2019-10-15 01:04:15,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3720 states. [2019-10-15 01:04:15,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 5062 transitions. [2019-10-15 01:04:15,645 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 5062 transitions. Word has length 26 [2019-10-15 01:04:15,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:15,645 INFO L462 AbstractCegarLoop]: Abstraction has 3720 states and 5062 transitions. [2019-10-15 01:04:15,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:15,646 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 5062 transitions. [2019-10-15 01:04:15,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 01:04:15,651 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:15,651 INFO L380 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-15 01:04:15,651 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:15,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:15,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1459677136, now seen corresponding path program 1 times [2019-10-15 01:04:15,652 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:15,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072806730] [2019-10-15 01:04:15,652 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,652 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:15,667 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-15 01:04:15,668 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072806730] [2019-10-15 01:04:15,668 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:15,668 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:15,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401937949] [2019-10-15 01:04:15,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:15,669 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:15,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:15,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:15,669 INFO L87 Difference]: Start difference. First operand 3720 states and 5062 transitions. Second operand 3 states. [2019-10-15 01:04:15,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:15,725 INFO L93 Difference]: Finished difference Result 5580 states and 7560 transitions. [2019-10-15 01:04:15,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:15,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-15 01:04:15,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:15,742 INFO L225 Difference]: With dead ends: 5580 [2019-10-15 01:04:15,742 INFO L226 Difference]: Without dead ends: 3786 [2019-10-15 01:04:15,746 INFO L600 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-15 01:04:15,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2019-10-15 01:04:15,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2019-10-15 01:04:15,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-10-15 01:04:15,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5062 transitions. [2019-10-15 01:04:15,902 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5062 transitions. Word has length 27 [2019-10-15 01:04:15,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:15,903 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5062 transitions. [2019-10-15 01:04:15,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:15,903 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5062 transitions. [2019-10-15 01:04:15,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 01:04:15,908 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:15,908 INFO L380 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-15 01:04:15,908 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:15,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:15,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1824172910, now seen corresponding path program 1 times [2019-10-15 01:04:15,909 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:15,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210641161] [2019-10-15 01:04:15,909 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,909 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:15,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:15,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210641161] [2019-10-15 01:04:15,937 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:15,937 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:15,937 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858003811] [2019-10-15 01:04:15,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:15,937 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:15,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:15,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:15,938 INFO L87 Difference]: Start difference. First operand 3784 states and 5062 transitions. Second operand 3 states. [2019-10-15 01:04:16,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,034 INFO L93 Difference]: Finished difference Result 10956 states and 14408 transitions. [2019-10-15 01:04:16,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-15 01:04:16,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,074 INFO L225 Difference]: With dead ends: 10956 [2019-10-15 01:04:16,075 INFO L226 Difference]: Without dead ends: 7306 [2019-10-15 01:04:16,084 INFO L600 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-15 01:04:16,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2019-10-15 01:04:16,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7304. [2019-10-15 01:04:16,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2019-10-15 01:04:16,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9350 transitions. [2019-10-15 01:04:16,267 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9350 transitions. Word has length 27 [2019-10-15 01:04:16,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,267 INFO L462 AbstractCegarLoop]: Abstraction has 7304 states and 9350 transitions. [2019-10-15 01:04:16,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,268 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9350 transitions. [2019-10-15 01:04:16,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 01:04:16,277 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,277 INFO L380 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-15 01:04:16,278 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1883988372, now seen corresponding path program 1 times [2019-10-15 01:04:16,278 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,278 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539943970] [2019-10-15 01:04:16,278 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,279 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:16,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:16,298 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539943970] [2019-10-15 01:04:16,298 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:16,299 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:16,299 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508216784] [2019-10-15 01:04:16,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:16,299 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:16,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:16,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,300 INFO L87 Difference]: Start difference. First operand 7304 states and 9350 transitions. Second operand 3 states. [2019-10-15 01:04:16,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,423 INFO L93 Difference]: Finished difference Result 8076 states and 10632 transitions. [2019-10-15 01:04:16,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-15 01:04:16,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,478 INFO L225 Difference]: With dead ends: 8076 [2019-10-15 01:04:16,478 INFO L226 Difference]: Without dead ends: 8074 [2019-10-15 01:04:16,480 INFO L600 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-15 01:04:16,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2019-10-15 01:04:16,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 7304. [2019-10-15 01:04:16,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2019-10-15 01:04:16,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9222 transitions. [2019-10-15 01:04:16,634 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9222 transitions. Word has length 27 [2019-10-15 01:04:16,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,634 INFO L462 AbstractCegarLoop]: Abstraction has 7304 states and 9222 transitions. [2019-10-15 01:04:16,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,634 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9222 transitions. [2019-10-15 01:04:16,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 01:04:16,643 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,643 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:16,644 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,644 INFO L82 PathProgramCache]: Analyzing trace with hash 715001129, now seen corresponding path program 1 times [2019-10-15 01:04:16,644 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,644 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848782376] [2019-10-15 01:04:16,644 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,645 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:16,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-15 01:04:16,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848782376] [2019-10-15 01:04:16,662 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:16,662 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:16,662 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077056977] [2019-10-15 01:04:16,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:16,663 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:16,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:16,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,663 INFO L87 Difference]: Start difference. First operand 7304 states and 9222 transitions. Second operand 3 states. [2019-10-15 01:04:16,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,801 INFO L93 Difference]: Finished difference Result 12172 states and 15496 transitions. [2019-10-15 01:04:16,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-15 01:04:16,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,829 INFO L225 Difference]: With dead ends: 12172 [2019-10-15 01:04:16,830 INFO L226 Difference]: Without dead ends: 12170 [2019-10-15 01:04:16,835 INFO L600 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-15 01:04:16,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2019-10-15 01:04:17,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 11144. [2019-10-15 01:04:17,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2019-10-15 01:04:17,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 13702 transitions. [2019-10-15 01:04:17,135 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 13702 transitions. Word has length 28 [2019-10-15 01:04:17,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:17,135 INFO L462 AbstractCegarLoop]: Abstraction has 11144 states and 13702 transitions. [2019-10-15 01:04:17,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:17,135 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 13702 transitions. [2019-10-15 01:04:17,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 01:04:17,152 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:17,153 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:17,153 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:17,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:17,153 INFO L82 PathProgramCache]: Analyzing trace with hash 128195115, now seen corresponding path program 1 times [2019-10-15 01:04:17,153 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:17,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445754786] [2019-10-15 01:04:17,154 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,154 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:17,175 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-15 01:04:17,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445754786] [2019-10-15 01:04:17,176 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:17,176 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:17,176 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540177381] [2019-10-15 01:04:17,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:17,177 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:17,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:17,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:17,178 INFO L87 Difference]: Start difference. First operand 11144 states and 13702 transitions. Second operand 3 states. [2019-10-15 01:04:17,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:17,365 INFO L93 Difference]: Finished difference Result 25228 states and 30856 transitions. [2019-10-15 01:04:17,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:17,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-15 01:04:17,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:17,392 INFO L225 Difference]: With dead ends: 25228 [2019-10-15 01:04:17,392 INFO L226 Difference]: Without dead ends: 14218 [2019-10-15 01:04:17,414 INFO L600 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-15 01:04:17,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states. [2019-10-15 01:04:17,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14218 to 14216. [2019-10-15 01:04:17,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2019-10-15 01:04:17,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 16902 transitions. [2019-10-15 01:04:17,825 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 16902 transitions. Word has length 28 [2019-10-15 01:04:17,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:17,826 INFO L462 AbstractCegarLoop]: Abstraction has 14216 states and 16902 transitions. [2019-10-15 01:04:17,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:17,826 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 16902 transitions. [2019-10-15 01:04:17,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 01:04:17,844 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:17,845 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:17,845 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:17,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:17,845 INFO L82 PathProgramCache]: Analyzing trace with hash 690414627, now seen corresponding path program 1 times [2019-10-15 01:04:17,846 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:17,846 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597806525] [2019-10-15 01:04:17,846 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,846 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:17,866 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-15 01:04:17,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597806525] [2019-10-15 01:04:17,867 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:17,867 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:17,867 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741438903] [2019-10-15 01:04:17,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:17,868 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:17,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:17,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:17,869 INFO L87 Difference]: Start difference. First operand 14216 states and 16902 transitions. Second operand 3 states. [2019-10-15 01:04:18,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:18,041 INFO L93 Difference]: Finished difference Result 21516 states and 25608 transitions. [2019-10-15 01:04:18,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:18,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-15 01:04:18,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:18,067 INFO L225 Difference]: With dead ends: 21516 [2019-10-15 01:04:18,067 INFO L226 Difference]: Without dead ends: 14602 [2019-10-15 01:04:18,084 INFO L600 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-15 01:04:18,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14602 states. [2019-10-15 01:04:18,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14602 to 14600. [2019-10-15 01:04:18,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14600 states. [2019-10-15 01:04:18,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 17158 transitions. [2019-10-15 01:04:18,468 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 17158 transitions. Word has length 29 [2019-10-15 01:04:18,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:18,469 INFO L462 AbstractCegarLoop]: Abstraction has 14600 states and 17158 transitions. [2019-10-15 01:04:18,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:18,469 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 17158 transitions. [2019-10-15 01:04:18,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 01:04:18,487 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:18,487 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:18,487 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:18,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:18,488 INFO L82 PathProgramCache]: Analyzing trace with hash -320702623, now seen corresponding path program 1 times [2019-10-15 01:04:18,488 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:18,488 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890971865] [2019-10-15 01:04:18,488 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:18,488 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:18,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:18,505 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-15 01:04:18,506 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890971865] [2019-10-15 01:04:18,506 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:18,506 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:18,506 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757628045] [2019-10-15 01:04:18,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:18,507 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:18,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:18,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:18,507 INFO L87 Difference]: Start difference. First operand 14600 states and 17158 transitions. Second operand 3 states. [2019-10-15 01:04:18,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:18,756 INFO L93 Difference]: Finished difference Result 23562 states and 27399 transitions. [2019-10-15 01:04:18,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:18,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-15 01:04:18,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:18,807 INFO L225 Difference]: With dead ends: 23562 [2019-10-15 01:04:18,807 INFO L226 Difference]: Without dead ends: 23560 [2019-10-15 01:04:18,816 INFO L600 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-15 01:04:18,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23560 states. [2019-10-15 01:04:19,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23560 to 22536. [2019-10-15 01:04:19,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22536 states. [2019-10-15 01:04:19,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22536 states to 22536 states and 25862 transitions. [2019-10-15 01:04:19,741 INFO L78 Accepts]: Start accepts. Automaton has 22536 states and 25862 transitions. Word has length 29 [2019-10-15 01:04:19,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:19,741 INFO L462 AbstractCegarLoop]: Abstraction has 22536 states and 25862 transitions. [2019-10-15 01:04:19,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:19,742 INFO L276 IsEmpty]: Start isEmpty. Operand 22536 states and 25862 transitions. [2019-10-15 01:04:19,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 01:04:19,776 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:19,776 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:19,777 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:19,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:19,777 INFO L82 PathProgramCache]: Analyzing trace with hash -907508637, now seen corresponding path program 1 times [2019-10-15 01:04:19,777 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:19,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533407410] [2019-10-15 01:04:19,778 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:19,778 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:19,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:19,793 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-15 01:04:19,793 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533407410] [2019-10-15 01:04:19,794 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:19,794 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:19,794 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653123740] [2019-10-15 01:04:19,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:19,795 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:19,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:19,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:19,795 INFO L87 Difference]: Start difference. First operand 22536 states and 25862 transitions. Second operand 3 states. [2019-10-15 01:04:20,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:20,093 INFO L93 Difference]: Finished difference Result 50184 states and 56582 transitions. [2019-10-15 01:04:20,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:20,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-15 01:04:20,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:20,094 INFO L225 Difference]: With dead ends: 50184 [2019-10-15 01:04:20,094 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:04:20,289 INFO L600 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-15 01:04:20,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:04:20,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:04:20,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:04:20,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:04:20,291 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-10-15 01:04:20,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:20,291 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:04:20,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:20,292 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:04:20,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:04:20,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:04:20,331 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-15 01:04:20,331 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:04:20,332 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:04:20,332 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 01:04:20,332 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:04:20,332 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:04:20,332 INFO L446 ceAbstractionStarter]: At program point L159(lines 5 163) the Hoare annotation is: true [2019-10-15 01:04:20,333 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 163) no Hoare annotation was computed. [2019-10-15 01:04:20,333 INFO L443 ceAbstractionStarter]: For program point L118-1(lines 39 158) no Hoare annotation was computed. [2019-10-15 01:04:20,333 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 39 158) no Hoare annotation was computed. [2019-10-15 01:04:20,333 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 39 158) no Hoare annotation was computed. [2019-10-15 01:04:20,335 INFO L443 ceAbstractionStarter]: For program point L94-1(lines 39 158) no Hoare annotation was computed. [2019-10-15 01:04:20,335 INFO L443 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2019-10-15 01:04:20,335 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 39 158) no Hoare annotation was computed. [2019-10-15 01:04:20,335 INFO L443 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-10-15 01:04:20,336 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 39 158) no Hoare annotation was computed. [2019-10-15 01:04:20,336 INFO L443 ceAbstractionStarter]: For program point L70-1(lines 39 158) no Hoare annotation was computed. [2019-10-15 01:04:20,336 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 39 158) no Hoare annotation was computed. [2019-10-15 01:04:20,336 INFO L446 ceAbstractionStarter]: At program point L153-1(lines 39 158) the Hoare annotation is: true [2019-10-15 01:04:20,336 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 163) no Hoare annotation was computed. [2019-10-15 01:04:20,337 INFO L443 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-10-15 01:04:20,337 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 163) the Hoare annotation is: true [2019-10-15 01:04:20,337 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-10-15 01:04:20,337 INFO L439 ceAbstractionStarter]: At program point L154-1(lines 5 163) the Hoare annotation is: false [2019-10-15 01:04:20,337 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 39 158) no Hoare annotation was computed. [2019-10-15 01:04:20,337 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 39 158) no Hoare annotation was computed. [2019-10-15 01:04:20,338 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-10-15 01:04:20,338 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-10-15 01:04:20,338 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 39 158) no Hoare annotation was computed. [2019-10-15 01:04:20,338 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 39 158) no Hoare annotation was computed. [2019-10-15 01:04:20,338 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 39 158) no Hoare annotation was computed. [2019-10-15 01:04:20,339 INFO L443 ceAbstractionStarter]: For program point L148-1(lines 39 158) no Hoare annotation was computed. [2019-10-15 01:04:20,339 INFO L443 ceAbstractionStarter]: For program point L82-1(lines 39 158) no Hoare annotation was computed. [2019-10-15 01:04:20,339 INFO L443 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-10-15 01:04:20,339 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 39 158) no Hoare annotation was computed. [2019-10-15 01:04:20,339 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2019-10-15 01:04:20,339 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2019-10-15 01:04:20,340 INFO L443 ceAbstractionStarter]: For program point L66-2(lines 39 158) no Hoare annotation was computed. [2019-10-15 01:04:20,340 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-10-15 01:04:20,340 INFO L443 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2019-10-15 01:04:20,340 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 39 158) no Hoare annotation was computed. [2019-10-15 01:04:20,340 INFO L443 ceAbstractionStarter]: For program point L133-1(lines 39 158) no Hoare annotation was computed. [2019-10-15 01:04:20,341 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-10-15 01:04:20,341 INFO L443 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2019-10-15 01:04:20,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:04:20 BoogieIcfgContainer [2019-10-15 01:04:20,361 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:04:20,366 INFO L168 Benchmark]: Toolchain (without parser) took 8624.82 ms. Allocated memory was 144.2 MB in the beginning and 661.1 MB in the end (delta: 516.9 MB). Free memory was 102.6 MB in the beginning and 516.8 MB in the end (delta: -414.2 MB). Peak memory consumption was 102.8 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:20,372 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 01:04:20,377 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.62 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 102.4 MB in the beginning and 180.0 MB in the end (delta: -77.6 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:20,377 INFO L168 Benchmark]: Boogie Preprocessor took 35.19 ms. Allocated memory is still 200.8 MB. Free memory was 180.0 MB in the beginning and 178.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:20,378 INFO L168 Benchmark]: RCFGBuilder took 445.66 ms. Allocated memory is still 200.8 MB. Free memory was 177.4 MB in the beginning and 158.8 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:20,380 INFO L168 Benchmark]: TraceAbstraction took 7814.09 ms. Allocated memory was 200.8 MB in the beginning and 661.1 MB in the end (delta: 460.3 MB). Free memory was 158.1 MB in the beginning and 516.8 MB in the end (delta: -358.7 MB). Peak memory consumption was 101.7 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:20,385 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.20 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 325.62 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 102.4 MB in the beginning and 180.0 MB in the end (delta: -77.6 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.19 ms. Allocated memory is still 200.8 MB. Free memory was 180.0 MB in the beginning and 178.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 445.66 ms. Allocated memory is still 200.8 MB. Free memory was 177.4 MB in the beginning and 158.8 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7814.09 ms. Allocated memory was 200.8 MB in the beginning and 661.1 MB in the end (delta: 460.3 MB). Free memory was 158.1 MB in the beginning and 516.8 MB in the end (delta: -358.7 MB). Peak memory consumption was 101.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: 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 - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 44 locations, 1 error locations. Result: SAFE, OverallTime: 7.7s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2384 SDtfs, 1153 SDslu, 1624 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22536occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 4124 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 1034 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 659 ConstructedInterpolants, 0 QuantifiedInterpolants, 31265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...