/usr/bin/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_14-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 00:32:29,632 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 00:32:29,634 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 00:32:29,652 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 00:32:29,652 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 00:32:29,655 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 00:32:29,657 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 00:32:29,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 00:32:29,670 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 00:32:29,671 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 00:32:29,672 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 00:32:29,673 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 00:32:29,674 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 00:32:29,675 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 00:32:29,676 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 00:32:29,678 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 00:32:29,678 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 00:32:29,683 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 00:32:29,685 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 00:32:29,689 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 00:32:29,692 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 00:32:29,693 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 00:32:29,695 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 00:32:29,699 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 00:32:29,701 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 00:32:29,701 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 00:32:29,701 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 00:32:29,704 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 00:32:29,705 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 00:32:29,707 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 00:32:29,707 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 00:32:29,709 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 00:32:29,710 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 00:32:29,711 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 00:32:29,715 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 00:32:29,715 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 00:32:29,716 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 00:32:29,716 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 00:32:29,716 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 00:32:29,719 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 00:32:29,720 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 00:32:29,721 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-11-07 00:32:29,738 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 00:32:29,739 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 00:32:29,740 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 00:32:29,740 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 00:32:29,740 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 00:32:29,741 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 00:32:29,741 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 00:32:29,741 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 00:32:29,741 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 00:32:29,742 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 00:32:29,742 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 00:32:29,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 00:32:29,742 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 00:32:29,742 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 00:32:29,743 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 00:32:29,743 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 00:32:29,743 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 00:32:29,743 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 00:32:29,743 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 00:32:29,744 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 00:32:29,744 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 00:32:29,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:32:29,744 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 00:32:29,744 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 00:32:29,745 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 00:32:29,745 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 00:32:29,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 00:32:29,745 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 00:32:29,745 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-11-07 00:32:30,043 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 00:32:30,059 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 00:32:30,063 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 00:32:30,065 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 00:32:30,066 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 00:32:30,067 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_14-1.c [2019-11-07 00:32:30,136 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/206e5f8d9/a6a779d655454fcf82135e82ccf3e6c7/FLAG576034ee1 [2019-11-07 00:32:30,603 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 00:32:30,604 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14-1.c [2019-11-07 00:32:30,612 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/206e5f8d9/a6a779d655454fcf82135e82ccf3e6c7/FLAG576034ee1 [2019-11-07 00:32:31,003 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/206e5f8d9/a6a779d655454fcf82135e82ccf3e6c7 [2019-11-07 00:32:31,028 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 00:32:31,032 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 00:32:31,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 00:32:31,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 00:32:31,041 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 00:32:31,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:32:31" (1/1) ... [2019-11-07 00:32:31,047 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@389c572b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:31, skipping insertion in model container [2019-11-07 00:32:31,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:32:31" (1/1) ... [2019-11-07 00:32:31,054 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 00:32:31,084 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 00:32:31,277 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:32:31,281 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 00:32:31,401 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:32:31,418 INFO L192 MainTranslator]: Completed translation [2019-11-07 00:32:31,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:31 WrapperNode [2019-11-07 00:32:31,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 00:32:31,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 00:32:31,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 00:32:31,419 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 00:32:31,429 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:31" (1/1) ... [2019-11-07 00:32:31,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:31" (1/1) ... [2019-11-07 00:32:31,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:31" (1/1) ... [2019-11-07 00:32:31,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:31" (1/1) ... [2019-11-07 00:32:31,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:31" (1/1) ... [2019-11-07 00:32:31,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:31" (1/1) ... [2019-11-07 00:32:31,458 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:31" (1/1) ... [2019-11-07 00:32:31,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 00:32:31,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 00:32:31,461 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 00:32:31,462 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 00:32:31,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:31" (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-11-07 00:32:31,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 00:32:31,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 00:32:31,516 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 00:32:31,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 00:32:31,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 00:32:31,517 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 00:32:31,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 00:32:31,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 00:32:31,901 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 00:32:31,902 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-07 00:32:31,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:32:31 BoogieIcfgContainer [2019-11-07 00:32:31,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 00:32:31,905 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 00:32:31,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 00:32:31,908 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 00:32:31,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:32:31" (1/3) ... [2019-11-07 00:32:31,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1727576c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:32:31, skipping insertion in model container [2019-11-07 00:32:31,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:31" (2/3) ... [2019-11-07 00:32:31,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1727576c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:32:31, skipping insertion in model container [2019-11-07 00:32:31,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:32:31" (3/3) ... [2019-11-07 00:32:31,912 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2019-11-07 00:32:31,925 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 00:32:31,932 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 00:32:31,940 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 00:32:31,963 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 00:32:31,964 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 00:32:31,964 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 00:32:31,964 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 00:32:31,964 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 00:32:31,964 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 00:32:31,964 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 00:32:31,964 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 00:32:31,983 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2019-11-07 00:32:31,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-07 00:32:31,990 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:31,991 INFO L410 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-11-07 00:32:31,992 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:31,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:31,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1694520263, now seen corresponding path program 1 times [2019-11-07 00:32:32,007 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:32,007 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652559651] [2019-11-07 00:32:32,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:32,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:32,244 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652559651] [2019-11-07 00:32:32,245 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:32,246 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:32,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233903730] [2019-11-07 00:32:32,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:32,254 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:32,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:32,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:32,273 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 3 states. [2019-11-07 00:32:32,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:32,347 INFO L93 Difference]: Finished difference Result 111 states and 198 transitions. [2019-11-07 00:32:32,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:32,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-07 00:32:32,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:32,362 INFO L225 Difference]: With dead ends: 111 [2019-11-07 00:32:32,362 INFO L226 Difference]: Without dead ends: 96 [2019-11-07 00:32:32,365 INFO L630 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-11-07 00:32:32,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-07 00:32:32,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2019-11-07 00:32:32,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-07 00:32:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 121 transitions. [2019-11-07 00:32:32,418 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 121 transitions. Word has length 24 [2019-11-07 00:32:32,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:32,419 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 121 transitions. [2019-11-07 00:32:32,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:32,420 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 121 transitions. [2019-11-07 00:32:32,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-07 00:32:32,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:32,421 INFO L410 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-11-07 00:32:32,422 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:32,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:32,423 INFO L82 PathProgramCache]: Analyzing trace with hash 106172361, now seen corresponding path program 1 times [2019-11-07 00:32:32,423 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:32,423 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400624254] [2019-11-07 00:32:32,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:32,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:32,492 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400624254] [2019-11-07 00:32:32,493 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:32,493 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:32,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507116391] [2019-11-07 00:32:32,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:32,495 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:32,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:32,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:32,496 INFO L87 Difference]: Start difference. First operand 66 states and 121 transitions. Second operand 3 states. [2019-11-07 00:32:32,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:32,550 INFO L93 Difference]: Finished difference Result 157 states and 292 transitions. [2019-11-07 00:32:32,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:32,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-07 00:32:32,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:32,553 INFO L225 Difference]: With dead ends: 157 [2019-11-07 00:32:32,553 INFO L226 Difference]: Without dead ends: 96 [2019-11-07 00:32:32,554 INFO L630 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-11-07 00:32:32,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-07 00:32:32,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-11-07 00:32:32,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-07 00:32:32,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 173 transitions. [2019-11-07 00:32:32,575 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 173 transitions. Word has length 24 [2019-11-07 00:32:32,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:32,575 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 173 transitions. [2019-11-07 00:32:32,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:32,576 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 173 transitions. [2019-11-07 00:32:32,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-07 00:32:32,577 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:32,577 INFO L410 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-11-07 00:32:32,578 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:32,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:32,579 INFO L82 PathProgramCache]: Analyzing trace with hash 990732685, now seen corresponding path program 1 times [2019-11-07 00:32:32,579 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:32,579 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817209952] [2019-11-07 00:32:32,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:32,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:32,634 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817209952] [2019-11-07 00:32:32,634 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:32,634 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:32,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296728977] [2019-11-07 00:32:32,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:32,635 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:32,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:32,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:32,636 INFO L87 Difference]: Start difference. First operand 94 states and 173 transitions. Second operand 3 states. [2019-11-07 00:32:32,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:32,681 INFO L93 Difference]: Finished difference Result 144 states and 261 transitions. [2019-11-07 00:32:32,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:32,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-07 00:32:32,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:32,684 INFO L225 Difference]: With dead ends: 144 [2019-11-07 00:32:32,684 INFO L226 Difference]: Without dead ends: 99 [2019-11-07 00:32:32,687 INFO L630 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-11-07 00:32:32,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-07 00:32:32,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-11-07 00:32:32,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-07 00:32:32,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 175 transitions. [2019-11-07 00:32:32,705 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 175 transitions. Word has length 25 [2019-11-07 00:32:32,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:32,705 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 175 transitions. [2019-11-07 00:32:32,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:32,706 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 175 transitions. [2019-11-07 00:32:32,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-07 00:32:32,707 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:32,707 INFO L410 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-11-07 00:32:32,707 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:32,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:32,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1003412021, now seen corresponding path program 1 times [2019-11-07 00:32:32,708 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:32,708 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55993761] [2019-11-07 00:32:32,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:32,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:32,791 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55993761] [2019-11-07 00:32:32,792 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:32,792 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:32,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349329928] [2019-11-07 00:32:32,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:32,793 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:32,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:32,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:32,794 INFO L87 Difference]: Start difference. First operand 97 states and 175 transitions. Second operand 3 states. [2019-11-07 00:32:32,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:32,830 INFO L93 Difference]: Finished difference Result 184 states and 336 transitions. [2019-11-07 00:32:32,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:32,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-07 00:32:32,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:32,836 INFO L225 Difference]: With dead ends: 184 [2019-11-07 00:32:32,836 INFO L226 Difference]: Without dead ends: 182 [2019-11-07 00:32:32,838 INFO L630 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-11-07 00:32:32,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-07 00:32:32,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 128. [2019-11-07 00:32:32,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-07 00:32:32,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 232 transitions. [2019-11-07 00:32:32,863 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 232 transitions. Word has length 25 [2019-11-07 00:32:32,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:32,864 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 232 transitions. [2019-11-07 00:32:32,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:32,867 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 232 transitions. [2019-11-07 00:32:32,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-07 00:32:32,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:32,868 INFO L410 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-11-07 00:32:32,869 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:32,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:32,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1703207373, now seen corresponding path program 1 times [2019-11-07 00:32:32,870 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:32,871 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860045098] [2019-11-07 00:32:32,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:32,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:32,956 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860045098] [2019-11-07 00:32:32,956 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:32,956 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:32,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093156384] [2019-11-07 00:32:32,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:32,957 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:32,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:32,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:32,958 INFO L87 Difference]: Start difference. First operand 128 states and 232 transitions. Second operand 3 states. [2019-11-07 00:32:32,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:32,991 INFO L93 Difference]: Finished difference Result 304 states and 558 transitions. [2019-11-07 00:32:32,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:32,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-07 00:32:32,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:32,994 INFO L225 Difference]: With dead ends: 304 [2019-11-07 00:32:32,994 INFO L226 Difference]: Without dead ends: 184 [2019-11-07 00:32:32,996 INFO L630 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-11-07 00:32:32,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-07 00:32:33,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2019-11-07 00:32:33,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-11-07 00:32:33,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 330 transitions. [2019-11-07 00:32:33,021 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 330 transitions. Word has length 25 [2019-11-07 00:32:33,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:33,028 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 330 transitions. [2019-11-07 00:32:33,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:33,028 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 330 transitions. [2019-11-07 00:32:33,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-07 00:32:33,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:33,030 INFO L410 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-11-07 00:32:33,033 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:33,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:33,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1040789154, now seen corresponding path program 1 times [2019-11-07 00:32:33,034 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:33,034 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160022298] [2019-11-07 00:32:33,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:33,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:33,086 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160022298] [2019-11-07 00:32:33,087 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:33,087 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:33,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102808472] [2019-11-07 00:32:33,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:33,089 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:33,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:33,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:33,090 INFO L87 Difference]: Start difference. First operand 182 states and 330 transitions. Second operand 3 states. [2019-11-07 00:32:33,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:33,113 INFO L93 Difference]: Finished difference Result 273 states and 493 transitions. [2019-11-07 00:32:33,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:33,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-07 00:32:33,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:33,116 INFO L225 Difference]: With dead ends: 273 [2019-11-07 00:32:33,116 INFO L226 Difference]: Without dead ends: 186 [2019-11-07 00:32:33,119 INFO L630 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-11-07 00:32:33,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-07 00:32:33,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2019-11-07 00:32:33,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-07 00:32:33,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 330 transitions. [2019-11-07 00:32:33,135 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 330 transitions. Word has length 26 [2019-11-07 00:32:33,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:33,137 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 330 transitions. [2019-11-07 00:32:33,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:33,137 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 330 transitions. [2019-11-07 00:32:33,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-07 00:32:33,139 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:33,139 INFO L410 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-11-07 00:32:33,139 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:33,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:33,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1260033436, now seen corresponding path program 1 times [2019-11-07 00:32:33,140 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:33,140 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794285956] [2019-11-07 00:32:33,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:33,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:33,177 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794285956] [2019-11-07 00:32:33,178 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:33,178 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:33,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081383907] [2019-11-07 00:32:33,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:33,179 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:33,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:33,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:33,179 INFO L87 Difference]: Start difference. First operand 184 states and 330 transitions. Second operand 3 states. [2019-11-07 00:32:33,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:33,197 INFO L93 Difference]: Finished difference Result 348 states and 632 transitions. [2019-11-07 00:32:33,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:33,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-07 00:32:33,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:33,201 INFO L225 Difference]: With dead ends: 348 [2019-11-07 00:32:33,201 INFO L226 Difference]: Without dead ends: 346 [2019-11-07 00:32:33,202 INFO L630 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-11-07 00:32:33,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-11-07 00:32:33,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 248. [2019-11-07 00:32:33,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-11-07 00:32:33,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 442 transitions. [2019-11-07 00:32:33,211 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 442 transitions. Word has length 26 [2019-11-07 00:32:33,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:33,212 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 442 transitions. [2019-11-07 00:32:33,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:33,212 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 442 transitions. [2019-11-07 00:32:33,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-07 00:32:33,216 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:33,216 INFO L410 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-11-07 00:32:33,217 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:33,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:33,217 INFO L82 PathProgramCache]: Analyzing trace with hash -328314466, now seen corresponding path program 1 times [2019-11-07 00:32:33,217 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:33,217 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027209954] [2019-11-07 00:32:33,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:33,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:33,240 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027209954] [2019-11-07 00:32:33,241 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:33,241 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:33,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783384751] [2019-11-07 00:32:33,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:33,242 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:33,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:33,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:33,243 INFO L87 Difference]: Start difference. First operand 248 states and 442 transitions. Second operand 3 states. [2019-11-07 00:32:33,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:33,272 INFO L93 Difference]: Finished difference Result 592 states and 1064 transitions. [2019-11-07 00:32:33,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:33,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-07 00:32:33,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:33,274 INFO L225 Difference]: With dead ends: 592 [2019-11-07 00:32:33,275 INFO L226 Difference]: Without dead ends: 354 [2019-11-07 00:32:33,276 INFO L630 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-11-07 00:32:33,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-11-07 00:32:33,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2019-11-07 00:32:33,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-11-07 00:32:33,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 626 transitions. [2019-11-07 00:32:33,288 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 626 transitions. Word has length 26 [2019-11-07 00:32:33,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:33,289 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 626 transitions. [2019-11-07 00:32:33,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:33,289 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 626 transitions. [2019-11-07 00:32:33,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-07 00:32:33,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:33,290 INFO L410 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-11-07 00:32:33,291 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:33,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:33,291 INFO L82 PathProgramCache]: Analyzing trace with hash 406543618, now seen corresponding path program 1 times [2019-11-07 00:32:33,291 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:33,291 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810012091] [2019-11-07 00:32:33,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:33,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:33,326 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810012091] [2019-11-07 00:32:33,326 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:33,326 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:33,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011349220] [2019-11-07 00:32:33,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:33,328 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:33,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:33,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:33,329 INFO L87 Difference]: Start difference. First operand 352 states and 626 transitions. Second operand 3 states. [2019-11-07 00:32:33,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:33,348 INFO L93 Difference]: Finished difference Result 528 states and 936 transitions. [2019-11-07 00:32:33,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:33,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-07 00:32:33,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:33,351 INFO L225 Difference]: With dead ends: 528 [2019-11-07 00:32:33,352 INFO L226 Difference]: Without dead ends: 358 [2019-11-07 00:32:33,353 INFO L630 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-11-07 00:32:33,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-11-07 00:32:33,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-11-07 00:32:33,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-07 00:32:33,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 626 transitions. [2019-11-07 00:32:33,363 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 626 transitions. Word has length 27 [2019-11-07 00:32:33,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:33,364 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 626 transitions. [2019-11-07 00:32:33,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:33,364 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 626 transitions. [2019-11-07 00:32:33,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-07 00:32:33,365 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:33,365 INFO L410 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-11-07 00:32:33,365 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:33,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:33,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1587601088, now seen corresponding path program 1 times [2019-11-07 00:32:33,366 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:33,366 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611205082] [2019-11-07 00:32:33,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:33,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:33,390 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611205082] [2019-11-07 00:32:33,390 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:33,391 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:33,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516461220] [2019-11-07 00:32:33,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:33,391 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:33,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:33,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:33,392 INFO L87 Difference]: Start difference. First operand 356 states and 626 transitions. Second operand 3 states. [2019-11-07 00:32:33,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:33,414 INFO L93 Difference]: Finished difference Result 668 states and 1192 transitions. [2019-11-07 00:32:33,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:33,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-07 00:32:33,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:33,418 INFO L225 Difference]: With dead ends: 668 [2019-11-07 00:32:33,418 INFO L226 Difference]: Without dead ends: 666 [2019-11-07 00:32:33,419 INFO L630 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-11-07 00:32:33,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-11-07 00:32:33,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 488. [2019-11-07 00:32:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-11-07 00:32:33,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 846 transitions. [2019-11-07 00:32:33,433 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 846 transitions. Word has length 27 [2019-11-07 00:32:33,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:33,433 INFO L462 AbstractCegarLoop]: Abstraction has 488 states and 846 transitions. [2019-11-07 00:32:33,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:33,434 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 846 transitions. [2019-11-07 00:32:33,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-07 00:32:33,435 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:33,435 INFO L410 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-11-07 00:32:33,435 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:33,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:33,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1119018306, now seen corresponding path program 1 times [2019-11-07 00:32:33,436 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:33,436 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490709029] [2019-11-07 00:32:33,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:33,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:33,458 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490709029] [2019-11-07 00:32:33,459 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:33,459 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:33,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981879058] [2019-11-07 00:32:33,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:33,460 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:33,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:33,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:33,460 INFO L87 Difference]: Start difference. First operand 488 states and 846 transitions. Second operand 3 states. [2019-11-07 00:32:33,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:33,494 INFO L93 Difference]: Finished difference Result 1164 states and 2032 transitions. [2019-11-07 00:32:33,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:33,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-07 00:32:33,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:33,500 INFO L225 Difference]: With dead ends: 1164 [2019-11-07 00:32:33,500 INFO L226 Difference]: Without dead ends: 690 [2019-11-07 00:32:33,502 INFO L630 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-11-07 00:32:33,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-11-07 00:32:33,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 688. [2019-11-07 00:32:33,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2019-11-07 00:32:33,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1190 transitions. [2019-11-07 00:32:33,523 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1190 transitions. Word has length 27 [2019-11-07 00:32:33,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:33,524 INFO L462 AbstractCegarLoop]: Abstraction has 688 states and 1190 transitions. [2019-11-07 00:32:33,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:33,524 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1190 transitions. [2019-11-07 00:32:33,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-07 00:32:33,525 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:33,525 INFO L410 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-11-07 00:32:33,525 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:33,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:33,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1970780365, now seen corresponding path program 1 times [2019-11-07 00:32:33,526 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:33,526 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463954809] [2019-11-07 00:32:33,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:33,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:33,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:33,563 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463954809] [2019-11-07 00:32:33,563 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:33,563 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:33,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097770549] [2019-11-07 00:32:33,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:33,564 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:33,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:33,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:33,565 INFO L87 Difference]: Start difference. First operand 688 states and 1190 transitions. Second operand 3 states. [2019-11-07 00:32:33,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:33,595 INFO L93 Difference]: Finished difference Result 1032 states and 1780 transitions. [2019-11-07 00:32:33,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:33,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-07 00:32:33,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:33,599 INFO L225 Difference]: With dead ends: 1032 [2019-11-07 00:32:33,600 INFO L226 Difference]: Without dead ends: 698 [2019-11-07 00:32:33,601 INFO L630 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-11-07 00:32:33,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-11-07 00:32:33,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2019-11-07 00:32:33,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-11-07 00:32:33,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1190 transitions. [2019-11-07 00:32:33,619 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1190 transitions. Word has length 28 [2019-11-07 00:32:33,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:33,619 INFO L462 AbstractCegarLoop]: Abstraction has 696 states and 1190 transitions. [2019-11-07 00:32:33,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:33,619 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1190 transitions. [2019-11-07 00:32:33,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-07 00:32:33,621 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:33,621 INFO L410 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-11-07 00:32:33,621 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:33,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:33,621 INFO L82 PathProgramCache]: Analyzing trace with hash 330042225, now seen corresponding path program 1 times [2019-11-07 00:32:33,622 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:33,622 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955958858] [2019-11-07 00:32:33,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:33,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:33,652 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955958858] [2019-11-07 00:32:33,653 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:33,653 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:33,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026858187] [2019-11-07 00:32:33,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:33,654 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:33,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:33,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:33,654 INFO L87 Difference]: Start difference. First operand 696 states and 1190 transitions. Second operand 3 states. [2019-11-07 00:32:33,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:33,683 INFO L93 Difference]: Finished difference Result 1292 states and 2248 transitions. [2019-11-07 00:32:33,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:33,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-07 00:32:33,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:33,691 INFO L225 Difference]: With dead ends: 1292 [2019-11-07 00:32:33,691 INFO L226 Difference]: Without dead ends: 1290 [2019-11-07 00:32:33,692 INFO L630 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-11-07 00:32:33,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2019-11-07 00:32:33,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 968. [2019-11-07 00:32:33,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-11-07 00:32:33,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1622 transitions. [2019-11-07 00:32:33,735 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1622 transitions. Word has length 28 [2019-11-07 00:32:33,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:33,736 INFO L462 AbstractCegarLoop]: Abstraction has 968 states and 1622 transitions. [2019-11-07 00:32:33,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:33,737 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1622 transitions. [2019-11-07 00:32:33,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-07 00:32:33,739 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:33,739 INFO L410 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-11-07 00:32:33,739 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:33,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:33,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1258305677, now seen corresponding path program 1 times [2019-11-07 00:32:33,740 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:33,740 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591612259] [2019-11-07 00:32:33,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:33,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:33,764 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591612259] [2019-11-07 00:32:33,764 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:33,764 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:33,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882007903] [2019-11-07 00:32:33,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:33,765 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:33,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:33,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:33,766 INFO L87 Difference]: Start difference. First operand 968 states and 1622 transitions. Second operand 3 states. [2019-11-07 00:32:33,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:33,813 INFO L93 Difference]: Finished difference Result 2300 states and 3880 transitions. [2019-11-07 00:32:33,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:33,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-07 00:32:33,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:33,821 INFO L225 Difference]: With dead ends: 2300 [2019-11-07 00:32:33,821 INFO L226 Difference]: Without dead ends: 1354 [2019-11-07 00:32:33,823 INFO L630 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-11-07 00:32:33,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-11-07 00:32:33,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2019-11-07 00:32:33,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-11-07 00:32:33,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2262 transitions. [2019-11-07 00:32:33,862 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2262 transitions. Word has length 28 [2019-11-07 00:32:33,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:33,862 INFO L462 AbstractCegarLoop]: Abstraction has 1352 states and 2262 transitions. [2019-11-07 00:32:33,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:33,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2262 transitions. [2019-11-07 00:32:33,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-07 00:32:33,865 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:33,865 INFO L410 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-11-07 00:32:33,865 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:33,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:33,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1641587831, now seen corresponding path program 1 times [2019-11-07 00:32:33,866 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:33,866 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663021163] [2019-11-07 00:32:33,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:33,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:33,892 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663021163] [2019-11-07 00:32:33,893 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:33,893 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:33,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20271784] [2019-11-07 00:32:33,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:33,894 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:33,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:33,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:33,894 INFO L87 Difference]: Start difference. First operand 1352 states and 2262 transitions. Second operand 3 states. [2019-11-07 00:32:33,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:33,923 INFO L93 Difference]: Finished difference Result 2028 states and 3384 transitions. [2019-11-07 00:32:33,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:33,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-07 00:32:33,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:33,930 INFO L225 Difference]: With dead ends: 2028 [2019-11-07 00:32:33,930 INFO L226 Difference]: Without dead ends: 1370 [2019-11-07 00:32:33,932 INFO L630 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-11-07 00:32:33,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2019-11-07 00:32:33,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1368. [2019-11-07 00:32:33,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2019-11-07 00:32:33,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2262 transitions. [2019-11-07 00:32:33,975 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2262 transitions. Word has length 29 [2019-11-07 00:32:33,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:33,976 INFO L462 AbstractCegarLoop]: Abstraction has 1368 states and 2262 transitions. [2019-11-07 00:32:33,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:33,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2262 transitions. [2019-11-07 00:32:33,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-07 00:32:33,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:33,978 INFO L410 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-11-07 00:32:33,978 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:33,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:33,978 INFO L82 PathProgramCache]: Analyzing trace with hash -352556875, now seen corresponding path program 1 times [2019-11-07 00:32:33,979 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:33,979 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157081486] [2019-11-07 00:32:33,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:34,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:34,017 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157081486] [2019-11-07 00:32:34,017 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:34,017 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:34,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605696974] [2019-11-07 00:32:34,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:34,019 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:34,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:34,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:34,020 INFO L87 Difference]: Start difference. First operand 1368 states and 2262 transitions. Second operand 3 states. [2019-11-07 00:32:34,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:34,053 INFO L93 Difference]: Finished difference Result 2508 states and 4232 transitions. [2019-11-07 00:32:34,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:34,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-07 00:32:34,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:34,066 INFO L225 Difference]: With dead ends: 2508 [2019-11-07 00:32:34,066 INFO L226 Difference]: Without dead ends: 2506 [2019-11-07 00:32:34,067 INFO L630 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-11-07 00:32:34,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2019-11-07 00:32:34,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 1928. [2019-11-07 00:32:34,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2019-11-07 00:32:34,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 3110 transitions. [2019-11-07 00:32:34,120 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 3110 transitions. Word has length 29 [2019-11-07 00:32:34,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:34,120 INFO L462 AbstractCegarLoop]: Abstraction has 1928 states and 3110 transitions. [2019-11-07 00:32:34,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:34,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 3110 transitions. [2019-11-07 00:32:34,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-07 00:32:34,123 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:34,123 INFO L410 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-11-07 00:32:34,124 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:34,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:34,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1940904777, now seen corresponding path program 1 times [2019-11-07 00:32:34,124 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:34,124 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841291048] [2019-11-07 00:32:34,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:34,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:34,151 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841291048] [2019-11-07 00:32:34,152 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:34,152 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:34,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605320488] [2019-11-07 00:32:34,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:34,154 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:34,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:34,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:34,154 INFO L87 Difference]: Start difference. First operand 1928 states and 3110 transitions. Second operand 3 states. [2019-11-07 00:32:34,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:34,207 INFO L93 Difference]: Finished difference Result 4556 states and 7400 transitions. [2019-11-07 00:32:34,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:34,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-07 00:32:34,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:34,219 INFO L225 Difference]: With dead ends: 4556 [2019-11-07 00:32:34,220 INFO L226 Difference]: Without dead ends: 2666 [2019-11-07 00:32:34,224 INFO L630 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-11-07 00:32:34,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2019-11-07 00:32:34,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2664. [2019-11-07 00:32:34,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2664 states. [2019-11-07 00:32:34,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 4294 transitions. [2019-11-07 00:32:34,288 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 4294 transitions. Word has length 29 [2019-11-07 00:32:34,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:34,288 INFO L462 AbstractCegarLoop]: Abstraction has 2664 states and 4294 transitions. [2019-11-07 00:32:34,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:34,289 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 4294 transitions. [2019-11-07 00:32:34,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-07 00:32:34,292 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:34,292 INFO L410 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-11-07 00:32:34,292 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:34,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:34,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1955852552, now seen corresponding path program 1 times [2019-11-07 00:32:34,293 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:34,293 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196141145] [2019-11-07 00:32:34,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:34,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:34,334 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196141145] [2019-11-07 00:32:34,334 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:34,334 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:34,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293047417] [2019-11-07 00:32:34,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:34,335 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:34,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:34,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:34,336 INFO L87 Difference]: Start difference. First operand 2664 states and 4294 transitions. Second operand 3 states. [2019-11-07 00:32:34,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:34,374 INFO L93 Difference]: Finished difference Result 3996 states and 6424 transitions. [2019-11-07 00:32:34,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:34,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-07 00:32:34,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:34,386 INFO L225 Difference]: With dead ends: 3996 [2019-11-07 00:32:34,386 INFO L226 Difference]: Without dead ends: 2698 [2019-11-07 00:32:34,390 INFO L630 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-11-07 00:32:34,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2019-11-07 00:32:34,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2696. [2019-11-07 00:32:34,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2696 states. [2019-11-07 00:32:34,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 4294 transitions. [2019-11-07 00:32:34,452 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 4294 transitions. Word has length 30 [2019-11-07 00:32:34,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:34,453 INFO L462 AbstractCegarLoop]: Abstraction has 2696 states and 4294 transitions. [2019-11-07 00:32:34,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:34,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 4294 transitions. [2019-11-07 00:32:34,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-07 00:32:34,456 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:34,456 INFO L410 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-11-07 00:32:34,456 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:34,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:34,457 INFO L82 PathProgramCache]: Analyzing trace with hash -38292154, now seen corresponding path program 1 times [2019-11-07 00:32:34,457 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:34,457 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346088175] [2019-11-07 00:32:34,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:34,476 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346088175] [2019-11-07 00:32:34,477 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:34,477 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:34,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132019488] [2019-11-07 00:32:34,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:34,477 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:34,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:34,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:34,478 INFO L87 Difference]: Start difference. First operand 2696 states and 4294 transitions. Second operand 3 states. [2019-11-07 00:32:34,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:34,534 INFO L93 Difference]: Finished difference Result 4876 states and 7944 transitions. [2019-11-07 00:32:34,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:34,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-07 00:32:34,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:34,563 INFO L225 Difference]: With dead ends: 4876 [2019-11-07 00:32:34,563 INFO L226 Difference]: Without dead ends: 4874 [2019-11-07 00:32:34,565 INFO L630 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-11-07 00:32:34,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2019-11-07 00:32:34,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 3848. [2019-11-07 00:32:34,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3848 states. [2019-11-07 00:32:34,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3848 states to 3848 states and 5958 transitions. [2019-11-07 00:32:34,702 INFO L78 Accepts]: Start accepts. Automaton has 3848 states and 5958 transitions. Word has length 30 [2019-11-07 00:32:34,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:34,702 INFO L462 AbstractCegarLoop]: Abstraction has 3848 states and 5958 transitions. [2019-11-07 00:32:34,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:34,702 INFO L276 IsEmpty]: Start isEmpty. Operand 3848 states and 5958 transitions. [2019-11-07 00:32:34,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-07 00:32:34,709 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:34,709 INFO L410 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-11-07 00:32:34,709 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:34,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:34,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1626640056, now seen corresponding path program 1 times [2019-11-07 00:32:34,710 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:34,710 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019558892] [2019-11-07 00:32:34,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:34,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:34,735 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019558892] [2019-11-07 00:32:34,735 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:34,735 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:34,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156726438] [2019-11-07 00:32:34,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:34,736 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:34,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:34,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:34,737 INFO L87 Difference]: Start difference. First operand 3848 states and 5958 transitions. Second operand 3 states. [2019-11-07 00:32:34,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:34,856 INFO L93 Difference]: Finished difference Result 9036 states and 14088 transitions. [2019-11-07 00:32:34,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:34,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-07 00:32:34,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:34,878 INFO L225 Difference]: With dead ends: 9036 [2019-11-07 00:32:34,879 INFO L226 Difference]: Without dead ends: 5258 [2019-11-07 00:32:34,886 INFO L630 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-11-07 00:32:34,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2019-11-07 00:32:35,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 5256. [2019-11-07 00:32:35,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5256 states. [2019-11-07 00:32:35,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5256 states to 5256 states and 8134 transitions. [2019-11-07 00:32:35,031 INFO L78 Accepts]: Start accepts. Automaton has 5256 states and 8134 transitions. Word has length 30 [2019-11-07 00:32:35,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:35,031 INFO L462 AbstractCegarLoop]: Abstraction has 5256 states and 8134 transitions. [2019-11-07 00:32:35,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:35,032 INFO L276 IsEmpty]: Start isEmpty. Operand 5256 states and 8134 transitions. [2019-11-07 00:32:35,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-07 00:32:35,038 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:35,038 INFO L410 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-11-07 00:32:35,038 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:35,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:35,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1186842644, now seen corresponding path program 1 times [2019-11-07 00:32:35,039 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:35,039 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378005146] [2019-11-07 00:32:35,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:35,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:35,060 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378005146] [2019-11-07 00:32:35,060 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:35,060 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:35,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418023845] [2019-11-07 00:32:35,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:35,061 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:35,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:35,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:35,065 INFO L87 Difference]: Start difference. First operand 5256 states and 8134 transitions. Second operand 3 states. [2019-11-07 00:32:35,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:35,128 INFO L93 Difference]: Finished difference Result 7884 states and 12168 transitions. [2019-11-07 00:32:35,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:35,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-07 00:32:35,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:35,139 INFO L225 Difference]: With dead ends: 7884 [2019-11-07 00:32:35,140 INFO L226 Difference]: Without dead ends: 5322 [2019-11-07 00:32:35,145 INFO L630 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-11-07 00:32:35,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2019-11-07 00:32:35,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 5320. [2019-11-07 00:32:35,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5320 states. [2019-11-07 00:32:35,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5320 states to 5320 states and 8134 transitions. [2019-11-07 00:32:35,254 INFO L78 Accepts]: Start accepts. Automaton has 5320 states and 8134 transitions. Word has length 31 [2019-11-07 00:32:35,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:35,255 INFO L462 AbstractCegarLoop]: Abstraction has 5320 states and 8134 transitions. [2019-11-07 00:32:35,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:35,255 INFO L276 IsEmpty]: Start isEmpty. Operand 5320 states and 8134 transitions. [2019-11-07 00:32:35,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-07 00:32:35,261 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:35,262 INFO L410 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-11-07 00:32:35,262 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:35,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:35,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1113979946, now seen corresponding path program 1 times [2019-11-07 00:32:35,263 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:35,263 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355527276] [2019-11-07 00:32:35,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:35,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:35,288 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355527276] [2019-11-07 00:32:35,288 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:35,288 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:35,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938333541] [2019-11-07 00:32:35,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:35,289 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:35,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:35,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:35,290 INFO L87 Difference]: Start difference. First operand 5320 states and 8134 transitions. Second operand 3 states. [2019-11-07 00:32:35,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:35,442 INFO L93 Difference]: Finished difference Result 15564 states and 23624 transitions. [2019-11-07 00:32:35,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:35,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-07 00:32:35,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:35,463 INFO L225 Difference]: With dead ends: 15564 [2019-11-07 00:32:35,463 INFO L226 Difference]: Without dead ends: 10378 [2019-11-07 00:32:35,473 INFO L630 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-11-07 00:32:35,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10378 states. [2019-11-07 00:32:35,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10378 to 10376. [2019-11-07 00:32:35,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2019-11-07 00:32:35,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15494 transitions. [2019-11-07 00:32:35,657 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15494 transitions. Word has length 31 [2019-11-07 00:32:35,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:35,657 INFO L462 AbstractCegarLoop]: Abstraction has 10376 states and 15494 transitions. [2019-11-07 00:32:35,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:35,658 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15494 transitions. [2019-11-07 00:32:35,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-07 00:32:35,674 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:35,674 INFO L410 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-11-07 00:32:35,675 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:35,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:35,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1592639448, now seen corresponding path program 1 times [2019-11-07 00:32:35,676 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:35,676 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191250947] [2019-11-07 00:32:35,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:35,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:35,700 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191250947] [2019-11-07 00:32:35,700 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:35,701 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:35,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061139351] [2019-11-07 00:32:35,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:35,702 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:35,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:35,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:35,706 INFO L87 Difference]: Start difference. First operand 10376 states and 15494 transitions. Second operand 3 states. [2019-11-07 00:32:35,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:35,869 INFO L93 Difference]: Finished difference Result 12172 states and 18824 transitions. [2019-11-07 00:32:35,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:35,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-07 00:32:35,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:35,891 INFO L225 Difference]: With dead ends: 12172 [2019-11-07 00:32:35,892 INFO L226 Difference]: Without dead ends: 12170 [2019-11-07 00:32:35,894 INFO L630 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-11-07 00:32:35,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2019-11-07 00:32:36,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 10376. [2019-11-07 00:32:36,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2019-11-07 00:32:36,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15366 transitions. [2019-11-07 00:32:36,081 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15366 transitions. Word has length 31 [2019-11-07 00:32:36,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:36,081 INFO L462 AbstractCegarLoop]: Abstraction has 10376 states and 15366 transitions. [2019-11-07 00:32:36,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:36,081 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15366 transitions. [2019-11-07 00:32:36,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-07 00:32:36,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:36,093 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:36,093 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:36,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:36,093 INFO L82 PathProgramCache]: Analyzing trace with hash 173854429, now seen corresponding path program 1 times [2019-11-07 00:32:36,093 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:36,094 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128322403] [2019-11-07 00:32:36,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:36,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:36,114 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128322403] [2019-11-07 00:32:36,114 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:36,115 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:36,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154873485] [2019-11-07 00:32:36,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:36,115 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:36,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:36,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:36,116 INFO L87 Difference]: Start difference. First operand 10376 states and 15366 transitions. Second operand 3 states. [2019-11-07 00:32:36,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:36,262 INFO L93 Difference]: Finished difference Result 18316 states and 27784 transitions. [2019-11-07 00:32:36,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:36,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-07 00:32:36,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:36,303 INFO L225 Difference]: With dead ends: 18316 [2019-11-07 00:32:36,303 INFO L226 Difference]: Without dead ends: 18314 [2019-11-07 00:32:36,310 INFO L630 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-11-07 00:32:36,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18314 states. [2019-11-07 00:32:36,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18314 to 15240. [2019-11-07 00:32:36,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15240 states. [2019-11-07 00:32:36,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15240 states to 15240 states and 21894 transitions. [2019-11-07 00:32:36,650 INFO L78 Accepts]: Start accepts. Automaton has 15240 states and 21894 transitions. Word has length 32 [2019-11-07 00:32:36,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:36,650 INFO L462 AbstractCegarLoop]: Abstraction has 15240 states and 21894 transitions. [2019-11-07 00:32:36,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:36,650 INFO L276 IsEmpty]: Start isEmpty. Operand 15240 states and 21894 transitions. [2019-11-07 00:32:36,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-07 00:32:36,670 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:36,671 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:36,671 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:36,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:36,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1414493473, now seen corresponding path program 1 times [2019-11-07 00:32:36,671 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:36,672 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239044184] [2019-11-07 00:32:36,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:36,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-11-07 00:32:36,687 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239044184] [2019-11-07 00:32:36,688 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:36,688 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:36,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447987452] [2019-11-07 00:32:36,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:36,689 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:36,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:36,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:36,689 INFO L87 Difference]: Start difference. First operand 15240 states and 21894 transitions. Second operand 3 states. [2019-11-07 00:32:37,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:37,008 INFO L93 Difference]: Finished difference Result 35468 states and 51336 transitions. [2019-11-07 00:32:37,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:37,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-07 00:32:37,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:37,077 INFO L225 Difference]: With dead ends: 35468 [2019-11-07 00:32:37,077 INFO L226 Difference]: Without dead ends: 20362 [2019-11-07 00:32:37,106 INFO L630 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-11-07 00:32:37,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20362 states. [2019-11-07 00:32:37,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20362 to 20360. [2019-11-07 00:32:37,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20360 states. [2019-11-07 00:32:37,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20360 states to 20360 states and 29190 transitions. [2019-11-07 00:32:37,447 INFO L78 Accepts]: Start accepts. Automaton has 20360 states and 29190 transitions. Word has length 32 [2019-11-07 00:32:37,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:37,447 INFO L462 AbstractCegarLoop]: Abstraction has 20360 states and 29190 transitions. [2019-11-07 00:32:37,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:37,447 INFO L276 IsEmpty]: Start isEmpty. Operand 20360 states and 29190 transitions. [2019-11-07 00:32:37,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-07 00:32:37,469 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:37,470 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:37,470 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:37,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:37,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1094734815, now seen corresponding path program 1 times [2019-11-07 00:32:37,470 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:37,471 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481498204] [2019-11-07 00:32:37,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:37,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:37,491 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481498204] [2019-11-07 00:32:37,492 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:37,492 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:37,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527050077] [2019-11-07 00:32:37,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:37,492 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:37,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:37,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:37,493 INFO L87 Difference]: Start difference. First operand 20360 states and 29190 transitions. Second operand 3 states. [2019-11-07 00:32:38,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:38,178 INFO L93 Difference]: Finished difference Result 30732 states and 44040 transitions. [2019-11-07 00:32:38,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:38,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-07 00:32:38,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:38,217 INFO L225 Difference]: With dead ends: 30732 [2019-11-07 00:32:38,218 INFO L226 Difference]: Without dead ends: 20746 [2019-11-07 00:32:38,238 INFO L630 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-11-07 00:32:38,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20746 states. [2019-11-07 00:32:38,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20746 to 20744. [2019-11-07 00:32:38,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20744 states. [2019-11-07 00:32:38,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20744 states to 20744 states and 29446 transitions. [2019-11-07 00:32:38,587 INFO L78 Accepts]: Start accepts. Automaton has 20744 states and 29446 transitions. Word has length 33 [2019-11-07 00:32:38,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:38,588 INFO L462 AbstractCegarLoop]: Abstraction has 20744 states and 29446 transitions. [2019-11-07 00:32:38,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:38,588 INFO L276 IsEmpty]: Start isEmpty. Operand 20744 states and 29446 transitions. [2019-11-07 00:32:38,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-07 00:32:38,611 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:38,611 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:38,612 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:38,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:38,612 INFO L82 PathProgramCache]: Analyzing trace with hash -899409891, now seen corresponding path program 1 times [2019-11-07 00:32:38,612 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:38,613 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007615089] [2019-11-07 00:32:38,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:38,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:38,630 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007615089] [2019-11-07 00:32:38,630 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:38,630 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:38,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870620447] [2019-11-07 00:32:38,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:38,631 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:38,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:38,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:38,632 INFO L87 Difference]: Start difference. First operand 20744 states and 29446 transitions. Second operand 3 states. [2019-11-07 00:32:39,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:39,003 INFO L93 Difference]: Finished difference Result 35852 states and 51976 transitions. [2019-11-07 00:32:39,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:39,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-07 00:32:39,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:39,043 INFO L225 Difference]: With dead ends: 35852 [2019-11-07 00:32:39,044 INFO L226 Difference]: Without dead ends: 35850 [2019-11-07 00:32:39,052 INFO L630 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-11-07 00:32:39,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35850 states. [2019-11-07 00:32:39,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35850 to 30728. [2019-11-07 00:32:39,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30728 states. [2019-11-07 00:32:39,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30728 states to 30728 states and 42246 transitions. [2019-11-07 00:32:39,721 INFO L78 Accepts]: Start accepts. Automaton has 30728 states and 42246 transitions. Word has length 33 [2019-11-07 00:32:39,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:39,721 INFO L462 AbstractCegarLoop]: Abstraction has 30728 states and 42246 transitions. [2019-11-07 00:32:39,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:39,721 INFO L276 IsEmpty]: Start isEmpty. Operand 30728 states and 42246 transitions. [2019-11-07 00:32:39,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-07 00:32:39,752 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:39,752 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:39,752 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:39,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:39,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1807209503, now seen corresponding path program 1 times [2019-11-07 00:32:39,753 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:39,753 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103319918] [2019-11-07 00:32:39,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:39,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:39,800 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103319918] [2019-11-07 00:32:39,801 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:39,801 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:39,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324175942] [2019-11-07 00:32:39,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:39,801 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:39,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:39,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:39,802 INFO L87 Difference]: Start difference. First operand 30728 states and 42246 transitions. Second operand 3 states. [2019-11-07 00:32:40,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:40,199 INFO L93 Difference]: Finished difference Result 70668 states and 97544 transitions. [2019-11-07 00:32:40,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:40,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-07 00:32:40,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:40,245 INFO L225 Difference]: With dead ends: 70668 [2019-11-07 00:32:40,245 INFO L226 Difference]: Without dead ends: 40458 [2019-11-07 00:32:40,298 INFO L630 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-11-07 00:32:40,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40458 states. [2019-11-07 00:32:41,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40458 to 40456. [2019-11-07 00:32:41,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40456 states. [2019-11-07 00:32:41,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40456 states to 40456 states and 55302 transitions. [2019-11-07 00:32:41,672 INFO L78 Accepts]: Start accepts. Automaton has 40456 states and 55302 transitions. Word has length 33 [2019-11-07 00:32:41,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:41,672 INFO L462 AbstractCegarLoop]: Abstraction has 40456 states and 55302 transitions. [2019-11-07 00:32:41,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:41,672 INFO L276 IsEmpty]: Start isEmpty. Operand 40456 states and 55302 transitions. [2019-11-07 00:32:41,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-07 00:32:41,695 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:41,695 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:41,695 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:41,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:41,695 INFO L82 PathProgramCache]: Analyzing trace with hash -2111687692, now seen corresponding path program 1 times [2019-11-07 00:32:41,695 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:41,696 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400430529] [2019-11-07 00:32:41,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:41,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:41,714 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400430529] [2019-11-07 00:32:41,715 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:41,715 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:41,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675642395] [2019-11-07 00:32:41,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:41,716 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:41,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:41,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:41,716 INFO L87 Difference]: Start difference. First operand 40456 states and 55302 transitions. Second operand 3 states. [2019-11-07 00:32:42,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:42,036 INFO L93 Difference]: Finished difference Result 60684 states and 82696 transitions. [2019-11-07 00:32:42,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:42,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-07 00:32:42,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:42,083 INFO L225 Difference]: With dead ends: 60684 [2019-11-07 00:32:42,084 INFO L226 Difference]: Without dead ends: 40970 [2019-11-07 00:32:42,110 INFO L630 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-11-07 00:32:42,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40970 states. [2019-11-07 00:32:42,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40970 to 40968. [2019-11-07 00:32:42,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40968 states. [2019-11-07 00:32:42,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40968 states to 40968 states and 55302 transitions. [2019-11-07 00:32:42,804 INFO L78 Accepts]: Start accepts. Automaton has 40968 states and 55302 transitions. Word has length 34 [2019-11-07 00:32:42,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:42,804 INFO L462 AbstractCegarLoop]: Abstraction has 40968 states and 55302 transitions. [2019-11-07 00:32:42,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:42,805 INFO L276 IsEmpty]: Start isEmpty. Operand 40968 states and 55302 transitions. [2019-11-07 00:32:42,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-07 00:32:42,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:42,829 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:42,830 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:42,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:42,831 INFO L82 PathProgramCache]: Analyzing trace with hash 189134898, now seen corresponding path program 1 times [2019-11-07 00:32:42,831 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:42,831 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83090804] [2019-11-07 00:32:42,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:42,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:42,849 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83090804] [2019-11-07 00:32:42,850 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:42,850 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:42,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880422439] [2019-11-07 00:32:42,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:42,851 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:42,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:42,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:42,852 INFO L87 Difference]: Start difference. First operand 40968 states and 55302 transitions. Second operand 3 states. [2019-11-07 00:32:43,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:43,191 INFO L93 Difference]: Finished difference Result 69644 states and 95752 transitions. [2019-11-07 00:32:43,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:43,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-07 00:32:43,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:43,255 INFO L225 Difference]: With dead ends: 69644 [2019-11-07 00:32:43,256 INFO L226 Difference]: Without dead ends: 69642 [2019-11-07 00:32:43,277 INFO L630 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-11-07 00:32:43,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69642 states. [2019-11-07 00:32:44,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69642 to 61448. [2019-11-07 00:32:44,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61448 states. [2019-11-07 00:32:44,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61448 states to 61448 states and 80390 transitions. [2019-11-07 00:32:44,195 INFO L78 Accepts]: Start accepts. Automaton has 61448 states and 80390 transitions. Word has length 34 [2019-11-07 00:32:44,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:44,195 INFO L462 AbstractCegarLoop]: Abstraction has 61448 states and 80390 transitions. [2019-11-07 00:32:44,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:44,196 INFO L276 IsEmpty]: Start isEmpty. Operand 61448 states and 80390 transitions. [2019-11-07 00:32:44,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-07 00:32:44,238 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:44,239 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:44,239 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:44,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:44,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1399213004, now seen corresponding path program 1 times [2019-11-07 00:32:44,239 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:44,240 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117341358] [2019-11-07 00:32:44,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:44,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:44,261 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117341358] [2019-11-07 00:32:44,261 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:44,261 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:44,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300962306] [2019-11-07 00:32:44,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:44,262 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:44,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:44,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:44,262 INFO L87 Difference]: Start difference. First operand 61448 states and 80390 transitions. Second operand 3 states. [2019-11-07 00:32:44,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:44,988 INFO L93 Difference]: Finished difference Result 140300 states and 183816 transitions. [2019-11-07 00:32:44,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:44,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-07 00:32:44,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:45,080 INFO L225 Difference]: With dead ends: 140300 [2019-11-07 00:32:45,081 INFO L226 Difference]: Without dead ends: 79882 [2019-11-07 00:32:45,121 INFO L630 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-11-07 00:32:45,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79882 states. [2019-11-07 00:32:47,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79882 to 79880. [2019-11-07 00:32:47,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79880 states. [2019-11-07 00:32:47,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79880 states to 79880 states and 103430 transitions. [2019-11-07 00:32:47,729 INFO L78 Accepts]: Start accepts. Automaton has 79880 states and 103430 transitions. Word has length 34 [2019-11-07 00:32:47,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:47,730 INFO L462 AbstractCegarLoop]: Abstraction has 79880 states and 103430 transitions. [2019-11-07 00:32:47,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:47,730 INFO L276 IsEmpty]: Start isEmpty. Operand 79880 states and 103430 transitions. [2019-11-07 00:32:47,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-07 00:32:47,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:47,775 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:47,775 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:47,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:47,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1568430036, now seen corresponding path program 1 times [2019-11-07 00:32:47,776 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:47,776 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157423971] [2019-11-07 00:32:47,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:47,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:47,795 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157423971] [2019-11-07 00:32:47,798 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:47,798 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:47,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701051299] [2019-11-07 00:32:47,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:47,799 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:47,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:47,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:47,799 INFO L87 Difference]: Start difference. First operand 79880 states and 103430 transitions. Second operand 3 states. [2019-11-07 00:32:48,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:48,433 INFO L93 Difference]: Finished difference Result 119820 states and 154632 transitions. [2019-11-07 00:32:48,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:48,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-07 00:32:48,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:48,507 INFO L225 Difference]: With dead ends: 119820 [2019-11-07 00:32:48,507 INFO L226 Difference]: Without dead ends: 80906 [2019-11-07 00:32:48,544 INFO L630 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-11-07 00:32:48,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80906 states. [2019-11-07 00:32:49,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80906 to 80904. [2019-11-07 00:32:49,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80904 states. [2019-11-07 00:32:50,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80904 states to 80904 states and 103430 transitions. [2019-11-07 00:32:50,004 INFO L78 Accepts]: Start accepts. Automaton has 80904 states and 103430 transitions. Word has length 35 [2019-11-07 00:32:50,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:50,005 INFO L462 AbstractCegarLoop]: Abstraction has 80904 states and 103430 transitions. [2019-11-07 00:32:50,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:50,005 INFO L276 IsEmpty]: Start isEmpty. Operand 80904 states and 103430 transitions. [2019-11-07 00:32:50,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-07 00:32:50,054 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:50,054 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:50,054 INFO L410 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:50,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:50,055 INFO L82 PathProgramCache]: Analyzing trace with hash -425714670, now seen corresponding path program 1 times [2019-11-07 00:32:50,055 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:50,055 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586857104] [2019-11-07 00:32:50,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:50,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:50,132 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586857104] [2019-11-07 00:32:50,132 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:50,132 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:50,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676876631] [2019-11-07 00:32:50,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:50,133 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:50,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:50,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:50,134 INFO L87 Difference]: Start difference. First operand 80904 states and 103430 transitions. Second operand 3 states. [2019-11-07 00:32:52,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:52,971 INFO L93 Difference]: Finished difference Result 135180 states and 175112 transitions. [2019-11-07 00:32:52,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:52,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-07 00:32:52,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:53,090 INFO L225 Difference]: With dead ends: 135180 [2019-11-07 00:32:53,090 INFO L226 Difference]: Without dead ends: 135178 [2019-11-07 00:32:53,121 INFO L630 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-11-07 00:32:53,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135178 states. [2019-11-07 00:32:54,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135178 to 122888. [2019-11-07 00:32:54,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122888 states. [2019-11-07 00:32:54,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122888 states to 122888 states and 152582 transitions. [2019-11-07 00:32:54,608 INFO L78 Accepts]: Start accepts. Automaton has 122888 states and 152582 transitions. Word has length 35 [2019-11-07 00:32:54,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:54,608 INFO L462 AbstractCegarLoop]: Abstraction has 122888 states and 152582 transitions. [2019-11-07 00:32:54,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:54,609 INFO L276 IsEmpty]: Start isEmpty. Operand 122888 states and 152582 transitions. [2019-11-07 00:32:54,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-07 00:32:54,671 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:54,671 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:54,672 INFO L410 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:54,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:54,672 INFO L82 PathProgramCache]: Analyzing trace with hash -2014062572, now seen corresponding path program 1 times [2019-11-07 00:32:54,672 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:54,672 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495571934] [2019-11-07 00:32:54,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:54,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:54,687 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495571934] [2019-11-07 00:32:54,687 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:54,687 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:54,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65183962] [2019-11-07 00:32:54,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:54,688 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:54,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:54,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:54,688 INFO L87 Difference]: Start difference. First operand 122888 states and 152582 transitions. Second operand 3 states. [2019-11-07 00:32:56,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:56,167 INFO L93 Difference]: Finished difference Result 278540 states and 345096 transitions. [2019-11-07 00:32:56,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:56,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-07 00:32:56,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:56,297 INFO L225 Difference]: With dead ends: 278540 [2019-11-07 00:32:56,297 INFO L226 Difference]: Without dead ends: 157706 [2019-11-07 00:32:56,357 INFO L630 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-11-07 00:32:56,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157706 states. [2019-11-07 00:33:01,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157706 to 157704. [2019-11-07 00:33:01,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157704 states. [2019-11-07 00:33:01,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157704 states to 157704 states and 192518 transitions. [2019-11-07 00:33:01,456 INFO L78 Accepts]: Start accepts. Automaton has 157704 states and 192518 transitions. Word has length 35 [2019-11-07 00:33:01,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:33:01,456 INFO L462 AbstractCegarLoop]: Abstraction has 157704 states and 192518 transitions. [2019-11-07 00:33:01,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:33:01,456 INFO L276 IsEmpty]: Start isEmpty. Operand 157704 states and 192518 transitions. [2019-11-07 00:33:01,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-07 00:33:01,511 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:33:01,511 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:33:01,511 INFO L410 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:33:01,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:33:01,511 INFO L82 PathProgramCache]: Analyzing trace with hash -312037047, now seen corresponding path program 1 times [2019-11-07 00:33:01,512 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:33:01,512 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718601446] [2019-11-07 00:33:01,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:33:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:33:01,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:33:01,525 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718601446] [2019-11-07 00:33:01,525 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:33:01,525 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:33:01,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30828126] [2019-11-07 00:33:01,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:33:01,526 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:33:01,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:33:01,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:33:01,526 INFO L87 Difference]: Start difference. First operand 157704 states and 192518 transitions. Second operand 3 states. [2019-11-07 00:33:03,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:33:03,214 INFO L93 Difference]: Finished difference Result 236556 states and 287752 transitions. [2019-11-07 00:33:03,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:33:03,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-07 00:33:03,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:33:03,391 INFO L225 Difference]: With dead ends: 236556 [2019-11-07 00:33:03,391 INFO L226 Difference]: Without dead ends: 159754 [2019-11-07 00:33:03,442 INFO L630 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-11-07 00:33:03,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159754 states.