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-13a467a-m [2019-10-15 01:04:12,956 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:04:12,958 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:04:12,978 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:04:12,978 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:04:12,980 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:04:12,982 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:04:12,993 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:04:12,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:04:13,000 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:04:13,002 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:04:13,004 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:04:13,004 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:04:13,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:04:13,008 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:04:13,009 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:04:13,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:04:13,012 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:04:13,014 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:04:13,019 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:04:13,023 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:04:13,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:04:13,029 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:04:13,030 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:04:13,032 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:04:13,033 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:04:13,033 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:04:13,035 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:04:13,036 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:04:13,037 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:04:13,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:04:13,039 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:04:13,040 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:04:13,040 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:04:13,042 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:04:13,042 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:04:13,043 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:04:13,043 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:04:13,043 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:04:13,044 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:04:13,045 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:04:13,046 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:04:13,079 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:04:13,079 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:04:13,081 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:04:13,081 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:04:13,082 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:04:13,082 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:04:13,082 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:04:13,082 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:04:13,082 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:04:13,083 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:04:13,084 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:04:13,084 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:04:13,084 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:04:13,085 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:04:13,085 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:04:13,085 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:04:13,085 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:04:13,085 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:04:13,086 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:04:13,086 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:04:13,086 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:04:13,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:04:13,086 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:04:13,087 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:04:13,087 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:04:13,087 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:04:13,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:04:13,087 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:04:13,088 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:04:13,390 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:04:13,404 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:04:13,407 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:04:13,408 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:04:13,409 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:04:13,409 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-10-15 01:04:13,477 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eafebde82/e6ba789ca41e44eb872532414223e11f/FLAGbb922bc73 [2019-10-15 01:04:13,958 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:04:13,959 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14-1.c [2019-10-15 01:04:13,973 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eafebde82/e6ba789ca41e44eb872532414223e11f/FLAGbb922bc73 [2019-10-15 01:04:14,297 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eafebde82/e6ba789ca41e44eb872532414223e11f [2019-10-15 01:04:14,308 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:04:14,310 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:04:14,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:04:14,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:04:14,315 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:04:14,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:04:14" (1/1) ... [2019-10-15 01:04:14,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2504eb85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:14, skipping insertion in model container [2019-10-15 01:04:14,319 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:04:14" (1/1) ... [2019-10-15 01:04:14,327 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:04:14,350 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:04:14,602 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:04:14,613 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:04:14,661 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:04:14,786 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:04:14,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:14 WrapperNode [2019-10-15 01:04:14,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:04:14,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:04:14,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:04:14,789 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:04:14,803 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:14" (1/1) ... [2019-10-15 01:04:14,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:14" (1/1) ... [2019-10-15 01:04:14,810 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:14" (1/1) ... [2019-10-15 01:04:14,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:14" (1/1) ... [2019-10-15 01:04:14,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:14" (1/1) ... [2019-10-15 01:04:14,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:14" (1/1) ... [2019-10-15 01:04:14,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:14" (1/1) ... [2019-10-15 01:04:14,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:04:14,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:04:14,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:04:14,833 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:04:14,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:04:14,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:04:14,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:04:14,900 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:04:14,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:04:14,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:04:14,901 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:04:14,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:04:14,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:04:15,303 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:04:15,304 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:04:15,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:04:15 BoogieIcfgContainer [2019-10-15 01:04:15,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:04:15,307 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:04:15,307 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:04:15,310 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:04:15,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:04:14" (1/3) ... [2019-10-15 01:04:15,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33828721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:04:15, skipping insertion in model container [2019-10-15 01:04:15,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:14" (2/3) ... [2019-10-15 01:04:15,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33828721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:04:15, skipping insertion in model container [2019-10-15 01:04:15,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:04:15" (3/3) ... [2019-10-15 01:04:15,314 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2019-10-15 01:04:15,324 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:04:15,332 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:04:15,341 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:04:15,366 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:04:15,367 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:04:15,367 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:04:15,367 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:04:15,367 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:04:15,367 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:04:15,368 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:04:15,368 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:04:15,389 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2019-10-15 01:04:15,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:04:15,395 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:15,396 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:15,398 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:15,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:15,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1694520263, now seen corresponding path program 1 times [2019-10-15 01:04:15,411 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:15,412 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982018866] [2019-10-15 01:04:15,412 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,412 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:15,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:15,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982018866] [2019-10-15 01:04:15,625 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:15,626 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:15,627 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750884518] [2019-10-15 01:04:15,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:15,636 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:15,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:15,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:15,656 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 3 states. [2019-10-15 01:04:15,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:15,726 INFO L93 Difference]: Finished difference Result 111 states and 198 transitions. [2019-10-15 01:04:15,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:15,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-15 01:04:15,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:15,741 INFO L225 Difference]: With dead ends: 111 [2019-10-15 01:04:15,741 INFO L226 Difference]: Without dead ends: 96 [2019-10-15 01:04:15,744 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:15,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-15 01:04:15,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2019-10-15 01:04:15,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-15 01:04:15,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 121 transitions. [2019-10-15 01:04:15,797 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 121 transitions. Word has length 24 [2019-10-15 01:04:15,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:15,797 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 121 transitions. [2019-10-15 01:04:15,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:15,798 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 121 transitions. [2019-10-15 01:04:15,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:04:15,799 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:15,800 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:15,800 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:15,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:15,801 INFO L82 PathProgramCache]: Analyzing trace with hash 106172361, now seen corresponding path program 1 times [2019-10-15 01:04:15,801 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:15,801 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113789478] [2019-10-15 01:04:15,802 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,802 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:15,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:15,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113789478] [2019-10-15 01:04:15,887 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:15,888 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:15,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511720038] [2019-10-15 01:04:15,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:15,892 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:15,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:15,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:15,893 INFO L87 Difference]: Start difference. First operand 66 states and 121 transitions. Second operand 3 states. [2019-10-15 01:04:15,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:15,940 INFO L93 Difference]: Finished difference Result 157 states and 292 transitions. [2019-10-15 01:04:15,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:15,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-15 01:04:15,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:15,944 INFO L225 Difference]: With dead ends: 157 [2019-10-15 01:04:15,944 INFO L226 Difference]: Without dead ends: 96 [2019-10-15 01:04:15,945 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:15,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-15 01:04:15,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-10-15 01:04:15,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-15 01:04:15,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 173 transitions. [2019-10-15 01:04:15,961 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 173 transitions. Word has length 24 [2019-10-15 01:04:15,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:15,962 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 173 transitions. [2019-10-15 01:04:15,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:15,962 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 173 transitions. [2019-10-15 01:04:15,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:04:15,963 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:15,963 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:15,964 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:15,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:15,964 INFO L82 PathProgramCache]: Analyzing trace with hash 990732685, now seen corresponding path program 1 times [2019-10-15 01:04:15,965 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:15,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449240776] [2019-10-15 01:04:15,965 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,965 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:15,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:16,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:16,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449240776] [2019-10-15 01:04:16,041 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:16,042 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:16,042 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960053512] [2019-10-15 01:04:16,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:16,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:16,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:16,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,043 INFO L87 Difference]: Start difference. First operand 94 states and 173 transitions. Second operand 3 states. [2019-10-15 01:04:16,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,085 INFO L93 Difference]: Finished difference Result 144 states and 261 transitions. [2019-10-15 01:04:16,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 01:04:16,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,087 INFO L225 Difference]: With dead ends: 144 [2019-10-15 01:04:16,087 INFO L226 Difference]: Without dead ends: 99 [2019-10-15 01:04:16,088 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-15 01:04:16,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-10-15 01:04:16,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-15 01:04:16,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 175 transitions. [2019-10-15 01:04:16,113 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 175 transitions. Word has length 25 [2019-10-15 01:04:16,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,114 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 175 transitions. [2019-10-15 01:04:16,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,114 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 175 transitions. [2019-10-15 01:04:16,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:04:16,115 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,116 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:16,116 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1003412021, now seen corresponding path program 1 times [2019-10-15 01:04:16,117 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63644624] [2019-10-15 01:04:16,118 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,118 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:16,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:16,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63644624] [2019-10-15 01:04:16,204 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:16,204 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:16,204 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099732484] [2019-10-15 01:04:16,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:16,205 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:16,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:16,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,207 INFO L87 Difference]: Start difference. First operand 97 states and 175 transitions. Second operand 3 states. [2019-10-15 01:04:16,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,247 INFO L93 Difference]: Finished difference Result 184 states and 336 transitions. [2019-10-15 01:04:16,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 01:04:16,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,250 INFO L225 Difference]: With dead ends: 184 [2019-10-15 01:04:16,250 INFO L226 Difference]: Without dead ends: 182 [2019-10-15 01:04:16,251 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-10-15 01:04:16,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 128. [2019-10-15 01:04:16,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-10-15 01:04:16,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 232 transitions. [2019-10-15 01:04:16,284 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 232 transitions. Word has length 25 [2019-10-15 01:04:16,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,285 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 232 transitions. [2019-10-15 01:04:16,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,285 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 232 transitions. [2019-10-15 01:04:16,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:04:16,287 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,287 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:16,288 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1703207373, now seen corresponding path program 1 times [2019-10-15 01:04:16,289 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331770369] [2019-10-15 01:04:16,290 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,291 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:16,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:16,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331770369] [2019-10-15 01:04:16,342 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:16,342 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:16,342 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523998431] [2019-10-15 01:04:16,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:16,343 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:16,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:16,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,346 INFO L87 Difference]: Start difference. First operand 128 states and 232 transitions. Second operand 3 states. [2019-10-15 01:04:16,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,384 INFO L93 Difference]: Finished difference Result 304 states and 558 transitions. [2019-10-15 01:04:16,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 01:04:16,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,388 INFO L225 Difference]: With dead ends: 304 [2019-10-15 01:04:16,388 INFO L226 Difference]: Without dead ends: 184 [2019-10-15 01:04:16,389 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-15 01:04:16,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2019-10-15 01:04:16,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-10-15 01:04:16,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 330 transitions. [2019-10-15 01:04:16,419 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 330 transitions. Word has length 25 [2019-10-15 01:04:16,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,419 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 330 transitions. [2019-10-15 01:04:16,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,420 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 330 transitions. [2019-10-15 01:04:16,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 01:04:16,421 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,421 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:16,422 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1040789154, now seen corresponding path program 1 times [2019-10-15 01:04:16,422 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227329256] [2019-10-15 01:04:16,423 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,423 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:16,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-10-15 01:04:16,493 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227329256] [2019-10-15 01:04:16,493 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:16,493 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:16,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450330802] [2019-10-15 01:04:16,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:16,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:16,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:16,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,497 INFO L87 Difference]: Start difference. First operand 182 states and 330 transitions. Second operand 3 states. [2019-10-15 01:04:16,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,528 INFO L93 Difference]: Finished difference Result 273 states and 493 transitions. [2019-10-15 01:04:16,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-15 01:04:16,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,530 INFO L225 Difference]: With dead ends: 273 [2019-10-15 01:04:16,530 INFO L226 Difference]: Without dead ends: 186 [2019-10-15 01:04:16,531 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-10-15 01:04:16,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2019-10-15 01:04:16,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-10-15 01:04:16,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 330 transitions. [2019-10-15 01:04:16,556 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 330 transitions. Word has length 26 [2019-10-15 01:04:16,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,557 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 330 transitions. [2019-10-15 01:04:16,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,558 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 330 transitions. [2019-10-15 01:04:16,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 01:04:16,559 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,559 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:16,560 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1260033436, now seen corresponding path program 1 times [2019-10-15 01:04:16,560 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,560 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587290460] [2019-10-15 01:04:16,561 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,561 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:16,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:16,615 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587290460] [2019-10-15 01:04:16,615 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:16,615 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:16,616 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389723829] [2019-10-15 01:04:16,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:16,616 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:16,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:16,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,617 INFO L87 Difference]: Start difference. First operand 184 states and 330 transitions. Second operand 3 states. [2019-10-15 01:04:16,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,640 INFO L93 Difference]: Finished difference Result 348 states and 632 transitions. [2019-10-15 01:04:16,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-15 01:04:16,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,643 INFO L225 Difference]: With dead ends: 348 [2019-10-15 01:04:16,643 INFO L226 Difference]: Without dead ends: 346 [2019-10-15 01:04:16,644 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-10-15 01:04:16,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 248. [2019-10-15 01:04:16,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-10-15 01:04:16,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 442 transitions. [2019-10-15 01:04:16,655 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 442 transitions. Word has length 26 [2019-10-15 01:04:16,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,656 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 442 transitions. [2019-10-15 01:04:16,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,656 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 442 transitions. [2019-10-15 01:04:16,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 01:04:16,658 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,658 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:16,658 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,659 INFO L82 PathProgramCache]: Analyzing trace with hash -328314466, now seen corresponding path program 1 times [2019-10-15 01:04:16,659 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,659 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758353479] [2019-10-15 01:04:16,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,660 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:16,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:16,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758353479] [2019-10-15 01:04:16,713 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:16,713 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:16,713 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747057778] [2019-10-15 01:04:16,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:16,714 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:16,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:16,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,715 INFO L87 Difference]: Start difference. First operand 248 states and 442 transitions. Second operand 3 states. [2019-10-15 01:04:16,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,755 INFO L93 Difference]: Finished difference Result 592 states and 1064 transitions. [2019-10-15 01:04:16,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-15 01:04:16,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,759 INFO L225 Difference]: With dead ends: 592 [2019-10-15 01:04:16,759 INFO L226 Difference]: Without dead ends: 354 [2019-10-15 01:04:16,761 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-10-15 01:04:16,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2019-10-15 01:04:16,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-10-15 01:04:16,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 626 transitions. [2019-10-15 01:04:16,785 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 626 transitions. Word has length 26 [2019-10-15 01:04:16,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,785 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 626 transitions. [2019-10-15 01:04:16,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,785 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 626 transitions. [2019-10-15 01:04:16,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 01:04:16,789 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,790 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:16,790 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,790 INFO L82 PathProgramCache]: Analyzing trace with hash 406543618, now seen corresponding path program 1 times [2019-10-15 01:04:16,790 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25538496] [2019-10-15 01:04:16,791 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,791 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:16,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:16,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25538496] [2019-10-15 01:04:16,855 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:16,855 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:16,856 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771361991] [2019-10-15 01:04:16,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:16,858 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:16,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:16,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,859 INFO L87 Difference]: Start difference. First operand 352 states and 626 transitions. Second operand 3 states. [2019-10-15 01:04:16,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,885 INFO L93 Difference]: Finished difference Result 528 states and 936 transitions. [2019-10-15 01:04:16,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-15 01:04:16,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,887 INFO L225 Difference]: With dead ends: 528 [2019-10-15 01:04:16,888 INFO L226 Difference]: Without dead ends: 358 [2019-10-15 01:04:16,890 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-10-15 01:04:16,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-10-15 01:04:16,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-10-15 01:04:16,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 626 transitions. [2019-10-15 01:04:16,905 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 626 transitions. Word has length 27 [2019-10-15 01:04:16,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,907 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 626 transitions. [2019-10-15 01:04:16,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,907 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 626 transitions. [2019-10-15 01:04:16,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 01:04:16,911 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,911 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:16,911 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1587601088, now seen corresponding path program 1 times [2019-10-15 01:04:16,912 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348811517] [2019-10-15 01:04:16,912 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,912 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:16,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:16,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348811517] [2019-10-15 01:04:16,939 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:16,939 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:16,940 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915035503] [2019-10-15 01:04:16,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:16,940 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:16,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:16,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,941 INFO L87 Difference]: Start difference. First operand 356 states and 626 transitions. Second operand 3 states. [2019-10-15 01:04:16,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,966 INFO L93 Difference]: Finished difference Result 668 states and 1192 transitions. [2019-10-15 01:04:16,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-15 01:04:16,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,971 INFO L225 Difference]: With dead ends: 668 [2019-10-15 01:04:16,971 INFO L226 Difference]: Without dead ends: 666 [2019-10-15 01:04:16,972 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-10-15 01:04:16,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 488. [2019-10-15 01:04:16,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-10-15 01:04:16,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 846 transitions. [2019-10-15 01:04:16,989 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 846 transitions. Word has length 27 [2019-10-15 01:04:16,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,990 INFO L462 AbstractCegarLoop]: Abstraction has 488 states and 846 transitions. [2019-10-15 01:04:16,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,990 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 846 transitions. [2019-10-15 01:04:16,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 01:04:16,991 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,991 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:16,992 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1119018306, now seen corresponding path program 1 times [2019-10-15 01:04:16,992 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,993 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909206469] [2019-10-15 01:04:16,993 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,993 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:17,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-10-15 01:04:17,016 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909206469] [2019-10-15 01:04:17,016 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:17,017 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:17,017 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075265894] [2019-10-15 01:04:17,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:17,017 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:17,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:17,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:17,018 INFO L87 Difference]: Start difference. First operand 488 states and 846 transitions. Second operand 3 states. [2019-10-15 01:04:17,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:17,050 INFO L93 Difference]: Finished difference Result 1164 states and 2032 transitions. [2019-10-15 01:04:17,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:17,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-15 01:04:17,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:17,055 INFO L225 Difference]: With dead ends: 1164 [2019-10-15 01:04:17,055 INFO L226 Difference]: Without dead ends: 690 [2019-10-15 01:04:17,057 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:17,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-10-15 01:04:17,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 688. [2019-10-15 01:04:17,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2019-10-15 01:04:17,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1190 transitions. [2019-10-15 01:04:17,081 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1190 transitions. Word has length 27 [2019-10-15 01:04:17,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:17,081 INFO L462 AbstractCegarLoop]: Abstraction has 688 states and 1190 transitions. [2019-10-15 01:04:17,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:17,081 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1190 transitions. [2019-10-15 01:04:17,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 01:04:17,083 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:17,083 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:17,083 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:17,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:17,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1970780365, now seen corresponding path program 1 times [2019-10-15 01:04:17,084 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:17,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980683174] [2019-10-15 01:04:17,084 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,084 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:17,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:17,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980683174] [2019-10-15 01:04:17,109 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:17,109 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:17,109 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815136115] [2019-10-15 01:04:17,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:17,110 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:17,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:17,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:17,111 INFO L87 Difference]: Start difference. First operand 688 states and 1190 transitions. Second operand 3 states. [2019-10-15 01:04:17,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:17,135 INFO L93 Difference]: Finished difference Result 1032 states and 1780 transitions. [2019-10-15 01:04:17,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:17,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-15 01:04:17,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:17,139 INFO L225 Difference]: With dead ends: 1032 [2019-10-15 01:04:17,139 INFO L226 Difference]: Without dead ends: 698 [2019-10-15 01:04:17,141 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:17,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-10-15 01:04:17,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2019-10-15 01:04:17,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-10-15 01:04:17,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1190 transitions. [2019-10-15 01:04:17,162 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1190 transitions. Word has length 28 [2019-10-15 01:04:17,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:17,162 INFO L462 AbstractCegarLoop]: Abstraction has 696 states and 1190 transitions. [2019-10-15 01:04:17,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:17,163 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1190 transitions. [2019-10-15 01:04:17,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 01:04:17,164 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:17,164 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:17,164 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:17,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:17,165 INFO L82 PathProgramCache]: Analyzing trace with hash 330042225, now seen corresponding path program 1 times [2019-10-15 01:04:17,165 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:17,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497742775] [2019-10-15 01:04:17,166 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,166 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:17,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:17,193 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497742775] [2019-10-15 01:04:17,193 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:17,193 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:17,194 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551041188] [2019-10-15 01:04:17,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:17,194 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:17,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:17,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:17,195 INFO L87 Difference]: Start difference. First operand 696 states and 1190 transitions. Second operand 3 states. [2019-10-15 01:04:17,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:17,224 INFO L93 Difference]: Finished difference Result 1292 states and 2248 transitions. [2019-10-15 01:04:17,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:17,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-15 01:04:17,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:17,232 INFO L225 Difference]: With dead ends: 1292 [2019-10-15 01:04:17,233 INFO L226 Difference]: Without dead ends: 1290 [2019-10-15 01:04:17,233 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:17,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2019-10-15 01:04:17,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 968. [2019-10-15 01:04:17,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-10-15 01:04:17,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1622 transitions. [2019-10-15 01:04:17,273 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1622 transitions. Word has length 28 [2019-10-15 01:04:17,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:17,273 INFO L462 AbstractCegarLoop]: Abstraction has 968 states and 1622 transitions. [2019-10-15 01:04:17,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:17,273 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1622 transitions. [2019-10-15 01:04:17,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 01:04:17,276 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:17,276 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:17,276 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:17,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:17,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1258305677, now seen corresponding path program 1 times [2019-10-15 01:04:17,277 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:17,277 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129663865] [2019-10-15 01:04:17,278 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,278 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:17,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:17,303 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129663865] [2019-10-15 01:04:17,304 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:17,304 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:17,304 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988590986] [2019-10-15 01:04:17,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:17,305 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:17,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:17,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:17,306 INFO L87 Difference]: Start difference. First operand 968 states and 1622 transitions. Second operand 3 states. [2019-10-15 01:04:17,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:17,354 INFO L93 Difference]: Finished difference Result 2300 states and 3880 transitions. [2019-10-15 01:04:17,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:17,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-15 01:04:17,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:17,362 INFO L225 Difference]: With dead ends: 2300 [2019-10-15 01:04:17,363 INFO L226 Difference]: Without dead ends: 1354 [2019-10-15 01:04:17,365 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:17,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-10-15 01:04:17,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2019-10-15 01:04:17,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-10-15 01:04:17,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2262 transitions. [2019-10-15 01:04:17,419 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2262 transitions. Word has length 28 [2019-10-15 01:04:17,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:17,420 INFO L462 AbstractCegarLoop]: Abstraction has 1352 states and 2262 transitions. [2019-10-15 01:04:17,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:17,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2262 transitions. [2019-10-15 01:04:17,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 01:04:17,424 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:17,424 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:17,425 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:17,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:17,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1641587831, now seen corresponding path program 1 times [2019-10-15 01:04:17,425 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:17,426 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638775016] [2019-10-15 01:04:17,426 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,426 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:17,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:17,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638775016] [2019-10-15 01:04:17,463 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:17,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:17,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574394181] [2019-10-15 01:04:17,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:17,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:17,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:17,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:17,465 INFO L87 Difference]: Start difference. First operand 1352 states and 2262 transitions. Second operand 3 states. [2019-10-15 01:04:17,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:17,509 INFO L93 Difference]: Finished difference Result 2028 states and 3384 transitions. [2019-10-15 01:04:17,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:17,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-15 01:04:17,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:17,519 INFO L225 Difference]: With dead ends: 2028 [2019-10-15 01:04:17,519 INFO L226 Difference]: Without dead ends: 1370 [2019-10-15 01:04:17,523 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:17,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2019-10-15 01:04:17,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1368. [2019-10-15 01:04:17,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2019-10-15 01:04:17,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2262 transitions. [2019-10-15 01:04:17,569 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2262 transitions. Word has length 29 [2019-10-15 01:04:17,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:17,569 INFO L462 AbstractCegarLoop]: Abstraction has 1368 states and 2262 transitions. [2019-10-15 01:04:17,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:17,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2262 transitions. [2019-10-15 01:04:17,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 01:04:17,572 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:17,572 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:17,573 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:17,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:17,573 INFO L82 PathProgramCache]: Analyzing trace with hash -352556875, now seen corresponding path program 1 times [2019-10-15 01:04:17,574 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:17,574 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643914316] [2019-10-15 01:04:17,574 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,574 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:17,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:17,621 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643914316] [2019-10-15 01:04:17,621 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:17,621 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:17,622 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465577114] [2019-10-15 01:04:17,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:17,622 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:17,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:17,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:17,623 INFO L87 Difference]: Start difference. First operand 1368 states and 2262 transitions. Second operand 3 states. [2019-10-15 01:04:17,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:17,671 INFO L93 Difference]: Finished difference Result 2508 states and 4232 transitions. [2019-10-15 01:04:17,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:17,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-15 01:04:17,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:17,684 INFO L225 Difference]: With dead ends: 2508 [2019-10-15 01:04:17,684 INFO L226 Difference]: Without dead ends: 2506 [2019-10-15 01:04:17,686 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:17,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2019-10-15 01:04:17,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 1928. [2019-10-15 01:04:17,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2019-10-15 01:04:17,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 3110 transitions. [2019-10-15 01:04:17,753 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 3110 transitions. Word has length 29 [2019-10-15 01:04:17,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:17,753 INFO L462 AbstractCegarLoop]: Abstraction has 1928 states and 3110 transitions. [2019-10-15 01:04:17,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:17,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 3110 transitions. [2019-10-15 01:04:17,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 01:04:17,757 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:17,757 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:17,757 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:17,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:17,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1940904777, now seen corresponding path program 1 times [2019-10-15 01:04:17,758 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:17,758 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023482495] [2019-10-15 01:04:17,758 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,759 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:17,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:17,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023482495] [2019-10-15 01:04:17,786 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:17,786 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:17,786 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367722513] [2019-10-15 01:04:17,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:17,787 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:17,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:17,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:17,788 INFO L87 Difference]: Start difference. First operand 1928 states and 3110 transitions. Second operand 3 states. [2019-10-15 01:04:17,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:17,848 INFO L93 Difference]: Finished difference Result 4556 states and 7400 transitions. [2019-10-15 01:04:17,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:17,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-15 01:04:17,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:17,862 INFO L225 Difference]: With dead ends: 4556 [2019-10-15 01:04:17,863 INFO L226 Difference]: Without dead ends: 2666 [2019-10-15 01:04:17,867 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:17,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2019-10-15 01:04:17,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2664. [2019-10-15 01:04:17,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2664 states. [2019-10-15 01:04:17,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 4294 transitions. [2019-10-15 01:04:17,971 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 4294 transitions. Word has length 29 [2019-10-15 01:04:17,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:17,971 INFO L462 AbstractCegarLoop]: Abstraction has 2664 states and 4294 transitions. [2019-10-15 01:04:17,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:17,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 4294 transitions. [2019-10-15 01:04:17,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 01:04:17,975 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:17,975 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:17,975 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:17,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:17,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1955852552, now seen corresponding path program 1 times [2019-10-15 01:04:17,976 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:17,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106849397] [2019-10-15 01:04:17,977 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,977 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:18,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:18,002 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106849397] [2019-10-15 01:04:18,003 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:18,003 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:18,004 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59824822] [2019-10-15 01:04:18,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:18,004 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:18,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:18,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:18,005 INFO L87 Difference]: Start difference. First operand 2664 states and 4294 transitions. Second operand 3 states. [2019-10-15 01:04:18,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:18,060 INFO L93 Difference]: Finished difference Result 3996 states and 6424 transitions. [2019-10-15 01:04:18,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:18,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-15 01:04:18,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:18,074 INFO L225 Difference]: With dead ends: 3996 [2019-10-15 01:04:18,074 INFO L226 Difference]: Without dead ends: 2698 [2019-10-15 01:04:18,077 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:18,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2019-10-15 01:04:18,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2696. [2019-10-15 01:04:18,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2696 states. [2019-10-15 01:04:18,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 4294 transitions. [2019-10-15 01:04:18,151 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 4294 transitions. Word has length 30 [2019-10-15 01:04:18,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:18,152 INFO L462 AbstractCegarLoop]: Abstraction has 2696 states and 4294 transitions. [2019-10-15 01:04:18,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:18,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 4294 transitions. [2019-10-15 01:04:18,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 01:04:18,155 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:18,156 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:18,156 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:18,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:18,156 INFO L82 PathProgramCache]: Analyzing trace with hash -38292154, now seen corresponding path program 1 times [2019-10-15 01:04:18,156 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:18,157 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716548836] [2019-10-15 01:04:18,157 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:18,157 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:18,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:18,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:18,179 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716548836] [2019-10-15 01:04:18,179 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:18,179 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:18,180 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508269776] [2019-10-15 01:04:18,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:18,180 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:18,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:18,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:18,181 INFO L87 Difference]: Start difference. First operand 2696 states and 4294 transitions. Second operand 3 states. [2019-10-15 01:04:18,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:18,244 INFO L93 Difference]: Finished difference Result 4876 states and 7944 transitions. [2019-10-15 01:04:18,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:18,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-15 01:04:18,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:18,270 INFO L225 Difference]: With dead ends: 4876 [2019-10-15 01:04:18,271 INFO L226 Difference]: Without dead ends: 4874 [2019-10-15 01:04:18,274 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:18,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2019-10-15 01:04:18,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 3848. [2019-10-15 01:04:18,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3848 states. [2019-10-15 01:04:18,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3848 states to 3848 states and 5958 transitions. [2019-10-15 01:04:18,410 INFO L78 Accepts]: Start accepts. Automaton has 3848 states and 5958 transitions. Word has length 30 [2019-10-15 01:04:18,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:18,410 INFO L462 AbstractCegarLoop]: Abstraction has 3848 states and 5958 transitions. [2019-10-15 01:04:18,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:18,411 INFO L276 IsEmpty]: Start isEmpty. Operand 3848 states and 5958 transitions. [2019-10-15 01:04:18,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 01:04:18,417 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:18,418 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:18,418 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:18,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:18,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1626640056, now seen corresponding path program 1 times [2019-10-15 01:04:18,419 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:18,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798065143] [2019-10-15 01:04:18,419 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:18,419 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:18,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:18,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:18,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798065143] [2019-10-15 01:04:18,447 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:18,447 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:18,447 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257108035] [2019-10-15 01:04:18,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:18,448 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:18,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:18,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:18,449 INFO L87 Difference]: Start difference. First operand 3848 states and 5958 transitions. Second operand 3 states. [2019-10-15 01:04:18,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:18,573 INFO L93 Difference]: Finished difference Result 9036 states and 14088 transitions. [2019-10-15 01:04:18,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:18,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-15 01:04:18,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:18,599 INFO L225 Difference]: With dead ends: 9036 [2019-10-15 01:04:18,600 INFO L226 Difference]: Without dead ends: 5258 [2019-10-15 01:04:18,607 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:18,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2019-10-15 01:04:18,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 5256. [2019-10-15 01:04:18,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5256 states. [2019-10-15 01:04:18,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5256 states to 5256 states and 8134 transitions. [2019-10-15 01:04:18,750 INFO L78 Accepts]: Start accepts. Automaton has 5256 states and 8134 transitions. Word has length 30 [2019-10-15 01:04:18,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:18,750 INFO L462 AbstractCegarLoop]: Abstraction has 5256 states and 8134 transitions. [2019-10-15 01:04:18,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:18,750 INFO L276 IsEmpty]: Start isEmpty. Operand 5256 states and 8134 transitions. [2019-10-15 01:04:18,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 01:04:18,757 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:18,758 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:18,758 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:18,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:18,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1186842644, now seen corresponding path program 1 times [2019-10-15 01:04:18,759 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:18,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481055016] [2019-10-15 01:04:18,759 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:18,759 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:18,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:18,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:18,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481055016] [2019-10-15 01:04:18,783 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:18,784 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:18,784 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376367557] [2019-10-15 01:04:18,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:18,785 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:18,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:18,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:18,785 INFO L87 Difference]: Start difference. First operand 5256 states and 8134 transitions. Second operand 3 states. [2019-10-15 01:04:18,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:18,868 INFO L93 Difference]: Finished difference Result 7884 states and 12168 transitions. [2019-10-15 01:04:18,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:18,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-15 01:04:18,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:18,883 INFO L225 Difference]: With dead ends: 7884 [2019-10-15 01:04:18,883 INFO L226 Difference]: Without dead ends: 5322 [2019-10-15 01:04:18,890 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:18,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2019-10-15 01:04:19,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 5320. [2019-10-15 01:04:19,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5320 states. [2019-10-15 01:04:19,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5320 states to 5320 states and 8134 transitions. [2019-10-15 01:04:19,028 INFO L78 Accepts]: Start accepts. Automaton has 5320 states and 8134 transitions. Word has length 31 [2019-10-15 01:04:19,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:19,028 INFO L462 AbstractCegarLoop]: Abstraction has 5320 states and 8134 transitions. [2019-10-15 01:04:19,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:19,028 INFO L276 IsEmpty]: Start isEmpty. Operand 5320 states and 8134 transitions. [2019-10-15 01:04:19,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 01:04:19,036 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:19,036 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:19,036 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:19,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:19,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1113979946, now seen corresponding path program 1 times [2019-10-15 01:04:19,037 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:19,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311160393] [2019-10-15 01:04:19,038 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:19,038 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:19,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:19,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:19,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311160393] [2019-10-15 01:04:19,062 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:19,062 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:19,062 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130578753] [2019-10-15 01:04:19,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:19,063 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:19,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:19,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:19,064 INFO L87 Difference]: Start difference. First operand 5320 states and 8134 transitions. Second operand 3 states. [2019-10-15 01:04:19,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:19,234 INFO L93 Difference]: Finished difference Result 15564 states and 23624 transitions. [2019-10-15 01:04:19,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:19,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-15 01:04:19,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:19,260 INFO L225 Difference]: With dead ends: 15564 [2019-10-15 01:04:19,261 INFO L226 Difference]: Without dead ends: 10378 [2019-10-15 01:04:19,272 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:19,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10378 states. [2019-10-15 01:04:19,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10378 to 10376. [2019-10-15 01:04:19,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2019-10-15 01:04:19,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15494 transitions. [2019-10-15 01:04:19,534 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15494 transitions. Word has length 31 [2019-10-15 01:04:19,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:19,534 INFO L462 AbstractCegarLoop]: Abstraction has 10376 states and 15494 transitions. [2019-10-15 01:04:19,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:19,535 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15494 transitions. [2019-10-15 01:04:19,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 01:04:19,548 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:19,549 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:19,550 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:19,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:19,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1592639448, now seen corresponding path program 1 times [2019-10-15 01:04:19,551 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:19,551 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303218755] [2019-10-15 01:04:19,551 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:19,551 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:19,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:19,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:19,584 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303218755] [2019-10-15 01:04:19,584 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:19,584 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:19,584 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609648616] [2019-10-15 01:04:19,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:19,585 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:19,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:19,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:19,586 INFO L87 Difference]: Start difference. First operand 10376 states and 15494 transitions. Second operand 3 states. [2019-10-15 01:04:19,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:19,863 INFO L93 Difference]: Finished difference Result 12172 states and 18824 transitions. [2019-10-15 01:04:19,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:19,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-15 01:04:19,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:19,901 INFO L225 Difference]: With dead ends: 12172 [2019-10-15 01:04:19,902 INFO L226 Difference]: Without dead ends: 12170 [2019-10-15 01:04:19,906 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:19,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2019-10-15 01:04:20,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 10376. [2019-10-15 01:04:20,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2019-10-15 01:04:20,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15366 transitions. [2019-10-15 01:04:20,217 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15366 transitions. Word has length 31 [2019-10-15 01:04:20,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:20,217 INFO L462 AbstractCegarLoop]: Abstraction has 10376 states and 15366 transitions. [2019-10-15 01:04:20,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:20,217 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15366 transitions. [2019-10-15 01:04:20,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-15 01:04:20,230 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:20,230 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:20,230 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:20,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:20,231 INFO L82 PathProgramCache]: Analyzing trace with hash 173854429, now seen corresponding path program 1 times [2019-10-15 01:04:20,231 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:20,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778126770] [2019-10-15 01:04:20,232 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:20,232 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:20,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:20,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:20,255 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778126770] [2019-10-15 01:04:20,255 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:20,255 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:20,255 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240725714] [2019-10-15 01:04:20,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:20,256 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:20,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:20,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:20,256 INFO L87 Difference]: Start difference. First operand 10376 states and 15366 transitions. Second operand 3 states. [2019-10-15 01:04:20,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:20,542 INFO L93 Difference]: Finished difference Result 18316 states and 27784 transitions. [2019-10-15 01:04:20,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:20,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-15 01:04:20,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:20,580 INFO L225 Difference]: With dead ends: 18316 [2019-10-15 01:04:20,580 INFO L226 Difference]: Without dead ends: 18314 [2019-10-15 01:04:20,586 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:20,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18314 states. [2019-10-15 01:04:20,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18314 to 15240. [2019-10-15 01:04:20,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15240 states. [2019-10-15 01:04:20,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15240 states to 15240 states and 21894 transitions. [2019-10-15 01:04:20,908 INFO L78 Accepts]: Start accepts. Automaton has 15240 states and 21894 transitions. Word has length 32 [2019-10-15 01:04:20,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:20,909 INFO L462 AbstractCegarLoop]: Abstraction has 15240 states and 21894 transitions. [2019-10-15 01:04:20,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:20,909 INFO L276 IsEmpty]: Start isEmpty. Operand 15240 states and 21894 transitions. [2019-10-15 01:04:20,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-15 01:04:20,931 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:20,932 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:20,932 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:20,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:20,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1414493473, now seen corresponding path program 1 times [2019-10-15 01:04:20,933 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:20,933 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254294303] [2019-10-15 01:04:20,933 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:20,933 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:20,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:20,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:20,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254294303] [2019-10-15 01:04:20,958 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:20,958 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:20,959 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962222220] [2019-10-15 01:04:20,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:20,959 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:20,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:20,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:20,960 INFO L87 Difference]: Start difference. First operand 15240 states and 21894 transitions. Second operand 3 states. [2019-10-15 01:04:21,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:21,313 INFO L93 Difference]: Finished difference Result 35468 states and 51336 transitions. [2019-10-15 01:04:21,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:21,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-15 01:04:21,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:21,354 INFO L225 Difference]: With dead ends: 35468 [2019-10-15 01:04:21,354 INFO L226 Difference]: Without dead ends: 20362 [2019-10-15 01:04:21,381 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:21,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20362 states. [2019-10-15 01:04:21,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20362 to 20360. [2019-10-15 01:04:21,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20360 states. [2019-10-15 01:04:21,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20360 states to 20360 states and 29190 transitions. [2019-10-15 01:04:21,763 INFO L78 Accepts]: Start accepts. Automaton has 20360 states and 29190 transitions. Word has length 32 [2019-10-15 01:04:21,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:21,763 INFO L462 AbstractCegarLoop]: Abstraction has 20360 states and 29190 transitions. [2019-10-15 01:04:21,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:21,763 INFO L276 IsEmpty]: Start isEmpty. Operand 20360 states and 29190 transitions. [2019-10-15 01:04:21,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-15 01:04:21,791 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:21,791 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:21,791 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:21,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:21,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1094734815, now seen corresponding path program 1 times [2019-10-15 01:04:21,792 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:21,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791140183] [2019-10-15 01:04:21,792 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:21,792 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:21,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:21,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:21,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791140183] [2019-10-15 01:04:21,826 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:21,826 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:21,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487309331] [2019-10-15 01:04:21,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:21,827 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:21,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:21,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:21,828 INFO L87 Difference]: Start difference. First operand 20360 states and 29190 transitions. Second operand 3 states. [2019-10-15 01:04:22,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:22,129 INFO L93 Difference]: Finished difference Result 30732 states and 44040 transitions. [2019-10-15 01:04:22,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:22,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-15 01:04:22,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:22,173 INFO L225 Difference]: With dead ends: 30732 [2019-10-15 01:04:22,173 INFO L226 Difference]: Without dead ends: 20746 [2019-10-15 01:04:22,198 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:22,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20746 states. [2019-10-15 01:04:22,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20746 to 20744. [2019-10-15 01:04:22,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20744 states. [2019-10-15 01:04:23,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20744 states to 20744 states and 29446 transitions. [2019-10-15 01:04:23,327 INFO L78 Accepts]: Start accepts. Automaton has 20744 states and 29446 transitions. Word has length 33 [2019-10-15 01:04:23,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:23,328 INFO L462 AbstractCegarLoop]: Abstraction has 20744 states and 29446 transitions. [2019-10-15 01:04:23,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:23,328 INFO L276 IsEmpty]: Start isEmpty. Operand 20744 states and 29446 transitions. [2019-10-15 01:04:23,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-15 01:04:23,355 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:23,356 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:23,356 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:23,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:23,357 INFO L82 PathProgramCache]: Analyzing trace with hash -899409891, now seen corresponding path program 1 times [2019-10-15 01:04:23,357 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:23,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89018289] [2019-10-15 01:04:23,357 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,358 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:23,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:23,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89018289] [2019-10-15 01:04:23,381 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:23,381 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:23,381 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181550845] [2019-10-15 01:04:23,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:23,382 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:23,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:23,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:23,383 INFO L87 Difference]: Start difference. First operand 20744 states and 29446 transitions. Second operand 3 states. [2019-10-15 01:04:23,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:23,679 INFO L93 Difference]: Finished difference Result 35852 states and 51976 transitions. [2019-10-15 01:04:23,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:23,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-15 01:04:23,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:23,757 INFO L225 Difference]: With dead ends: 35852 [2019-10-15 01:04:23,757 INFO L226 Difference]: Without dead ends: 35850 [2019-10-15 01:04:23,774 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:23,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35850 states. [2019-10-15 01:04:24,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35850 to 30728. [2019-10-15 01:04:24,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30728 states. [2019-10-15 01:04:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30728 states to 30728 states and 42246 transitions. [2019-10-15 01:04:24,439 INFO L78 Accepts]: Start accepts. Automaton has 30728 states and 42246 transitions. Word has length 33 [2019-10-15 01:04:24,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:24,440 INFO L462 AbstractCegarLoop]: Abstraction has 30728 states and 42246 transitions. [2019-10-15 01:04:24,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:24,440 INFO L276 IsEmpty]: Start isEmpty. Operand 30728 states and 42246 transitions. [2019-10-15 01:04:24,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-15 01:04:24,476 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:24,476 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:24,476 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:24,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:24,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1807209503, now seen corresponding path program 1 times [2019-10-15 01:04:24,477 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:24,477 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576263611] [2019-10-15 01:04:24,477 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:24,477 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:24,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:24,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:24,501 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576263611] [2019-10-15 01:04:24,501 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:24,501 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:24,501 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256654730] [2019-10-15 01:04:24,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:24,502 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:24,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:24,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:24,503 INFO L87 Difference]: Start difference. First operand 30728 states and 42246 transitions. Second operand 3 states. [2019-10-15 01:04:24,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:24,832 INFO L93 Difference]: Finished difference Result 70668 states and 97544 transitions. [2019-10-15 01:04:24,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:24,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-15 01:04:24,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:24,893 INFO L225 Difference]: With dead ends: 70668 [2019-10-15 01:04:24,893 INFO L226 Difference]: Without dead ends: 40458 [2019-10-15 01:04:24,948 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:24,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40458 states. [2019-10-15 01:04:25,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40458 to 40456. [2019-10-15 01:04:25,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40456 states. [2019-10-15 01:04:25,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40456 states to 40456 states and 55302 transitions. [2019-10-15 01:04:25,876 INFO L78 Accepts]: Start accepts. Automaton has 40456 states and 55302 transitions. Word has length 33 [2019-10-15 01:04:25,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:25,876 INFO L462 AbstractCegarLoop]: Abstraction has 40456 states and 55302 transitions. [2019-10-15 01:04:25,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:25,877 INFO L276 IsEmpty]: Start isEmpty. Operand 40456 states and 55302 transitions. [2019-10-15 01:04:25,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-15 01:04:25,907 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:25,908 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:25,908 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:25,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:25,908 INFO L82 PathProgramCache]: Analyzing trace with hash -2111687692, now seen corresponding path program 1 times [2019-10-15 01:04:25,908 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:25,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158029712] [2019-10-15 01:04:25,909 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:25,909 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:25,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:25,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:25,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158029712] [2019-10-15 01:04:25,938 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:25,939 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:25,939 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204696752] [2019-10-15 01:04:25,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:25,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:25,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:25,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:25,940 INFO L87 Difference]: Start difference. First operand 40456 states and 55302 transitions. Second operand 3 states. [2019-10-15 01:04:26,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:26,612 INFO L93 Difference]: Finished difference Result 60684 states and 82696 transitions. [2019-10-15 01:04:26,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:26,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-15 01:04:26,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:26,681 INFO L225 Difference]: With dead ends: 60684 [2019-10-15 01:04:26,682 INFO L226 Difference]: Without dead ends: 40970 [2019-10-15 01:04:26,709 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:26,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40970 states. [2019-10-15 01:04:27,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40970 to 40968. [2019-10-15 01:04:27,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40968 states. [2019-10-15 01:04:27,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40968 states to 40968 states and 55302 transitions. [2019-10-15 01:04:27,440 INFO L78 Accepts]: Start accepts. Automaton has 40968 states and 55302 transitions. Word has length 34 [2019-10-15 01:04:27,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:27,440 INFO L462 AbstractCegarLoop]: Abstraction has 40968 states and 55302 transitions. [2019-10-15 01:04:27,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:27,440 INFO L276 IsEmpty]: Start isEmpty. Operand 40968 states and 55302 transitions. [2019-10-15 01:04:27,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-15 01:04:27,465 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:27,466 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:27,466 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:27,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:27,467 INFO L82 PathProgramCache]: Analyzing trace with hash 189134898, now seen corresponding path program 1 times [2019-10-15 01:04:27,467 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:27,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176458208] [2019-10-15 01:04:27,468 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:27,468 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:27,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:27,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:27,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176458208] [2019-10-15 01:04:27,496 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:27,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:27,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010258865] [2019-10-15 01:04:27,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:27,497 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:27,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:27,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:27,497 INFO L87 Difference]: Start difference. First operand 40968 states and 55302 transitions. Second operand 3 states. [2019-10-15 01:04:28,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:28,341 INFO L93 Difference]: Finished difference Result 69644 states and 95752 transitions. [2019-10-15 01:04:28,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:28,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-15 01:04:28,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:28,453 INFO L225 Difference]: With dead ends: 69644 [2019-10-15 01:04:28,453 INFO L226 Difference]: Without dead ends: 69642 [2019-10-15 01:04:28,474 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:28,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69642 states. [2019-10-15 01:04:30,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69642 to 61448. [2019-10-15 01:04:30,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61448 states. [2019-10-15 01:04:30,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61448 states to 61448 states and 80390 transitions. [2019-10-15 01:04:30,638 INFO L78 Accepts]: Start accepts. Automaton has 61448 states and 80390 transitions. Word has length 34 [2019-10-15 01:04:30,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:30,639 INFO L462 AbstractCegarLoop]: Abstraction has 61448 states and 80390 transitions. [2019-10-15 01:04:30,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:30,639 INFO L276 IsEmpty]: Start isEmpty. Operand 61448 states and 80390 transitions. [2019-10-15 01:04:30,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-15 01:04:30,681 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:30,682 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:30,682 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:30,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:30,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1399213004, now seen corresponding path program 1 times [2019-10-15 01:04:30,682 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:30,683 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316113931] [2019-10-15 01:04:30,683 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:30,683 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:30,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:30,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:30,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316113931] [2019-10-15 01:04:30,717 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:30,718 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:30,718 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199690939] [2019-10-15 01:04:30,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:30,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:30,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:30,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:30,719 INFO L87 Difference]: Start difference. First operand 61448 states and 80390 transitions. Second operand 3 states. [2019-10-15 01:04:31,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:31,344 INFO L93 Difference]: Finished difference Result 140300 states and 183816 transitions. [2019-10-15 01:04:31,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:31,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-15 01:04:31,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:31,418 INFO L225 Difference]: With dead ends: 140300 [2019-10-15 01:04:31,418 INFO L226 Difference]: Without dead ends: 79882 [2019-10-15 01:04:31,467 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:31,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79882 states. [2019-10-15 01:04:32,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79882 to 79880. [2019-10-15 01:04:32,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79880 states. [2019-10-15 01:04:32,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79880 states to 79880 states and 103430 transitions. [2019-10-15 01:04:32,777 INFO L78 Accepts]: Start accepts. Automaton has 79880 states and 103430 transitions. Word has length 34 [2019-10-15 01:04:32,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:32,778 INFO L462 AbstractCegarLoop]: Abstraction has 79880 states and 103430 transitions. [2019-10-15 01:04:32,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:32,778 INFO L276 IsEmpty]: Start isEmpty. Operand 79880 states and 103430 transitions. [2019-10-15 01:04:32,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-15 01:04:32,832 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:32,832 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:32,833 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:32,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:32,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1568430036, now seen corresponding path program 1 times [2019-10-15 01:04:32,833 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:32,833 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871524584] [2019-10-15 01:04:32,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:32,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:32,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:32,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:32,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871524584] [2019-10-15 01:04:32,864 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:32,864 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:32,864 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866035371] [2019-10-15 01:04:32,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:32,865 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:32,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:32,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:32,866 INFO L87 Difference]: Start difference. First operand 79880 states and 103430 transitions. Second operand 3 states. [2019-10-15 01:04:34,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:34,441 INFO L93 Difference]: Finished difference Result 119820 states and 154632 transitions. [2019-10-15 01:04:34,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:34,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-15 01:04:34,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:34,537 INFO L225 Difference]: With dead ends: 119820 [2019-10-15 01:04:34,537 INFO L226 Difference]: Without dead ends: 80906 [2019-10-15 01:04:34,584 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:34,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80906 states. [2019-10-15 01:04:35,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80906 to 80904. [2019-10-15 01:04:35,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80904 states. [2019-10-15 01:04:35,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80904 states to 80904 states and 103430 transitions. [2019-10-15 01:04:35,720 INFO L78 Accepts]: Start accepts. Automaton has 80904 states and 103430 transitions. Word has length 35 [2019-10-15 01:04:35,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:35,720 INFO L462 AbstractCegarLoop]: Abstraction has 80904 states and 103430 transitions. [2019-10-15 01:04:35,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:35,720 INFO L276 IsEmpty]: Start isEmpty. Operand 80904 states and 103430 transitions. [2019-10-15 01:04:35,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-15 01:04:35,756 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:35,756 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:35,756 INFO L410 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:35,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:35,756 INFO L82 PathProgramCache]: Analyzing trace with hash -425714670, now seen corresponding path program 1 times [2019-10-15 01:04:35,757 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:35,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232538418] [2019-10-15 01:04:35,757 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:35,757 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:35,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:35,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:35,780 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232538418] [2019-10-15 01:04:35,780 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:35,780 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:35,780 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15784084] [2019-10-15 01:04:35,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:35,781 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:35,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:35,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:35,781 INFO L87 Difference]: Start difference. First operand 80904 states and 103430 transitions. Second operand 3 states. [2019-10-15 01:04:36,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:36,619 INFO L93 Difference]: Finished difference Result 135180 states and 175112 transitions. [2019-10-15 01:04:36,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:36,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-15 01:04:36,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:37,273 INFO L225 Difference]: With dead ends: 135180 [2019-10-15 01:04:37,274 INFO L226 Difference]: Without dead ends: 135178 [2019-10-15 01:04:37,288 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:37,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135178 states. [2019-10-15 01:04:40,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135178 to 122888. [2019-10-15 01:04:40,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122888 states. [2019-10-15 01:04:40,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122888 states to 122888 states and 152582 transitions. [2019-10-15 01:04:40,877 INFO L78 Accepts]: Start accepts. Automaton has 122888 states and 152582 transitions. Word has length 35 [2019-10-15 01:04:40,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:40,878 INFO L462 AbstractCegarLoop]: Abstraction has 122888 states and 152582 transitions. [2019-10-15 01:04:40,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:40,878 INFO L276 IsEmpty]: Start isEmpty. Operand 122888 states and 152582 transitions. [2019-10-15 01:04:40,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-15 01:04:40,953 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:40,953 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:40,953 INFO L410 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:40,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:40,954 INFO L82 PathProgramCache]: Analyzing trace with hash -2014062572, now seen corresponding path program 1 times [2019-10-15 01:04:40,954 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:40,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77480792] [2019-10-15 01:04:40,954 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:40,955 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:40,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:40,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:40,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:40,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77480792] [2019-10-15 01:04:40,979 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:40,979 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:40,979 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215456671] [2019-10-15 01:04:40,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:40,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:40,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:40,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:40,980 INFO L87 Difference]: Start difference. First operand 122888 states and 152582 transitions. Second operand 3 states. [2019-10-15 01:04:42,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:42,059 INFO L93 Difference]: Finished difference Result 278540 states and 345096 transitions. [2019-10-15 01:04:42,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:42,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-15 01:04:42,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:42,229 INFO L225 Difference]: With dead ends: 278540 [2019-10-15 01:04:42,229 INFO L226 Difference]: Without dead ends: 157706 [2019-10-15 01:04:42,333 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:42,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157706 states.