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_11.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:04:11,539 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:04:11,541 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:04:11,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:04:11,553 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:04:11,554 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:04:11,557 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:04:11,567 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:04:11,571 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:04:11,573 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:04:11,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:04:11,576 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:04:11,576 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:04:11,577 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:04:11,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:04:11,579 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:04:11,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:04:11,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:04:11,582 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:04:11,583 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:04:11,585 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:04:11,586 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:04:11,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:04:11,587 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:04:11,589 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:04:11,590 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:04:11,590 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:04:11,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:04:11,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:04:11,592 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:04:11,592 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:04:11,593 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:04:11,593 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:04:11,594 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:04:11,595 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:04:11,595 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:04:11,596 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:04:11,596 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:04:11,596 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:04:11,597 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:04:11,598 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:04:11,599 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:11,613 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:04:11,613 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:04:11,614 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:04:11,615 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:04:11,615 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:04:11,615 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:04:11,615 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:04:11,615 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:04:11,616 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:04:11,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:04:11,616 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:04:11,616 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:04:11,616 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:04:11,617 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:04:11,617 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:04:11,617 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:04:11,617 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:04:11,617 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:04:11,618 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:04:11,618 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:04:11,618 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:04:11,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:04:11,618 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:04:11,619 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:04:11,619 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:04:11,619 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:04:11,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:04:11,619 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:04:11,620 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:11,872 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:04:11,885 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:04:11,888 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:04:11,889 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:04:11,890 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:04:11,890 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_11.c [2019-10-15 01:04:11,961 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d0463253/c114b81a68c240fa8458742c7ef61d8d/FLAGa397869d9 [2019-10-15 01:04:12,421 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:04:12,422 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_11.c [2019-10-15 01:04:12,434 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d0463253/c114b81a68c240fa8458742c7ef61d8d/FLAGa397869d9 [2019-10-15 01:04:12,798 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d0463253/c114b81a68c240fa8458742c7ef61d8d [2019-10-15 01:04:12,808 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:04:12,810 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:04:12,811 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:04:12,811 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:04:12,815 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:04:12,816 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:04:12" (1/1) ... [2019-10-15 01:04:12,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6836b2f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:12, skipping insertion in model container [2019-10-15 01:04:12,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:04:12" (1/1) ... [2019-10-15 01:04:12,827 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:04:12,850 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:04:13,060 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:04:13,064 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:04:13,091 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:04:13,183 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:04:13,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:13 WrapperNode [2019-10-15 01:04:13,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:04:13,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:04:13,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:04:13,186 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:04:13,199 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:13" (1/1) ... [2019-10-15 01:04:13,200 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:13" (1/1) ... [2019-10-15 01:04:13,206 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:13" (1/1) ... [2019-10-15 01:04:13,207 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:13" (1/1) ... [2019-10-15 01:04:13,213 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:13" (1/1) ... [2019-10-15 01:04:13,221 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:13" (1/1) ... [2019-10-15 01:04:13,222 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:13" (1/1) ... [2019-10-15 01:04:13,225 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:04:13,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:04:13,226 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:04:13,226 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:04:13,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:13" (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:13,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:04:13,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:04:13,288 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:04:13,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:04:13,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:04:13,289 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:04:13,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:04:13,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:04:13,621 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:04:13,621 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:04:13,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:04:13 BoogieIcfgContainer [2019-10-15 01:04:13,623 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:04:13,632 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:04:13,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:04:13,640 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:04:13,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:04:12" (1/3) ... [2019-10-15 01:04:13,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6136c39f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:04:13, skipping insertion in model container [2019-10-15 01:04:13,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:13" (2/3) ... [2019-10-15 01:04:13,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6136c39f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:04:13, skipping insertion in model container [2019-10-15 01:04:13,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:04:13" (3/3) ... [2019-10-15 01:04:13,649 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2019-10-15 01:04:13,664 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:04:13,682 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:04:13,693 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:04:13,719 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:04:13,719 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:04:13,719 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:04:13,719 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:04:13,719 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:04:13,720 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:04:13,720 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:04:13,720 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:04:13,746 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-10-15 01:04:13,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 01:04:13,752 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:13,752 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,754 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:13,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:13,760 INFO L82 PathProgramCache]: Analyzing trace with hash -316470182, now seen corresponding path program 1 times [2019-10-15 01:04:13,768 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:13,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613035683] [2019-10-15 01:04:13,768 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:13,769 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:13,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:13,976 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,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613035683] [2019-10-15 01:04:13,978 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:13,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:13,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995479787] [2019-10-15 01:04:13,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:13,985 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:14,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:14,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:14,004 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2019-10-15 01:04:14,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:14,090 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2019-10-15 01:04:14,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:14,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-15 01:04:14,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:14,110 INFO L225 Difference]: With dead ends: 93 [2019-10-15 01:04:14,110 INFO L226 Difference]: Without dead ends: 78 [2019-10-15 01:04:14,116 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,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-15 01:04:14,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2019-10-15 01:04:14,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-15 01:04:14,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2019-10-15 01:04:14,171 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 21 [2019-10-15 01:04:14,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:14,172 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2019-10-15 01:04:14,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:14,173 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2019-10-15 01:04:14,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 01:04:14,174 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:14,174 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:14,176 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:14,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:14,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1327587432, now seen corresponding path program 1 times [2019-10-15 01:04:14,179 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:14,179 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751911711] [2019-10-15 01:04:14,179 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,180 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:14,275 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,276 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751911711] [2019-10-15 01:04:14,276 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:14,276 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:14,277 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852347172] [2019-10-15 01:04:14,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:14,280 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:14,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:14,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:14,281 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand 3 states. [2019-10-15 01:04:14,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:14,337 INFO L93 Difference]: Finished difference Result 127 states and 232 transitions. [2019-10-15 01:04:14,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:14,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-15 01:04:14,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:14,340 INFO L225 Difference]: With dead ends: 127 [2019-10-15 01:04:14,340 INFO L226 Difference]: Without dead ends: 78 [2019-10-15 01:04:14,342 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,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-15 01:04:14,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-10-15 01:04:14,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-15 01:04:14,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 137 transitions. [2019-10-15 01:04:14,355 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 137 transitions. Word has length 21 [2019-10-15 01:04:14,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:14,356 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 137 transitions. [2019-10-15 01:04:14,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:14,356 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 137 transitions. [2019-10-15 01:04:14,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 01:04:14,357 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:14,358 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:14,358 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:14,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:14,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1220427994, now seen corresponding path program 1 times [2019-10-15 01:04:14,359 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:14,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232096387] [2019-10-15 01:04:14,359 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,360 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:14,410 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,411 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232096387] [2019-10-15 01:04:14,411 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:14,412 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:14,412 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575327598] [2019-10-15 01:04:14,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:14,413 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:14,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:14,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:14,413 INFO L87 Difference]: Start difference. First operand 76 states and 137 transitions. Second operand 3 states. [2019-10-15 01:04:14,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:14,438 INFO L93 Difference]: Finished difference Result 117 states and 207 transitions. [2019-10-15 01:04:14,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:14,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-15 01:04:14,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:14,441 INFO L225 Difference]: With dead ends: 117 [2019-10-15 01:04:14,441 INFO L226 Difference]: Without dead ends: 81 [2019-10-15 01:04:14,442 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,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-15 01:04:14,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2019-10-15 01:04:14,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-15 01:04:14,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 139 transitions. [2019-10-15 01:04:14,454 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 139 transitions. Word has length 22 [2019-10-15 01:04:14,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:14,455 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 139 transitions. [2019-10-15 01:04:14,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:14,455 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2019-10-15 01:04:14,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 01:04:14,458 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:14,459 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:14,459 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:14,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:14,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1794675624, now seen corresponding path program 1 times [2019-10-15 01:04:14,460 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:14,460 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833614028] [2019-10-15 01:04:14,461 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,461 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:14,551 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,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833614028] [2019-10-15 01:04:14,552 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:14,552 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:14,553 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380132308] [2019-10-15 01:04:14,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:14,554 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:14,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:14,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:14,554 INFO L87 Difference]: Start difference. First operand 79 states and 139 transitions. Second operand 3 states. [2019-10-15 01:04:14,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:14,578 INFO L93 Difference]: Finished difference Result 148 states and 264 transitions. [2019-10-15 01:04:14,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:14,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-15 01:04:14,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:14,581 INFO L225 Difference]: With dead ends: 148 [2019-10-15 01:04:14,581 INFO L226 Difference]: Without dead ends: 146 [2019-10-15 01:04:14,582 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,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-15 01:04:14,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2019-10-15 01:04:14,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-15 01:04:14,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 184 transitions. [2019-10-15 01:04:14,605 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 184 transitions. Word has length 22 [2019-10-15 01:04:14,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:14,605 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 184 transitions. [2019-10-15 01:04:14,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:14,605 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 184 transitions. [2019-10-15 01:04:14,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 01:04:14,607 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:14,608 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:14,608 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:14,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:14,609 INFO L82 PathProgramCache]: Analyzing trace with hash 783558374, now seen corresponding path program 1 times [2019-10-15 01:04:14,609 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:14,609 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044008251] [2019-10-15 01:04:14,609 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,610 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:14,650 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,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044008251] [2019-10-15 01:04:14,650 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:14,651 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:14,651 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859618672] [2019-10-15 01:04:14,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:14,652 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:14,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:14,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:14,652 INFO L87 Difference]: Start difference. First operand 104 states and 184 transitions. Second operand 3 states. [2019-10-15 01:04:14,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:14,680 INFO L93 Difference]: Finished difference Result 244 states and 438 transitions. [2019-10-15 01:04:14,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:14,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-15 01:04:14,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:14,682 INFO L225 Difference]: With dead ends: 244 [2019-10-15 01:04:14,682 INFO L226 Difference]: Without dead ends: 148 [2019-10-15 01:04:14,683 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,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-15 01:04:14,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2019-10-15 01:04:14,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-10-15 01:04:14,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 258 transitions. [2019-10-15 01:04:14,697 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 258 transitions. Word has length 22 [2019-10-15 01:04:14,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:14,697 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 258 transitions. [2019-10-15 01:04:14,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:14,697 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 258 transitions. [2019-10-15 01:04:14,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-15 01:04:14,699 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:14,699 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,699 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:14,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:14,700 INFO L82 PathProgramCache]: Analyzing trace with hash -199417107, now seen corresponding path program 1 times [2019-10-15 01:04:14,700 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:14,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847846545] [2019-10-15 01:04:14,701 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,701 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:14,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:14,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847846545] [2019-10-15 01:04:14,743 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:14,743 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:14,744 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044667233] [2019-10-15 01:04:14,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:14,745 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:14,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:14,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:14,745 INFO L87 Difference]: Start difference. First operand 146 states and 258 transitions. Second operand 3 states. [2019-10-15 01:04:14,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:14,767 INFO L93 Difference]: Finished difference Result 219 states and 385 transitions. [2019-10-15 01:04:14,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:14,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-15 01:04:14,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:14,769 INFO L225 Difference]: With dead ends: 219 [2019-10-15 01:04:14,770 INFO L226 Difference]: Without dead ends: 150 [2019-10-15 01:04:14,771 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,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-10-15 01:04:14,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2019-10-15 01:04:14,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-10-15 01:04:14,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 258 transitions. [2019-10-15 01:04:14,782 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 258 transitions. Word has length 23 [2019-10-15 01:04:14,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:14,783 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 258 transitions. [2019-10-15 01:04:14,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:14,783 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 258 transitions. [2019-10-15 01:04:14,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-15 01:04:14,785 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:14,785 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,785 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:14,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:14,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1479280785, now seen corresponding path program 1 times [2019-10-15 01:04:14,786 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:14,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787509240] [2019-10-15 01:04:14,786 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,787 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:14,839 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,840 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787509240] [2019-10-15 01:04:14,840 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:14,840 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:14,840 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863837995] [2019-10-15 01:04:14,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:14,841 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:14,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:14,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:14,843 INFO L87 Difference]: Start difference. First operand 148 states and 258 transitions. Second operand 3 states. [2019-10-15 01:04:14,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:14,869 INFO L93 Difference]: Finished difference Result 276 states and 488 transitions. [2019-10-15 01:04:14,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:14,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-15 01:04:14,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:14,872 INFO L225 Difference]: With dead ends: 276 [2019-10-15 01:04:14,872 INFO L226 Difference]: Without dead ends: 274 [2019-10-15 01:04:14,873 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,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-10-15 01:04:14,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 200. [2019-10-15 01:04:14,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-10-15 01:04:14,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 346 transitions. [2019-10-15 01:04:14,885 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 346 transitions. Word has length 23 [2019-10-15 01:04:14,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:14,885 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 346 transitions. [2019-10-15 01:04:14,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:14,886 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 346 transitions. [2019-10-15 01:04:14,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-15 01:04:14,887 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:14,888 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,888 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:14,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:14,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1804569261, now seen corresponding path program 1 times [2019-10-15 01:04:14,889 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:14,889 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680807592] [2019-10-15 01:04:14,889 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,889 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:14,935 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,935 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680807592] [2019-10-15 01:04:14,936 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:14,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:14,936 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957754521] [2019-10-15 01:04:14,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:14,936 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:14,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:14,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:14,937 INFO L87 Difference]: Start difference. First operand 200 states and 346 transitions. Second operand 3 states. [2019-10-15 01:04:14,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:14,960 INFO L93 Difference]: Finished difference Result 472 states and 824 transitions. [2019-10-15 01:04:14,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:14,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-15 01:04:14,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:14,962 INFO L225 Difference]: With dead ends: 472 [2019-10-15 01:04:14,962 INFO L226 Difference]: Without dead ends: 282 [2019-10-15 01:04:14,963 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,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-10-15 01:04:14,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2019-10-15 01:04:14,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-15 01:04:14,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 482 transitions. [2019-10-15 01:04:14,984 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 482 transitions. Word has length 23 [2019-10-15 01:04:14,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:14,984 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 482 transitions. [2019-10-15 01:04:14,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:14,984 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 482 transitions. [2019-10-15 01:04:14,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:04:14,993 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:14,993 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,994 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:14,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:14,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1387149659, now seen corresponding path program 1 times [2019-10-15 01:04:14,995 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:14,995 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95974129] [2019-10-15 01:04:14,995 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,995 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:15,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:15,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95974129] [2019-10-15 01:04:15,034 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:15,034 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:15,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259859537] [2019-10-15 01:04:15,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:15,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:15,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:15,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:15,036 INFO L87 Difference]: Start difference. First operand 280 states and 482 transitions. Second operand 3 states. [2019-10-15 01:04:15,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:15,061 INFO L93 Difference]: Finished difference Result 420 states and 720 transitions. [2019-10-15 01:04:15,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:15,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-15 01:04:15,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:15,064 INFO L225 Difference]: With dead ends: 420 [2019-10-15 01:04:15,065 INFO L226 Difference]: Without dead ends: 286 [2019-10-15 01:04:15,065 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,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-10-15 01:04:15,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2019-10-15 01:04:15,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-10-15 01:04:15,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 482 transitions. [2019-10-15 01:04:15,082 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 482 transitions. Word has length 24 [2019-10-15 01:04:15,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:15,083 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 482 transitions. [2019-10-15 01:04:15,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:15,083 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 482 transitions. [2019-10-15 01:04:15,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:04:15,084 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:15,084 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:15,084 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:15,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:15,085 INFO L82 PathProgramCache]: Analyzing trace with hash 107285981, now seen corresponding path program 1 times [2019-10-15 01:04:15,085 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:15,085 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814478505] [2019-10-15 01:04:15,085 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,086 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:15,107 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,108 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814478505] [2019-10-15 01:04:15,108 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:15,108 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:15,109 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013701589] [2019-10-15 01:04:15,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:15,109 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:15,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:15,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:15,110 INFO L87 Difference]: Start difference. First operand 284 states and 482 transitions. Second operand 3 states. [2019-10-15 01:04:15,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:15,135 INFO L93 Difference]: Finished difference Result 524 states and 904 transitions. [2019-10-15 01:04:15,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:15,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-15 01:04:15,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:15,138 INFO L225 Difference]: With dead ends: 524 [2019-10-15 01:04:15,139 INFO L226 Difference]: Without dead ends: 522 [2019-10-15 01:04:15,139 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,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-10-15 01:04:15,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 392. [2019-10-15 01:04:15,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-10-15 01:04:15,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 654 transitions. [2019-10-15 01:04:15,155 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 654 transitions. Word has length 24 [2019-10-15 01:04:15,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:15,157 INFO L462 AbstractCegarLoop]: Abstraction has 392 states and 654 transitions. [2019-10-15 01:04:15,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:15,158 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 654 transitions. [2019-10-15 01:04:15,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:04:15,159 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:15,159 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:15,159 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:15,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:15,160 INFO L82 PathProgramCache]: Analyzing trace with hash -903831269, now seen corresponding path program 1 times [2019-10-15 01:04:15,160 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:15,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360264276] [2019-10-15 01:04:15,160 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,160 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:15,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:15,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:15,192 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360264276] [2019-10-15 01:04:15,192 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:15,192 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:15,193 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058947640] [2019-10-15 01:04:15,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:15,193 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:15,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:15,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:15,194 INFO L87 Difference]: Start difference. First operand 392 states and 654 transitions. Second operand 3 states. [2019-10-15 01:04:15,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:15,234 INFO L93 Difference]: Finished difference Result 924 states and 1552 transitions. [2019-10-15 01:04:15,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:15,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-15 01:04:15,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:15,238 INFO L225 Difference]: With dead ends: 924 [2019-10-15 01:04:15,238 INFO L226 Difference]: Without dead ends: 546 [2019-10-15 01:04:15,239 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,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-10-15 01:04:15,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2019-10-15 01:04:15,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-10-15 01:04:15,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 902 transitions. [2019-10-15 01:04:15,258 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 902 transitions. Word has length 24 [2019-10-15 01:04:15,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:15,258 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 902 transitions. [2019-10-15 01:04:15,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:15,258 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 902 transitions. [2019-10-15 01:04:15,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:04:15,260 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:15,260 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:15,260 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:15,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:15,260 INFO L82 PathProgramCache]: Analyzing trace with hash -968887806, now seen corresponding path program 1 times [2019-10-15 01:04:15,261 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:15,261 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227013242] [2019-10-15 01:04:15,261 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,261 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:15,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:15,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227013242] [2019-10-15 01:04:15,287 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:15,287 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:15,287 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998451395] [2019-10-15 01:04:15,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:15,287 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:15,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:15,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:15,288 INFO L87 Difference]: Start difference. First operand 544 states and 902 transitions. Second operand 3 states. [2019-10-15 01:04:15,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:15,311 INFO L93 Difference]: Finished difference Result 816 states and 1348 transitions. [2019-10-15 01:04:15,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:15,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 01:04:15,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:15,315 INFO L225 Difference]: With dead ends: 816 [2019-10-15 01:04:15,315 INFO L226 Difference]: Without dead ends: 554 [2019-10-15 01:04:15,316 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,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-10-15 01:04:15,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2019-10-15 01:04:15,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-10-15 01:04:15,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 902 transitions. [2019-10-15 01:04:15,333 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 902 transitions. Word has length 25 [2019-10-15 01:04:15,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:15,334 INFO L462 AbstractCegarLoop]: Abstraction has 552 states and 902 transitions. [2019-10-15 01:04:15,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:15,334 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 902 transitions. [2019-10-15 01:04:15,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:04:15,335 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:15,335 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:15,336 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:15,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:15,336 INFO L82 PathProgramCache]: Analyzing trace with hash 2046215812, now seen corresponding path program 1 times [2019-10-15 01:04:15,336 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:15,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412902879] [2019-10-15 01:04:15,337 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,337 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:15,360 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,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412902879] [2019-10-15 01:04:15,360 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:15,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:15,361 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177689605] [2019-10-15 01:04:15,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:15,361 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:15,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:15,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:15,362 INFO L87 Difference]: Start difference. First operand 552 states and 902 transitions. Second operand 3 states. [2019-10-15 01:04:15,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:15,388 INFO L93 Difference]: Finished difference Result 1004 states and 1672 transitions. [2019-10-15 01:04:15,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:15,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 01:04:15,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:15,394 INFO L225 Difference]: With dead ends: 1004 [2019-10-15 01:04:15,395 INFO L226 Difference]: Without dead ends: 1002 [2019-10-15 01:04:15,395 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,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2019-10-15 01:04:15,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 776. [2019-10-15 01:04:15,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-10-15 01:04:15,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1238 transitions. [2019-10-15 01:04:15,419 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1238 transitions. Word has length 25 [2019-10-15 01:04:15,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:15,419 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1238 transitions. [2019-10-15 01:04:15,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:15,420 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1238 transitions. [2019-10-15 01:04:15,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:04:15,421 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:15,421 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:15,422 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:15,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:15,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1035098562, now seen corresponding path program 1 times [2019-10-15 01:04:15,422 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:15,422 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668964389] [2019-10-15 01:04:15,423 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,423 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:15,447 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,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668964389] [2019-10-15 01:04:15,448 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:15,448 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:15,448 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797099556] [2019-10-15 01:04:15,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:15,449 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:15,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:15,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:15,449 INFO L87 Difference]: Start difference. First operand 776 states and 1238 transitions. Second operand 3 states. [2019-10-15 01:04:15,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:15,484 INFO L93 Difference]: Finished difference Result 1820 states and 2920 transitions. [2019-10-15 01:04:15,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:15,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 01:04:15,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:15,490 INFO L225 Difference]: With dead ends: 1820 [2019-10-15 01:04:15,490 INFO L226 Difference]: Without dead ends: 1066 [2019-10-15 01:04:15,493 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,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2019-10-15 01:04:15,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1064. [2019-10-15 01:04:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2019-10-15 01:04:15,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1686 transitions. [2019-10-15 01:04:15,532 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1686 transitions. Word has length 25 [2019-10-15 01:04:15,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:15,532 INFO L462 AbstractCegarLoop]: Abstraction has 1064 states and 1686 transitions. [2019-10-15 01:04:15,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:15,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1686 transitions. [2019-10-15 01:04:15,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 01:04:15,534 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:15,535 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,535 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:15,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:15,535 INFO L82 PathProgramCache]: Analyzing trace with hash -991604848, now seen corresponding path program 1 times [2019-10-15 01:04:15,536 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:15,536 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430744087] [2019-10-15 01:04:15,536 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,536 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:15,565 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,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430744087] [2019-10-15 01:04:15,565 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:15,566 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:15,566 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748202084] [2019-10-15 01:04:15,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:15,567 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:15,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:15,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:15,567 INFO L87 Difference]: Start difference. First operand 1064 states and 1686 transitions. Second operand 3 states. [2019-10-15 01:04:15,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:15,601 INFO L93 Difference]: Finished difference Result 1596 states and 2520 transitions. [2019-10-15 01:04:15,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:15,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-15 01:04:15,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:15,607 INFO L225 Difference]: With dead ends: 1596 [2019-10-15 01:04:15,608 INFO L226 Difference]: Without dead ends: 1082 [2019-10-15 01:04:15,611 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,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-10-15 01:04:15,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1080. [2019-10-15 01:04:15,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2019-10-15 01:04:15,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1686 transitions. [2019-10-15 01:04:15,658 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1686 transitions. Word has length 26 [2019-10-15 01:04:15,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:15,658 INFO L462 AbstractCegarLoop]: Abstraction has 1080 states and 1686 transitions. [2019-10-15 01:04:15,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:15,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1686 transitions. [2019-10-15 01:04:15,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 01:04:15,661 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:15,661 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,661 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:15,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:15,661 INFO L82 PathProgramCache]: Analyzing trace with hash 2023498770, now seen corresponding path program 1 times [2019-10-15 01:04:15,662 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:15,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521970233] [2019-10-15 01:04:15,662 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,662 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:15,687 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,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521970233] [2019-10-15 01:04:15,688 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:15,688 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:15,691 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412218810] [2019-10-15 01:04:15,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:15,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:15,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:15,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:15,692 INFO L87 Difference]: Start difference. First operand 1080 states and 1686 transitions. Second operand 3 states. [2019-10-15 01:04:15,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:15,726 INFO L93 Difference]: Finished difference Result 1932 states and 3080 transitions. [2019-10-15 01:04:15,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:15,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-15 01:04:15,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:15,737 INFO L225 Difference]: With dead ends: 1932 [2019-10-15 01:04:15,737 INFO L226 Difference]: Without dead ends: 1930 [2019-10-15 01:04:15,738 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,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2019-10-15 01:04:15,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1544. [2019-10-15 01:04:15,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2019-10-15 01:04:15,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2342 transitions. [2019-10-15 01:04:15,802 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2342 transitions. Word has length 26 [2019-10-15 01:04:15,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:15,803 INFO L462 AbstractCegarLoop]: Abstraction has 1544 states and 2342 transitions. [2019-10-15 01:04:15,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:15,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2342 transitions. [2019-10-15 01:04:15,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 01:04:15,808 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:15,809 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,809 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:15,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:15,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1012381520, now seen corresponding path program 1 times [2019-10-15 01:04:15,810 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:15,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483341466] [2019-10-15 01:04:15,810 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,811 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:15,845 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,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483341466] [2019-10-15 01:04:15,846 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:15,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:15,846 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169905282] [2019-10-15 01:04:15,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:15,848 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:15,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:15,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:15,849 INFO L87 Difference]: Start difference. First operand 1544 states and 2342 transitions. Second operand 3 states. [2019-10-15 01:04:15,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:15,912 INFO L93 Difference]: Finished difference Result 3596 states and 5480 transitions. [2019-10-15 01:04:15,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:15,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-15 01:04:15,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:15,926 INFO L225 Difference]: With dead ends: 3596 [2019-10-15 01:04:15,927 INFO L226 Difference]: Without dead ends: 2090 [2019-10-15 01:04:15,932 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,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2019-10-15 01:04:16,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2088. [2019-10-15 01:04:16,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2088 states. [2019-10-15 01:04:16,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 3142 transitions. [2019-10-15 01:04:16,018 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 3142 transitions. Word has length 26 [2019-10-15 01:04:16,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,019 INFO L462 AbstractCegarLoop]: Abstraction has 2088 states and 3142 transitions. [2019-10-15 01:04:16,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3142 transitions. [2019-10-15 01:04:16,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 01:04:16,023 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,024 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,024 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1695832809, now seen corresponding path program 1 times [2019-10-15 01:04:16,025 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,026 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572436711] [2019-10-15 01:04:16,026 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,026 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:16,051 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,052 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572436711] [2019-10-15 01:04:16,052 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:16,052 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:16,053 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11168482] [2019-10-15 01:04:16,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:16,053 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:16,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:16,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,055 INFO L87 Difference]: Start difference. First operand 2088 states and 3142 transitions. Second operand 3 states. [2019-10-15 01:04:16,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,106 INFO L93 Difference]: Finished difference Result 3132 states and 4696 transitions. [2019-10-15 01:04:16,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-15 01:04:16,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,119 INFO L225 Difference]: With dead ends: 3132 [2019-10-15 01:04:16,119 INFO L226 Difference]: Without dead ends: 2122 [2019-10-15 01:04:16,122 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,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2019-10-15 01:04:16,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2120. [2019-10-15 01:04:16,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2120 states. [2019-10-15 01:04:16,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 3142 transitions. [2019-10-15 01:04:16,191 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 3142 transitions. Word has length 27 [2019-10-15 01:04:16,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,192 INFO L462 AbstractCegarLoop]: Abstraction has 2120 states and 3142 transitions. [2019-10-15 01:04:16,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 3142 transitions. [2019-10-15 01:04:16,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 01:04:16,196 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,196 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,196 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1319270809, now seen corresponding path program 1 times [2019-10-15 01:04:16,197 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303697941] [2019-10-15 01:04:16,197 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,197 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:16,219 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,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303697941] [2019-10-15 01:04:16,220 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:16,220 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:16,220 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007294309] [2019-10-15 01:04:16,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:16,221 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:16,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:16,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,221 INFO L87 Difference]: Start difference. First operand 2120 states and 3142 transitions. Second operand 3 states. [2019-10-15 01:04:16,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,299 INFO L93 Difference]: Finished difference Result 3724 states and 5640 transitions. [2019-10-15 01:04:16,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-15 01:04:16,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,318 INFO L225 Difference]: With dead ends: 3724 [2019-10-15 01:04:16,318 INFO L226 Difference]: Without dead ends: 3722 [2019-10-15 01:04:16,320 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,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2019-10-15 01:04:16,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3080. [2019-10-15 01:04:16,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3080 states. [2019-10-15 01:04:16,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 4422 transitions. [2019-10-15 01:04:16,404 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 4422 transitions. Word has length 27 [2019-10-15 01:04:16,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,405 INFO L462 AbstractCegarLoop]: Abstraction has 3080 states and 4422 transitions. [2019-10-15 01:04:16,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,405 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 4422 transitions. [2019-10-15 01:04:16,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 01:04:16,410 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,410 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,410 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,411 INFO L82 PathProgramCache]: Analyzing trace with hash 308153559, now seen corresponding path program 1 times [2019-10-15 01:04:16,411 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317178629] [2019-10-15 01:04:16,411 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,412 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:16,438 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,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317178629] [2019-10-15 01:04:16,438 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:16,439 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:16,439 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917227165] [2019-10-15 01:04:16,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:16,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:16,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:16,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,440 INFO L87 Difference]: Start difference. First operand 3080 states and 4422 transitions. Second operand 3 states. [2019-10-15 01:04:16,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,514 INFO L93 Difference]: Finished difference Result 7116 states and 10248 transitions. [2019-10-15 01:04:16,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-15 01:04:16,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,534 INFO L225 Difference]: With dead ends: 7116 [2019-10-15 01:04:16,534 INFO L226 Difference]: Without dead ends: 4106 [2019-10-15 01:04:16,540 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,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2019-10-15 01:04:16,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 4104. [2019-10-15 01:04:16,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2019-10-15 01:04:16,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 5830 transitions. [2019-10-15 01:04:16,654 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 5830 transitions. Word has length 27 [2019-10-15 01:04:16,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,654 INFO L462 AbstractCegarLoop]: Abstraction has 4104 states and 5830 transitions. [2019-10-15 01:04:16,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,655 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 5830 transitions. [2019-10-15 01:04:16,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 01:04:16,661 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,661 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,661 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,662 INFO L82 PathProgramCache]: Analyzing trace with hash -2052062779, now seen corresponding path program 1 times [2019-10-15 01:04:16,662 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641396737] [2019-10-15 01:04:16,662 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,662 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:16,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:16,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641396737] [2019-10-15 01:04:16,681 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:16,681 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:16,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402304571] [2019-10-15 01:04:16,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:16,682 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:16,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:16,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,683 INFO L87 Difference]: Start difference. First operand 4104 states and 5830 transitions. Second operand 3 states. [2019-10-15 01:04:16,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,766 INFO L93 Difference]: Finished difference Result 6156 states and 8712 transitions. [2019-10-15 01:04:16,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-15 01:04:16,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,784 INFO L225 Difference]: With dead ends: 6156 [2019-10-15 01:04:16,785 INFO L226 Difference]: Without dead ends: 4170 [2019-10-15 01:04:16,789 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,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states. [2019-10-15 01:04:16,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 4168. [2019-10-15 01:04:16,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4168 states. [2019-10-15 01:04:16,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 5830 transitions. [2019-10-15 01:04:16,896 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 5830 transitions. Word has length 28 [2019-10-15 01:04:16,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,896 INFO L462 AbstractCegarLoop]: Abstraction has 4168 states and 5830 transitions. [2019-10-15 01:04:16,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,896 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 5830 transitions. [2019-10-15 01:04:16,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 01:04:16,902 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,902 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,902 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,902 INFO L82 PathProgramCache]: Analyzing trace with hash 963040839, now seen corresponding path program 1 times [2019-10-15 01:04:16,903 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,903 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332370355] [2019-10-15 01:04:16,903 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,903 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:16,920 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,920 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332370355] [2019-10-15 01:04:16,920 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:16,920 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:16,920 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383132814] [2019-10-15 01:04:16,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:16,921 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:16,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:16,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,921 INFO L87 Difference]: Start difference. First operand 4168 states and 5830 transitions. Second operand 3 states. [2019-10-15 01:04:17,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:17,055 INFO L93 Difference]: Finished difference Result 12108 states and 16712 transitions. [2019-10-15 01:04:17,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:17,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-15 01:04:17,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:17,074 INFO L225 Difference]: With dead ends: 12108 [2019-10-15 01:04:17,074 INFO L226 Difference]: Without dead ends: 8074 [2019-10-15 01:04:17,086 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,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2019-10-15 01:04:17,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 8072. [2019-10-15 01:04:17,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2019-10-15 01:04:17,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10886 transitions. [2019-10-15 01:04:17,365 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10886 transitions. Word has length 28 [2019-10-15 01:04:17,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:17,365 INFO L462 AbstractCegarLoop]: Abstraction has 8072 states and 10886 transitions. [2019-10-15 01:04:17,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:17,366 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10886 transitions. [2019-10-15 01:04:17,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 01:04:17,376 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:17,376 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,376 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:17,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:17,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1974158089, now seen corresponding path program 1 times [2019-10-15 01:04:17,377 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:17,377 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789378210] [2019-10-15 01:04:17,377 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,377 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:17,406 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,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789378210] [2019-10-15 01:04:17,407 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:17,407 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:17,407 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608935339] [2019-10-15 01:04:17,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:17,408 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:17,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:17,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:17,408 INFO L87 Difference]: Start difference. First operand 8072 states and 10886 transitions. Second operand 3 states. [2019-10-15 01:04:17,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:17,546 INFO L93 Difference]: Finished difference Result 9100 states and 12680 transitions. [2019-10-15 01:04:17,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:17,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-15 01:04:17,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:17,566 INFO L225 Difference]: With dead ends: 9100 [2019-10-15 01:04:17,566 INFO L226 Difference]: Without dead ends: 9098 [2019-10-15 01:04:17,570 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,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9098 states. [2019-10-15 01:04:17,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9098 to 8072. [2019-10-15 01:04:17,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2019-10-15 01:04:17,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10758 transitions. [2019-10-15 01:04:17,764 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10758 transitions. Word has length 28 [2019-10-15 01:04:17,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:17,764 INFO L462 AbstractCegarLoop]: Abstraction has 8072 states and 10758 transitions. [2019-10-15 01:04:17,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:17,764 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10758 transitions. [2019-10-15 01:04:17,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 01:04:17,775 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:17,775 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,775 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:17,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:17,776 INFO L82 PathProgramCache]: Analyzing trace with hash -210289620, now seen corresponding path program 1 times [2019-10-15 01:04:17,776 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:17,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401877282] [2019-10-15 01:04:17,776 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,776 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:17,797 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,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401877282] [2019-10-15 01:04:17,798 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:17,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:17,798 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515320708] [2019-10-15 01:04:17,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:17,799 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:17,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:17,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:17,800 INFO L87 Difference]: Start difference. First operand 8072 states and 10758 transitions. Second operand 3 states. [2019-10-15 01:04:18,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:18,026 INFO L93 Difference]: Finished difference Result 13708 states and 18568 transitions. [2019-10-15 01:04:18,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:18,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-15 01:04:18,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:18,058 INFO L225 Difference]: With dead ends: 13708 [2019-10-15 01:04:18,058 INFO L226 Difference]: Without dead ends: 13706 [2019-10-15 01:04:18,065 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,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13706 states. [2019-10-15 01:04:18,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13706 to 12168. [2019-10-15 01:04:18,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12168 states. [2019-10-15 01:04:18,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12168 states to 12168 states and 15750 transitions. [2019-10-15 01:04:18,355 INFO L78 Accepts]: Start accepts. Automaton has 12168 states and 15750 transitions. Word has length 29 [2019-10-15 01:04:18,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:18,355 INFO L462 AbstractCegarLoop]: Abstraction has 12168 states and 15750 transitions. [2019-10-15 01:04:18,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:18,355 INFO L276 IsEmpty]: Start isEmpty. Operand 12168 states and 15750 transitions. [2019-10-15 01:04:18,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 01:04:18,374 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:18,375 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,375 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:18,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:18,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1221406870, now seen corresponding path program 1 times [2019-10-15 01:04:18,375 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:18,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802201316] [2019-10-15 01:04:18,376 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:18,376 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:18,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:18,394 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,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802201316] [2019-10-15 01:04:18,394 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:18,395 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:18,395 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445197595] [2019-10-15 01:04:18,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:18,395 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:18,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:18,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:18,396 INFO L87 Difference]: Start difference. First operand 12168 states and 15750 transitions. Second operand 3 states. [2019-10-15 01:04:18,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:18,713 INFO L93 Difference]: Finished difference Result 27788 states and 35976 transitions. [2019-10-15 01:04:18,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:18,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-15 01:04:18,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:18,740 INFO L225 Difference]: With dead ends: 27788 [2019-10-15 01:04:18,740 INFO L226 Difference]: Without dead ends: 15754 [2019-10-15 01:04:18,761 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,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15754 states. [2019-10-15 01:04:19,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15754 to 15752. [2019-10-15 01:04:19,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15752 states. [2019-10-15 01:04:19,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15752 states to 15752 states and 19974 transitions. [2019-10-15 01:04:19,662 INFO L78 Accepts]: Start accepts. Automaton has 15752 states and 19974 transitions. Word has length 29 [2019-10-15 01:04:19,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:19,662 INFO L462 AbstractCegarLoop]: Abstraction has 15752 states and 19974 transitions. [2019-10-15 01:04:19,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:19,662 INFO L276 IsEmpty]: Start isEmpty. Operand 15752 states and 19974 transitions. [2019-10-15 01:04:19,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 01:04:19,682 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:19,682 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, 1] [2019-10-15 01:04:19,683 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:19,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:19,683 INFO L82 PathProgramCache]: Analyzing trace with hash 2071172156, now seen corresponding path program 1 times [2019-10-15 01:04:19,683 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:19,683 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353186107] [2019-10-15 01:04:19,683 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:19,684 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:19,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:19,702 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,703 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353186107] [2019-10-15 01:04:19,703 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:19,703 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:19,703 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810985946] [2019-10-15 01:04:19,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:19,704 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:19,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:19,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:19,704 INFO L87 Difference]: Start difference. First operand 15752 states and 19974 transitions. Second operand 3 states. [2019-10-15 01:04:19,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:19,875 INFO L93 Difference]: Finished difference Result 23820 states and 30216 transitions. [2019-10-15 01:04:19,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:19,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-15 01:04:19,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:19,905 INFO L225 Difference]: With dead ends: 23820 [2019-10-15 01:04:19,905 INFO L226 Difference]: Without dead ends: 16138 [2019-10-15 01:04:19,925 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:19,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16138 states. [2019-10-15 01:04:20,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16138 to 16136. [2019-10-15 01:04:20,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16136 states. [2019-10-15 01:04:20,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16136 states to 16136 states and 20230 transitions. [2019-10-15 01:04:20,223 INFO L78 Accepts]: Start accepts. Automaton has 16136 states and 20230 transitions. Word has length 30 [2019-10-15 01:04:20,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:20,224 INFO L462 AbstractCegarLoop]: Abstraction has 16136 states and 20230 transitions. [2019-10-15 01:04:20,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:20,224 INFO L276 IsEmpty]: Start isEmpty. Operand 16136 states and 20230 transitions. [2019-10-15 01:04:20,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 01:04:20,245 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:20,245 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, 1] [2019-10-15 01:04:20,245 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:20,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:20,246 INFO L82 PathProgramCache]: Analyzing trace with hash 791308478, now seen corresponding path program 1 times [2019-10-15 01:04:20,246 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:20,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946239331] [2019-10-15 01:04:20,247 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:20,247 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:20,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:20,267 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:20,268 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946239331] [2019-10-15 01:04:20,268 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:20,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:20,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259366474] [2019-10-15 01:04:20,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:20,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:20,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:20,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:20,270 INFO L87 Difference]: Start difference. First operand 16136 states and 20230 transitions. Second operand 3 states. [2019-10-15 01:04:20,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:20,618 INFO L93 Difference]: Finished difference Result 26636 states and 33544 transitions. [2019-10-15 01:04:20,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:20,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-15 01:04:20,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:20,667 INFO L225 Difference]: With dead ends: 26636 [2019-10-15 01:04:20,667 INFO L226 Difference]: Without dead ends: 26634 [2019-10-15 01:04:20,675 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,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26634 states. [2019-10-15 01:04:21,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26634 to 24584. [2019-10-15 01:04:21,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24584 states. [2019-10-15 01:04:21,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24584 states to 24584 states and 29958 transitions. [2019-10-15 01:04:21,162 INFO L78 Accepts]: Start accepts. Automaton has 24584 states and 29958 transitions. Word has length 30 [2019-10-15 01:04:21,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:21,162 INFO L462 AbstractCegarLoop]: Abstraction has 24584 states and 29958 transitions. [2019-10-15 01:04:21,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:21,163 INFO L276 IsEmpty]: Start isEmpty. Operand 24584 states and 29958 transitions. [2019-10-15 01:04:21,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 01:04:21,200 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:21,201 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, 1] [2019-10-15 01:04:21,201 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:21,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:21,201 INFO L82 PathProgramCache]: Analyzing trace with hash -219808772, now seen corresponding path program 1 times [2019-10-15 01:04:21,202 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:21,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143196371] [2019-10-15 01:04:21,202 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:21,202 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:21,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:21,225 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:21,225 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143196371] [2019-10-15 01:04:21,225 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:21,225 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:21,226 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137474348] [2019-10-15 01:04:21,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:21,226 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:21,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:21,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:21,227 INFO L87 Difference]: Start difference. First operand 24584 states and 29958 transitions. Second operand 3 states. [2019-10-15 01:04:21,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:21,576 INFO L93 Difference]: Finished difference Result 55308 states and 66824 transitions. [2019-10-15 01:04:21,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:21,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-15 01:04:21,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:21,656 INFO L225 Difference]: With dead ends: 55308 [2019-10-15 01:04:21,656 INFO L226 Difference]: Without dead ends: 31242 [2019-10-15 01:04:21,707 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:21,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31242 states. [2019-10-15 01:04:22,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31242 to 31240. [2019-10-15 01:04:22,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31240 states. [2019-10-15 01:04:22,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31240 states to 31240 states and 36870 transitions. [2019-10-15 01:04:22,437 INFO L78 Accepts]: Start accepts. Automaton has 31240 states and 36870 transitions. Word has length 30 [2019-10-15 01:04:22,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:22,438 INFO L462 AbstractCegarLoop]: Abstraction has 31240 states and 36870 transitions. [2019-10-15 01:04:22,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:22,438 INFO L276 IsEmpty]: Start isEmpty. Operand 31240 states and 36870 transitions. [2019-10-15 01:04:22,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 01:04:22,469 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:22,469 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, 1, 1] [2019-10-15 01:04:22,470 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:22,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:22,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1239024833, now seen corresponding path program 1 times [2019-10-15 01:04:22,470 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:22,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999345802] [2019-10-15 01:04:22,471 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:22,471 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:22,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:22,501 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:22,501 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999345802] [2019-10-15 01:04:22,502 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:22,502 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:22,502 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370734766] [2019-10-15 01:04:22,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:22,502 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:22,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:22,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:22,503 INFO L87 Difference]: Start difference. First operand 31240 states and 36870 transitions. Second operand 3 states. [2019-10-15 01:04:22,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:22,782 INFO L93 Difference]: Finished difference Result 46860 states and 55048 transitions. [2019-10-15 01:04:22,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:22,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-15 01:04:22,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:22,848 INFO L225 Difference]: With dead ends: 46860 [2019-10-15 01:04:22,848 INFO L226 Difference]: Without dead ends: 31754 [2019-10-15 01:04:22,882 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:22,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31754 states. [2019-10-15 01:04:24,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31754 to 31752. [2019-10-15 01:04:24,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31752 states. [2019-10-15 01:04:24,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31752 states to 31752 states and 36870 transitions. [2019-10-15 01:04:24,178 INFO L78 Accepts]: Start accepts. Automaton has 31752 states and 36870 transitions. Word has length 31 [2019-10-15 01:04:24,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:24,179 INFO L462 AbstractCegarLoop]: Abstraction has 31752 states and 36870 transitions. [2019-10-15 01:04:24,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:24,179 INFO L276 IsEmpty]: Start isEmpty. Operand 31752 states and 36870 transitions. [2019-10-15 01:04:24,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 01:04:24,196 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:24,196 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, 1, 1] [2019-10-15 01:04:24,197 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:24,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:24,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1776078785, now seen corresponding path program 1 times [2019-10-15 01:04:24,198 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:24,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164561381] [2019-10-15 01:04:24,199 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:24,199 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:24,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:24,215 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:24,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164561381] [2019-10-15 01:04:24,215 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:24,216 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:24,216 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992180777] [2019-10-15 01:04:24,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:24,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:24,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:24,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:24,217 INFO L87 Difference]: Start difference. First operand 31752 states and 36870 transitions. Second operand 3 states. [2019-10-15 01:04:24,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:24,792 INFO L93 Difference]: Finished difference Result 51210 states and 58887 transitions. [2019-10-15 01:04:24,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:24,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-15 01:04:24,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:24,842 INFO L225 Difference]: With dead ends: 51210 [2019-10-15 01:04:24,842 INFO L226 Difference]: Without dead ends: 51208 [2019-10-15 01:04:24,851 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:24,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51208 states. [2019-10-15 01:04:25,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51208 to 49160. [2019-10-15 01:04:25,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49160 states. [2019-10-15 01:04:25,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49160 states to 49160 states and 55814 transitions. [2019-10-15 01:04:25,451 INFO L78 Accepts]: Start accepts. Automaton has 49160 states and 55814 transitions. Word has length 31 [2019-10-15 01:04:25,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:25,451 INFO L462 AbstractCegarLoop]: Abstraction has 49160 states and 55814 transitions. [2019-10-15 01:04:25,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:25,451 INFO L276 IsEmpty]: Start isEmpty. Operand 49160 states and 55814 transitions. [2019-10-15 01:04:25,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 01:04:25,672 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:25,672 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, 1, 1] [2019-10-15 01:04:25,672 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:25,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:25,673 INFO L82 PathProgramCache]: Analyzing trace with hash 764961535, now seen corresponding path program 1 times [2019-10-15 01:04:25,673 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:25,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618612741] [2019-10-15 01:04:25,673 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:25,673 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:25,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:25,690 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:25,691 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618612741] [2019-10-15 01:04:25,691 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:25,691 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:25,691 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101371947] [2019-10-15 01:04:25,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:25,692 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:25,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:25,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:25,692 INFO L87 Difference]: Start difference. First operand 49160 states and 55814 transitions. Second operand 3 states. [2019-10-15 01:04:26,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:26,176 INFO L93 Difference]: Finished difference Result 109576 states and 122374 transitions. [2019-10-15 01:04:26,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:26,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-15 01:04:26,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:26,177 INFO L225 Difference]: With dead ends: 109576 [2019-10-15 01:04:26,177 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:04:26,269 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:26,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:04:26,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:04:26,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:04:26,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:04:26,270 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-10-15 01:04:26,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:26,270 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:04:26,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:26,270 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:04:26,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:04:26,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:04:26,299 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-15 01:04:26,300 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:04:26,300 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:04:26,300 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 01:04:26,300 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:04:26,300 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:04:26,300 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 177) no Hoare annotation was computed. [2019-10-15 01:04:26,300 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-10-15 01:04:26,301 INFO L443 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2019-10-15 01:04:26,301 INFO L443 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2019-10-15 01:04:26,301 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-10-15 01:04:26,301 INFO L439 ceAbstractionStarter]: At program point L168-1(lines 5 177) the Hoare annotation is: false [2019-10-15 01:04:26,301 INFO L443 ceAbstractionStarter]: For program point L127-1(lines 42 172) no Hoare annotation was computed. [2019-10-15 01:04:26,301 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 42 172) no Hoare annotation was computed. [2019-10-15 01:04:26,301 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 42 172) no Hoare annotation was computed. [2019-10-15 01:04:26,302 INFO L443 ceAbstractionStarter]: For program point L103-1(lines 42 172) no Hoare annotation was computed. [2019-10-15 01:04:26,302 INFO L443 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2019-10-15 01:04:26,302 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 42 172) no Hoare annotation was computed. [2019-10-15 01:04:26,302 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-10-15 01:04:26,302 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 42 172) no Hoare annotation was computed. [2019-10-15 01:04:26,303 INFO L443 ceAbstractionStarter]: For program point L79-1(lines 42 172) no Hoare annotation was computed. [2019-10-15 01:04:26,303 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 177) no Hoare annotation was computed. [2019-10-15 01:04:26,303 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 42 172) no Hoare annotation was computed. [2019-10-15 01:04:26,303 INFO L443 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2019-10-15 01:04:26,303 INFO L443 ceAbstractionStarter]: For program point L71-2(lines 42 172) no Hoare annotation was computed. [2019-10-15 01:04:26,304 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 42 172) no Hoare annotation was computed. [2019-10-15 01:04:26,304 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 177) the Hoare annotation is: true [2019-10-15 01:04:26,304 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-10-15 01:04:26,304 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-10-15 01:04:26,304 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 42 172) no Hoare annotation was computed. [2019-10-15 01:04:26,304 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 42 172) no Hoare annotation was computed. [2019-10-15 01:04:26,304 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2019-10-15 01:04:26,304 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-10-15 01:04:26,305 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-10-15 01:04:26,305 INFO L446 ceAbstractionStarter]: At program point L173(lines 5 177) the Hoare annotation is: true [2019-10-15 01:04:26,305 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 42 172) no Hoare annotation was computed. [2019-10-15 01:04:26,305 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 42 172) no Hoare annotation was computed. [2019-10-15 01:04:26,305 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 42 172) no Hoare annotation was computed. [2019-10-15 01:04:26,305 INFO L443 ceAbstractionStarter]: For program point L157-1(lines 42 172) no Hoare annotation was computed. [2019-10-15 01:04:26,305 INFO L443 ceAbstractionStarter]: For program point L91-1(lines 42 172) no Hoare annotation was computed. [2019-10-15 01:04:26,305 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 42 172) no Hoare annotation was computed. [2019-10-15 01:04:26,305 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 42 172) no Hoare annotation was computed. [2019-10-15 01:04:26,306 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-10-15 01:04:26,306 INFO L443 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2019-10-15 01:04:26,306 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 42 172) no Hoare annotation was computed. [2019-10-15 01:04:26,306 INFO L443 ceAbstractionStarter]: For program point L142-1(lines 42 172) no Hoare annotation was computed. [2019-10-15 01:04:26,306 INFO L446 ceAbstractionStarter]: At program point L167-1(lines 42 172) the Hoare annotation is: true [2019-10-15 01:04:26,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:04:26 BoogieIcfgContainer [2019-10-15 01:04:26,318 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:04:26,325 INFO L168 Benchmark]: Toolchain (without parser) took 13509.84 ms. Allocated memory was 138.4 MB in the beginning and 1.0 GB in the end (delta: 902.8 MB). Free memory was 101.6 MB in the beginning and 409.5 MB in the end (delta: -307.9 MB). Peak memory consumption was 594.9 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:26,326 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 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:26,326 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.97 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.4 MB in the beginning and 181.6 MB in the end (delta: -80.2 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:26,327 INFO L168 Benchmark]: Boogie Preprocessor took 39.76 ms. Allocated memory is still 202.4 MB. Free memory was 181.6 MB in the beginning and 179.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:26,328 INFO L168 Benchmark]: RCFGBuilder took 397.45 ms. Allocated memory is still 202.4 MB. Free memory was 179.2 MB in the beginning and 159.7 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:26,328 INFO L168 Benchmark]: TraceAbstraction took 12685.51 ms. Allocated memory was 202.4 MB in the beginning and 1.0 GB in the end (delta: 838.9 MB). Free memory was 159.1 MB in the beginning and 409.5 MB in the end (delta: -250.4 MB). Peak memory consumption was 588.5 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:26,332 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.21 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 373.97 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.4 MB in the beginning and 181.6 MB in the end (delta: -80.2 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.76 ms. Allocated memory is still 202.4 MB. Free memory was 181.6 MB in the beginning and 179.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 397.45 ms. Allocated memory is still 202.4 MB. Free memory was 179.2 MB in the beginning and 159.7 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12685.51 ms. Allocated memory was 202.4 MB in the beginning and 1.0 GB in the end (delta: 838.9 MB). Free memory was 159.1 MB in the beginning and 409.5 MB in the end (delta: -250.4 MB). Peak memory consumption was 588.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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: 42]: 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, 47 locations, 1 error locations. Result: SAFE, OverallTime: 12.5s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2877 SDtfs, 1405 SDslu, 1967 SDs, 0 SdLazy, 165 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49160occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.9s AutomataMinimizationTime, 31 MinimizatonAttempts, 8224 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 2058 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.6s InterpolantComputationTime, 808 NumberOfCodeBlocks, 808 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 777 ConstructedInterpolants, 0 QuantifiedInterpolants, 39912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...