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_13.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:05:09,225 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:05:09,228 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:05:09,242 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:05:09,243 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:05:09,244 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:05:09,245 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:05:09,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:05:09,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:05:09,250 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:05:09,251 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:05:09,252 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:05:09,252 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:05:09,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:05:09,254 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:05:09,255 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:05:09,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:05:09,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:05:09,259 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:05:09,261 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:05:09,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:05:09,264 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:05:09,265 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:05:09,266 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:05:09,268 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:05:09,268 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:05:09,268 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:05:09,269 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:05:09,270 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:05:09,271 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:05:09,271 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:05:09,272 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:05:09,273 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:05:09,273 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:05:09,275 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:05:09,275 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:05:09,276 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:05:09,276 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:05:09,276 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:05:09,277 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:05:09,278 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:05:09,279 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-13 21:05:09,293 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:05:09,294 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:05:09,295 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:05:09,295 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:05:09,295 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:05:09,296 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:05:09,296 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:05:09,296 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:05:09,296 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:05:09,296 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:05:09,297 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:05:09,297 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:05:09,297 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:05:09,297 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:05:09,297 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:05:09,298 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:05:09,298 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:05:09,298 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:05:09,298 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:05:09,298 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:05:09,299 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:05:09,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:05:09,299 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:05:09,299 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:05:09,300 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:05:09,300 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:05:09,300 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:05:09,300 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:05:09,300 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-13 21:05:09,677 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:05:09,691 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:05:09,694 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:05:09,696 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:05:09,696 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:05:09,697 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_13.c [2019-10-13 21:05:09,770 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2946f42b8/08e01dd94d2742358195a43f5e87f4a9/FLAGc27988772 [2019-10-13 21:05:10,240 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:05:10,241 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13.c [2019-10-13 21:05:10,250 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2946f42b8/08e01dd94d2742358195a43f5e87f4a9/FLAGc27988772 [2019-10-13 21:05:10,627 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2946f42b8/08e01dd94d2742358195a43f5e87f4a9 [2019-10-13 21:05:10,638 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:05:10,639 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:05:10,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:05:10,641 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:05:10,644 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:05:10,645 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:05:10" (1/1) ... [2019-10-13 21:05:10,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38d15d4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:10, skipping insertion in model container [2019-10-13 21:05:10,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:05:10" (1/1) ... [2019-10-13 21:05:10,657 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:05:10,692 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:05:10,979 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:05:10,985 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:05:11,037 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:05:11,143 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:05:11,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:11 WrapperNode [2019-10-13 21:05:11,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:05:11,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:05:11,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:05:11,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:05:11,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:11" (1/1) ... [2019-10-13 21:05:11,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:11" (1/1) ... [2019-10-13 21:05:11,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:11" (1/1) ... [2019-10-13 21:05:11,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:11" (1/1) ... [2019-10-13 21:05:11,173 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:11" (1/1) ... [2019-10-13 21:05:11,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:11" (1/1) ... [2019-10-13 21:05:11,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:11" (1/1) ... [2019-10-13 21:05:11,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:05:11,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:05:11,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:05:11,192 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:05:11,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:11" (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-13 21:05:11,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:05:11,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:05:11,254 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:05:11,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:05:11,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:05:11,255 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:05:11,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:05:11,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:05:11,632 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:05:11,632 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:05:11,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:05:11 BoogieIcfgContainer [2019-10-13 21:05:11,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:05:11,635 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:05:11,635 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:05:11,638 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:05:11,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:05:10" (1/3) ... [2019-10-13 21:05:11,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@541302d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:05:11, skipping insertion in model container [2019-10-13 21:05:11,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:11" (2/3) ... [2019-10-13 21:05:11,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@541302d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:05:11, skipping insertion in model container [2019-10-13 21:05:11,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:05:11" (3/3) ... [2019-10-13 21:05:11,642 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2019-10-13 21:05:11,652 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:05:11,659 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:05:11,678 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:05:11,703 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:05:11,704 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:05:11,704 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:05:11,704 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:05:11,704 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:05:11,704 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:05:11,705 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:05:11,705 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:05:11,724 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-10-13 21:05:11,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 21:05:11,730 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:11,731 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:11,732 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:11,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:11,738 INFO L82 PathProgramCache]: Analyzing trace with hash 2062980600, now seen corresponding path program 1 times [2019-10-13 21:05:11,745 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:11,745 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543227035] [2019-10-13 21:05:11,745 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:11,745 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:11,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:11,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:11,937 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543227035] [2019-10-13 21:05:11,938 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:11,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:11,938 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476406452] [2019-10-13 21:05:11,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:11,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:11,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:11,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:11,964 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2019-10-13 21:05:12,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:12,041 INFO L93 Difference]: Finished difference Result 105 states and 186 transitions. [2019-10-13 21:05:12,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:12,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 21:05:12,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:12,067 INFO L225 Difference]: With dead ends: 105 [2019-10-13 21:05:12,067 INFO L226 Difference]: Without dead ends: 90 [2019-10-13 21:05:12,074 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-13 21:05:12,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-13 21:05:12,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 62. [2019-10-13 21:05:12,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-13 21:05:12,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 113 transitions. [2019-10-13 21:05:12,140 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 113 transitions. Word has length 23 [2019-10-13 21:05:12,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:12,140 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 113 transitions. [2019-10-13 21:05:12,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:12,141 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 113 transitions. [2019-10-13 21:05:12,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 21:05:12,145 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:12,145 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:12,146 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:12,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:12,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1041912246, now seen corresponding path program 1 times [2019-10-13 21:05:12,149 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:12,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662905658] [2019-10-13 21:05:12,150 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:12,151 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:12,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:12,306 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-13 21:05:12,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662905658] [2019-10-13 21:05:12,307 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:12,307 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:12,307 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306516752] [2019-10-13 21:05:12,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:12,310 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:12,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:12,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:12,311 INFO L87 Difference]: Start difference. First operand 62 states and 113 transitions. Second operand 3 states. [2019-10-13 21:05:12,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:12,366 INFO L93 Difference]: Finished difference Result 147 states and 272 transitions. [2019-10-13 21:05:12,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:12,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 21:05:12,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:12,369 INFO L225 Difference]: With dead ends: 147 [2019-10-13 21:05:12,369 INFO L226 Difference]: Without dead ends: 90 [2019-10-13 21:05:12,371 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-13 21:05:12,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-13 21:05:12,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-10-13 21:05:12,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-13 21:05:12,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 161 transitions. [2019-10-13 21:05:12,391 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 161 transitions. Word has length 23 [2019-10-13 21:05:12,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:12,392 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 161 transitions. [2019-10-13 21:05:12,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:12,392 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 161 transitions. [2019-10-13 21:05:12,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 21:05:12,396 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:12,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-13 21:05:12,396 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:12,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:12,397 INFO L82 PathProgramCache]: Analyzing trace with hash -471898432, now seen corresponding path program 1 times [2019-10-13 21:05:12,397 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:12,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106100327] [2019-10-13 21:05:12,398 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:12,398 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:12,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:12,497 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-13 21:05:12,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106100327] [2019-10-13 21:05:12,498 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:12,498 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:12,499 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577076583] [2019-10-13 21:05:12,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:12,500 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:12,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:12,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:12,501 INFO L87 Difference]: Start difference. First operand 88 states and 161 transitions. Second operand 3 states. [2019-10-13 21:05:12,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:12,527 INFO L93 Difference]: Finished difference Result 135 states and 243 transitions. [2019-10-13 21:05:12,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:12,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 21:05:12,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:12,533 INFO L225 Difference]: With dead ends: 135 [2019-10-13 21:05:12,534 INFO L226 Difference]: Without dead ends: 93 [2019-10-13 21:05:12,537 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-13 21:05:12,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-13 21:05:12,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2019-10-13 21:05:12,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-13 21:05:12,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 163 transitions. [2019-10-13 21:05:12,557 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 163 transitions. Word has length 24 [2019-10-13 21:05:12,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:12,558 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 163 transitions. [2019-10-13 21:05:12,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:12,558 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2019-10-13 21:05:12,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 21:05:12,561 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:12,561 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-13 21:05:12,562 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:12,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:12,562 INFO L82 PathProgramCache]: Analyzing trace with hash -2060246334, now seen corresponding path program 1 times [2019-10-13 21:05:12,563 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:12,563 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55927460] [2019-10-13 21:05:12,564 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:12,564 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:12,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:12,654 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-13 21:05:12,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55927460] [2019-10-13 21:05:12,655 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:12,655 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:12,655 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498288658] [2019-10-13 21:05:12,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:12,656 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:12,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:12,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:12,657 INFO L87 Difference]: Start difference. First operand 91 states and 163 transitions. Second operand 3 states. [2019-10-13 21:05:12,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:12,698 INFO L93 Difference]: Finished difference Result 172 states and 312 transitions. [2019-10-13 21:05:12,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:12,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 21:05:12,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:12,701 INFO L225 Difference]: With dead ends: 172 [2019-10-13 21:05:12,702 INFO L226 Difference]: Without dead ends: 170 [2019-10-13 21:05:12,704 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:12,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-10-13 21:05:12,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 120. [2019-10-13 21:05:12,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-13 21:05:12,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 216 transitions. [2019-10-13 21:05:12,720 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 216 transitions. Word has length 24 [2019-10-13 21:05:12,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:12,721 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 216 transitions. [2019-10-13 21:05:12,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:12,721 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 216 transitions. [2019-10-13 21:05:12,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 21:05:12,723 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:12,723 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-13 21:05:12,723 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:12,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:12,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1213652608, now seen corresponding path program 1 times [2019-10-13 21:05:12,724 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:12,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947374829] [2019-10-13 21:05:12,725 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:12,725 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:12,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:12,770 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-13 21:05:12,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947374829] [2019-10-13 21:05:12,771 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:12,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:12,772 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307516313] [2019-10-13 21:05:12,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:12,773 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:12,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:12,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:12,775 INFO L87 Difference]: Start difference. First operand 120 states and 216 transitions. Second operand 3 states. [2019-10-13 21:05:12,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:12,799 INFO L93 Difference]: Finished difference Result 284 states and 518 transitions. [2019-10-13 21:05:12,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:12,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 21:05:12,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:12,803 INFO L225 Difference]: With dead ends: 284 [2019-10-13 21:05:12,803 INFO L226 Difference]: Without dead ends: 172 [2019-10-13 21:05:12,804 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-13 21:05:12,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-10-13 21:05:12,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2019-10-13 21:05:12,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-10-13 21:05:12,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 306 transitions. [2019-10-13 21:05:12,835 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 306 transitions. Word has length 24 [2019-10-13 21:05:12,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:12,836 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 306 transitions. [2019-10-13 21:05:12,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:12,837 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 306 transitions. [2019-10-13 21:05:12,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 21:05:12,841 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:12,842 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-13 21:05:12,842 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:12,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:12,843 INFO L82 PathProgramCache]: Analyzing trace with hash 557085835, now seen corresponding path program 1 times [2019-10-13 21:05:12,843 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:12,845 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389117226] [2019-10-13 21:05:12,845 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:12,846 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:12,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:12,911 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-13 21:05:12,911 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389117226] [2019-10-13 21:05:12,912 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:12,912 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:12,912 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442862458] [2019-10-13 21:05:12,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:12,913 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:12,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:12,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:12,915 INFO L87 Difference]: Start difference. First operand 170 states and 306 transitions. Second operand 3 states. [2019-10-13 21:05:12,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:12,940 INFO L93 Difference]: Finished difference Result 255 states and 457 transitions. [2019-10-13 21:05:12,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:12,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 21:05:12,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:12,944 INFO L225 Difference]: With dead ends: 255 [2019-10-13 21:05:12,944 INFO L226 Difference]: Without dead ends: 174 [2019-10-13 21:05:12,946 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-13 21:05:12,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-10-13 21:05:12,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2019-10-13 21:05:12,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-10-13 21:05:12,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 306 transitions. [2019-10-13 21:05:12,968 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 306 transitions. Word has length 25 [2019-10-13 21:05:12,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:12,969 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 306 transitions. [2019-10-13 21:05:12,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:12,969 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 306 transitions. [2019-10-13 21:05:12,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 21:05:12,973 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:12,973 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-13 21:05:12,974 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:12,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:12,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1031262067, now seen corresponding path program 1 times [2019-10-13 21:05:12,974 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:12,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417156811] [2019-10-13 21:05:12,975 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:12,979 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:12,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:13,026 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-13 21:05:13,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417156811] [2019-10-13 21:05:13,028 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:13,028 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:13,028 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304397840] [2019-10-13 21:05:13,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:13,029 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:13,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:13,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:13,030 INFO L87 Difference]: Start difference. First operand 172 states and 306 transitions. Second operand 3 states. [2019-10-13 21:05:13,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:13,057 INFO L93 Difference]: Finished difference Result 324 states and 584 transitions. [2019-10-13 21:05:13,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:13,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 21:05:13,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:13,060 INFO L225 Difference]: With dead ends: 324 [2019-10-13 21:05:13,060 INFO L226 Difference]: Without dead ends: 322 [2019-10-13 21:05:13,061 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-13 21:05:13,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-10-13 21:05:13,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 232. [2019-10-13 21:05:13,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-13 21:05:13,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 410 transitions. [2019-10-13 21:05:13,073 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 410 transitions. Word has length 25 [2019-10-13 21:05:13,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:13,074 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 410 transitions. [2019-10-13 21:05:13,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:13,074 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 410 transitions. [2019-10-13 21:05:13,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 21:05:13,076 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:13,076 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-13 21:05:13,076 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:13,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:13,077 INFO L82 PathProgramCache]: Analyzing trace with hash -2052330421, now seen corresponding path program 1 times [2019-10-13 21:05:13,077 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:13,077 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199224620] [2019-10-13 21:05:13,077 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:13,077 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:13,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:13,111 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-13 21:05:13,112 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199224620] [2019-10-13 21:05:13,112 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:13,112 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:13,113 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024711372] [2019-10-13 21:05:13,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:13,113 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:13,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:13,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:13,114 INFO L87 Difference]: Start difference. First operand 232 states and 410 transitions. Second operand 3 states. [2019-10-13 21:05:13,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:13,153 INFO L93 Difference]: Finished difference Result 552 states and 984 transitions. [2019-10-13 21:05:13,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:13,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 21:05:13,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:13,157 INFO L225 Difference]: With dead ends: 552 [2019-10-13 21:05:13,157 INFO L226 Difference]: Without dead ends: 330 [2019-10-13 21:05:13,159 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-13 21:05:13,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-10-13 21:05:13,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2019-10-13 21:05:13,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-10-13 21:05:13,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 578 transitions. [2019-10-13 21:05:13,181 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 578 transitions. Word has length 25 [2019-10-13 21:05:13,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:13,182 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 578 transitions. [2019-10-13 21:05:13,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:13,182 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 578 transitions. [2019-10-13 21:05:13,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 21:05:13,184 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:13,184 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-13 21:05:13,184 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:13,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:13,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1904139915, now seen corresponding path program 1 times [2019-10-13 21:05:13,185 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:13,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654902879] [2019-10-13 21:05:13,185 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:13,185 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:13,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:13,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:13,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654902879] [2019-10-13 21:05:13,243 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:13,243 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:13,244 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585526288] [2019-10-13 21:05:13,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:13,246 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:13,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:13,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:13,247 INFO L87 Difference]: Start difference. First operand 328 states and 578 transitions. Second operand 3 states. [2019-10-13 21:05:13,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:13,269 INFO L93 Difference]: Finished difference Result 492 states and 864 transitions. [2019-10-13 21:05:13,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:13,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 21:05:13,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:13,273 INFO L225 Difference]: With dead ends: 492 [2019-10-13 21:05:13,273 INFO L226 Difference]: Without dead ends: 334 [2019-10-13 21:05:13,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-13 21:05:13,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-10-13 21:05:13,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2019-10-13 21:05:13,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-10-13 21:05:13,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 578 transitions. [2019-10-13 21:05:13,286 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 578 transitions. Word has length 26 [2019-10-13 21:05:13,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:13,286 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 578 transitions. [2019-10-13 21:05:13,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:13,286 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 578 transitions. [2019-10-13 21:05:13,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 21:05:13,287 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:13,288 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-13 21:05:13,288 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:13,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:13,288 INFO L82 PathProgramCache]: Analyzing trace with hash 802479479, now seen corresponding path program 1 times [2019-10-13 21:05:13,288 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:13,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144384262] [2019-10-13 21:05:13,289 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:13,289 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:13,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:13,314 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-13 21:05:13,315 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144384262] [2019-10-13 21:05:13,315 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:13,315 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:13,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086264037] [2019-10-13 21:05:13,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:13,316 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:13,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:13,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:13,317 INFO L87 Difference]: Start difference. First operand 332 states and 578 transitions. Second operand 3 states. [2019-10-13 21:05:13,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:13,359 INFO L93 Difference]: Finished difference Result 620 states and 1096 transitions. [2019-10-13 21:05:13,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:13,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 21:05:13,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:13,367 INFO L225 Difference]: With dead ends: 620 [2019-10-13 21:05:13,367 INFO L226 Difference]: Without dead ends: 618 [2019-10-13 21:05:13,368 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-13 21:05:13,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-10-13 21:05:13,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 456. [2019-10-13 21:05:13,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-10-13 21:05:13,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 782 transitions. [2019-10-13 21:05:13,392 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 782 transitions. Word has length 26 [2019-10-13 21:05:13,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:13,392 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 782 transitions. [2019-10-13 21:05:13,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:13,393 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 782 transitions. [2019-10-13 21:05:13,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 21:05:13,396 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:13,397 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-13 21:05:13,397 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:13,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:13,397 INFO L82 PathProgramCache]: Analyzing trace with hash -218588875, now seen corresponding path program 1 times [2019-10-13 21:05:13,398 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:13,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18018209] [2019-10-13 21:05:13,398 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:13,398 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:13,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:13,442 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-13 21:05:13,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18018209] [2019-10-13 21:05:13,443 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:13,443 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:13,443 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927810285] [2019-10-13 21:05:13,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:13,444 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:13,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:13,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:13,446 INFO L87 Difference]: Start difference. First operand 456 states and 782 transitions. Second operand 3 states. [2019-10-13 21:05:13,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:13,480 INFO L93 Difference]: Finished difference Result 1084 states and 1872 transitions. [2019-10-13 21:05:13,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:13,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 21:05:13,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:13,485 INFO L225 Difference]: With dead ends: 1084 [2019-10-13 21:05:13,486 INFO L226 Difference]: Without dead ends: 642 [2019-10-13 21:05:13,487 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-13 21:05:13,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-10-13 21:05:13,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 640. [2019-10-13 21:05:13,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-10-13 21:05:13,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1094 transitions. [2019-10-13 21:05:13,513 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1094 transitions. Word has length 26 [2019-10-13 21:05:13,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:13,514 INFO L462 AbstractCegarLoop]: Abstraction has 640 states and 1094 transitions. [2019-10-13 21:05:13,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:13,514 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1094 transitions. [2019-10-13 21:05:13,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 21:05:13,516 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:13,516 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-13 21:05:13,516 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:13,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:13,516 INFO L82 PathProgramCache]: Analyzing trace with hash -892726496, now seen corresponding path program 1 times [2019-10-13 21:05:13,517 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:13,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576601920] [2019-10-13 21:05:13,517 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:13,517 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:13,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:13,543 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-13 21:05:13,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576601920] [2019-10-13 21:05:13,544 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:13,544 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:13,544 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728594175] [2019-10-13 21:05:13,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:13,545 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:13,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:13,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:13,546 INFO L87 Difference]: Start difference. First operand 640 states and 1094 transitions. Second operand 3 states. [2019-10-13 21:05:13,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:13,569 INFO L93 Difference]: Finished difference Result 960 states and 1636 transitions. [2019-10-13 21:05:13,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:13,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 21:05:13,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:13,574 INFO L225 Difference]: With dead ends: 960 [2019-10-13 21:05:13,574 INFO L226 Difference]: Without dead ends: 650 [2019-10-13 21:05:13,575 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-13 21:05:13,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-10-13 21:05:13,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 648. [2019-10-13 21:05:13,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-13 21:05:13,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1094 transitions. [2019-10-13 21:05:13,596 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1094 transitions. Word has length 27 [2019-10-13 21:05:13,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:13,596 INFO L462 AbstractCegarLoop]: Abstraction has 648 states and 1094 transitions. [2019-10-13 21:05:13,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:13,597 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1094 transitions. [2019-10-13 21:05:13,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 21:05:13,598 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:13,598 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-13 21:05:13,598 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:13,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:13,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1813892898, now seen corresponding path program 1 times [2019-10-13 21:05:13,599 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:13,599 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951848546] [2019-10-13 21:05:13,599 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:13,599 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:13,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:13,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:13,631 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951848546] [2019-10-13 21:05:13,632 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:13,632 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:13,632 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240280345] [2019-10-13 21:05:13,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:13,633 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:13,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:13,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:13,634 INFO L87 Difference]: Start difference. First operand 648 states and 1094 transitions. Second operand 3 states. [2019-10-13 21:05:13,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:13,663 INFO L93 Difference]: Finished difference Result 1196 states and 2056 transitions. [2019-10-13 21:05:13,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:13,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 21:05:13,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:13,671 INFO L225 Difference]: With dead ends: 1196 [2019-10-13 21:05:13,671 INFO L226 Difference]: Without dead ends: 1194 [2019-10-13 21:05:13,672 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-13 21:05:13,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2019-10-13 21:05:13,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 904. [2019-10-13 21:05:13,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-10-13 21:05:13,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1494 transitions. [2019-10-13 21:05:13,704 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1494 transitions. Word has length 27 [2019-10-13 21:05:13,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:13,704 INFO L462 AbstractCegarLoop]: Abstraction has 904 states and 1494 transitions. [2019-10-13 21:05:13,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:13,705 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1494 transitions. [2019-10-13 21:05:13,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 21:05:13,707 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:13,707 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-13 21:05:13,707 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:13,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:13,708 INFO L82 PathProgramCache]: Analyzing trace with hash 792824544, now seen corresponding path program 1 times [2019-10-13 21:05:13,708 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:13,708 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586514987] [2019-10-13 21:05:13,709 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:13,709 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:13,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:13,733 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-13 21:05:13,733 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586514987] [2019-10-13 21:05:13,734 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:13,734 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:13,734 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737508735] [2019-10-13 21:05:13,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:13,735 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:13,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:13,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:13,735 INFO L87 Difference]: Start difference. First operand 904 states and 1494 transitions. Second operand 3 states. [2019-10-13 21:05:13,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:13,771 INFO L93 Difference]: Finished difference Result 2140 states and 3560 transitions. [2019-10-13 21:05:13,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:13,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 21:05:13,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:13,779 INFO L225 Difference]: With dead ends: 2140 [2019-10-13 21:05:13,779 INFO L226 Difference]: Without dead ends: 1258 [2019-10-13 21:05:13,782 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-13 21:05:13,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-10-13 21:05:13,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1256. [2019-10-13 21:05:13,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-10-13 21:05:13,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 2070 transitions. [2019-10-13 21:05:13,835 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 2070 transitions. Word has length 27 [2019-10-13 21:05:13,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:13,836 INFO L462 AbstractCegarLoop]: Abstraction has 1256 states and 2070 transitions. [2019-10-13 21:05:13,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:13,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 2070 transitions. [2019-10-13 21:05:13,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 21:05:13,838 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:13,838 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-13 21:05:13,838 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:13,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:13,839 INFO L82 PathProgramCache]: Analyzing trace with hash 396318762, now seen corresponding path program 1 times [2019-10-13 21:05:13,839 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:13,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379753386] [2019-10-13 21:05:13,839 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:13,839 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:13,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:13,875 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-13 21:05:13,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379753386] [2019-10-13 21:05:13,876 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:13,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:13,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347159519] [2019-10-13 21:05:13,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:13,877 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:13,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:13,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:13,877 INFO L87 Difference]: Start difference. First operand 1256 states and 2070 transitions. Second operand 3 states. [2019-10-13 21:05:13,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:13,911 INFO L93 Difference]: Finished difference Result 1884 states and 3096 transitions. [2019-10-13 21:05:13,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:13,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 21:05:13,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:13,918 INFO L225 Difference]: With dead ends: 1884 [2019-10-13 21:05:13,919 INFO L226 Difference]: Without dead ends: 1274 [2019-10-13 21:05:13,922 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-13 21:05:13,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2019-10-13 21:05:13,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1272. [2019-10-13 21:05:13,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2019-10-13 21:05:13,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 2070 transitions. [2019-10-13 21:05:13,961 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 2070 transitions. Word has length 28 [2019-10-13 21:05:13,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:13,962 INFO L462 AbstractCegarLoop]: Abstraction has 1272 states and 2070 transitions. [2019-10-13 21:05:13,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:13,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 2070 transitions. [2019-10-13 21:05:13,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 21:05:13,965 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:13,965 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-13 21:05:13,965 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:13,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:13,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1192029140, now seen corresponding path program 1 times [2019-10-13 21:05:13,966 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:13,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241545433] [2019-10-13 21:05:13,967 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:13,967 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:13,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:13,996 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-13 21:05:13,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241545433] [2019-10-13 21:05:13,996 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:13,997 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:13,997 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776146217] [2019-10-13 21:05:13,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:13,997 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:13,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:13,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:13,998 INFO L87 Difference]: Start difference. First operand 1272 states and 2070 transitions. Second operand 3 states. [2019-10-13 21:05:14,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:14,042 INFO L93 Difference]: Finished difference Result 2316 states and 3848 transitions. [2019-10-13 21:05:14,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:14,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 21:05:14,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:14,055 INFO L225 Difference]: With dead ends: 2316 [2019-10-13 21:05:14,055 INFO L226 Difference]: Without dead ends: 2314 [2019-10-13 21:05:14,056 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-13 21:05:14,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2019-10-13 21:05:14,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 1800. [2019-10-13 21:05:14,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1800 states. [2019-10-13 21:05:14,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2854 transitions. [2019-10-13 21:05:14,117 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2854 transitions. Word has length 28 [2019-10-13 21:05:14,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:14,118 INFO L462 AbstractCegarLoop]: Abstraction has 1800 states and 2854 transitions. [2019-10-13 21:05:14,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:14,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2854 transitions. [2019-10-13 21:05:14,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 21:05:14,121 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:14,122 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-13 21:05:14,122 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:14,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:14,122 INFO L82 PathProgramCache]: Analyzing trace with hash 2081869802, now seen corresponding path program 1 times [2019-10-13 21:05:14,123 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:14,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119685226] [2019-10-13 21:05:14,123 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:14,123 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:14,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:14,146 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-13 21:05:14,146 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119685226] [2019-10-13 21:05:14,146 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:14,147 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:14,147 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599731792] [2019-10-13 21:05:14,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:14,147 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:14,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:14,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:14,149 INFO L87 Difference]: Start difference. First operand 1800 states and 2854 transitions. Second operand 3 states. [2019-10-13 21:05:14,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:14,202 INFO L93 Difference]: Finished difference Result 4236 states and 6760 transitions. [2019-10-13 21:05:14,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:14,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 21:05:14,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:14,215 INFO L225 Difference]: With dead ends: 4236 [2019-10-13 21:05:14,215 INFO L226 Difference]: Without dead ends: 2474 [2019-10-13 21:05:14,220 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-13 21:05:14,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2019-10-13 21:05:14,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2472. [2019-10-13 21:05:14,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2019-10-13 21:05:14,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3910 transitions. [2019-10-13 21:05:14,289 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3910 transitions. Word has length 28 [2019-10-13 21:05:14,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:14,289 INFO L462 AbstractCegarLoop]: Abstraction has 2472 states and 3910 transitions. [2019-10-13 21:05:14,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:14,290 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3910 transitions. [2019-10-13 21:05:14,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 21:05:14,293 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:14,294 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-13 21:05:14,294 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:14,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:14,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1702016437, now seen corresponding path program 1 times [2019-10-13 21:05:14,295 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:14,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297781763] [2019-10-13 21:05:14,295 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:14,295 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:14,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:14,314 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-13 21:05:14,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297781763] [2019-10-13 21:05:14,315 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:14,315 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:14,315 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108358842] [2019-10-13 21:05:14,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:14,316 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:14,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:14,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:14,317 INFO L87 Difference]: Start difference. First operand 2472 states and 3910 transitions. Second operand 3 states. [2019-10-13 21:05:14,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:14,373 INFO L93 Difference]: Finished difference Result 3708 states and 5848 transitions. [2019-10-13 21:05:14,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:14,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 21:05:14,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:14,387 INFO L225 Difference]: With dead ends: 3708 [2019-10-13 21:05:14,387 INFO L226 Difference]: Without dead ends: 2506 [2019-10-13 21:05:14,391 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-13 21:05:14,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2019-10-13 21:05:14,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2504. [2019-10-13 21:05:14,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2019-10-13 21:05:14,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3910 transitions. [2019-10-13 21:05:14,478 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3910 transitions. Word has length 29 [2019-10-13 21:05:14,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:14,479 INFO L462 AbstractCegarLoop]: Abstraction has 2504 states and 3910 transitions. [2019-10-13 21:05:14,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:14,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3910 transitions. [2019-10-13 21:05:14,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 21:05:14,482 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:14,482 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-13 21:05:14,483 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:14,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:14,483 INFO L82 PathProgramCache]: Analyzing trace with hash 113668535, now seen corresponding path program 1 times [2019-10-13 21:05:14,483 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:14,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815864413] [2019-10-13 21:05:14,484 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:14,484 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:14,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:14,506 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-13 21:05:14,507 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815864413] [2019-10-13 21:05:14,507 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:14,507 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:14,507 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313894897] [2019-10-13 21:05:14,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:14,508 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:14,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:14,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:14,508 INFO L87 Difference]: Start difference. First operand 2504 states and 3910 transitions. Second operand 3 states. [2019-10-13 21:05:14,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:14,564 INFO L93 Difference]: Finished difference Result 4492 states and 7176 transitions. [2019-10-13 21:05:14,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:14,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 21:05:14,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:14,586 INFO L225 Difference]: With dead ends: 4492 [2019-10-13 21:05:14,586 INFO L226 Difference]: Without dead ends: 4490 [2019-10-13 21:05:14,588 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-13 21:05:14,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2019-10-13 21:05:14,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 3592. [2019-10-13 21:05:14,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3592 states. [2019-10-13 21:05:14,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 5446 transitions. [2019-10-13 21:05:14,683 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 5446 transitions. Word has length 29 [2019-10-13 21:05:14,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:14,684 INFO L462 AbstractCegarLoop]: Abstraction has 3592 states and 5446 transitions. [2019-10-13 21:05:14,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:14,684 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 5446 transitions. [2019-10-13 21:05:14,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 21:05:14,690 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:14,690 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-13 21:05:14,691 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:14,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:14,691 INFO L82 PathProgramCache]: Analyzing trace with hash -907399819, now seen corresponding path program 1 times [2019-10-13 21:05:14,691 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:14,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029231962] [2019-10-13 21:05:14,692 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:14,692 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:14,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:14,715 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-13 21:05:14,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029231962] [2019-10-13 21:05:14,716 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:14,716 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:14,716 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390870148] [2019-10-13 21:05:14,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:14,717 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:14,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:14,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:14,718 INFO L87 Difference]: Start difference. First operand 3592 states and 5446 transitions. Second operand 3 states. [2019-10-13 21:05:14,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:14,789 INFO L93 Difference]: Finished difference Result 8396 states and 12808 transitions. [2019-10-13 21:05:14,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:14,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 21:05:14,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:14,839 INFO L225 Difference]: With dead ends: 8396 [2019-10-13 21:05:14,839 INFO L226 Difference]: Without dead ends: 4874 [2019-10-13 21:05:14,855 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-13 21:05:14,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2019-10-13 21:05:15,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 4872. [2019-10-13 21:05:15,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4872 states. [2019-10-13 21:05:15,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 7366 transitions. [2019-10-13 21:05:15,024 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 7366 transitions. Word has length 29 [2019-10-13 21:05:15,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:15,024 INFO L462 AbstractCegarLoop]: Abstraction has 4872 states and 7366 transitions. [2019-10-13 21:05:15,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:15,025 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 7366 transitions. [2019-10-13 21:05:15,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 21:05:15,031 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:15,032 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-13 21:05:15,032 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:15,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:15,032 INFO L82 PathProgramCache]: Analyzing trace with hash -771028257, now seen corresponding path program 1 times [2019-10-13 21:05:15,033 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:15,033 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68295552] [2019-10-13 21:05:15,033 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:15,033 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:15,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:15,063 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-13 21:05:15,064 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68295552] [2019-10-13 21:05:15,064 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:15,064 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:15,064 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756456277] [2019-10-13 21:05:15,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:15,065 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:15,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:15,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:15,065 INFO L87 Difference]: Start difference. First operand 4872 states and 7366 transitions. Second operand 3 states. [2019-10-13 21:05:15,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:15,138 INFO L93 Difference]: Finished difference Result 7308 states and 11016 transitions. [2019-10-13 21:05:15,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:15,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-13 21:05:15,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:15,149 INFO L225 Difference]: With dead ends: 7308 [2019-10-13 21:05:15,149 INFO L226 Difference]: Without dead ends: 4938 [2019-10-13 21:05:15,155 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-13 21:05:15,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4938 states. [2019-10-13 21:05:15,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4938 to 4936. [2019-10-13 21:05:15,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4936 states. [2019-10-13 21:05:15,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4936 states to 4936 states and 7366 transitions. [2019-10-13 21:05:15,281 INFO L78 Accepts]: Start accepts. Automaton has 4936 states and 7366 transitions. Word has length 30 [2019-10-13 21:05:15,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:15,282 INFO L462 AbstractCegarLoop]: Abstraction has 4936 states and 7366 transitions. [2019-10-13 21:05:15,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:15,282 INFO L276 IsEmpty]: Start isEmpty. Operand 4936 states and 7366 transitions. [2019-10-13 21:05:15,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 21:05:15,289 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:15,289 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-13 21:05:15,289 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:15,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:15,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1935591137, now seen corresponding path program 1 times [2019-10-13 21:05:15,290 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:15,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658426032] [2019-10-13 21:05:15,290 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:15,291 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:15,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:15,314 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-13 21:05:15,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658426032] [2019-10-13 21:05:15,315 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:15,315 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:15,315 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666688102] [2019-10-13 21:05:15,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:15,316 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:15,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:15,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:15,317 INFO L87 Difference]: Start difference. First operand 4936 states and 7366 transitions. Second operand 3 states. [2019-10-13 21:05:15,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:15,445 INFO L93 Difference]: Finished difference Result 14412 states and 21320 transitions. [2019-10-13 21:05:15,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:15,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-13 21:05:15,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:15,467 INFO L225 Difference]: With dead ends: 14412 [2019-10-13 21:05:15,467 INFO L226 Difference]: Without dead ends: 9610 [2019-10-13 21:05:15,482 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-13 21:05:15,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9610 states. [2019-10-13 21:05:15,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9610 to 9608. [2019-10-13 21:05:15,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2019-10-13 21:05:15,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13958 transitions. [2019-10-13 21:05:15,789 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13958 transitions. Word has length 30 [2019-10-13 21:05:15,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:15,789 INFO L462 AbstractCegarLoop]: Abstraction has 9608 states and 13958 transitions. [2019-10-13 21:05:15,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:15,790 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13958 transitions. [2019-10-13 21:05:15,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 21:05:15,802 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:15,803 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-13 21:05:15,803 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:15,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:15,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1338307805, now seen corresponding path program 1 times [2019-10-13 21:05:15,804 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:15,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039349080] [2019-10-13 21:05:15,805 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:15,805 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:15,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:15,841 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-13 21:05:15,841 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039349080] [2019-10-13 21:05:15,841 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:15,842 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:15,842 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33651370] [2019-10-13 21:05:15,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:15,843 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:15,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:15,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:15,843 INFO L87 Difference]: Start difference. First operand 9608 states and 13958 transitions. Second operand 3 states. [2019-10-13 21:05:15,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:15,987 INFO L93 Difference]: Finished difference Result 11148 states and 16776 transitions. [2019-10-13 21:05:15,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:15,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-13 21:05:15,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:16,013 INFO L225 Difference]: With dead ends: 11148 [2019-10-13 21:05:16,014 INFO L226 Difference]: Without dead ends: 11146 [2019-10-13 21:05:16,020 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-13 21:05:16,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11146 states. [2019-10-13 21:05:16,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11146 to 9608. [2019-10-13 21:05:16,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2019-10-13 21:05:16,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13830 transitions. [2019-10-13 21:05:16,318 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13830 transitions. Word has length 30 [2019-10-13 21:05:16,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:16,319 INFO L462 AbstractCegarLoop]: Abstraction has 9608 states and 13830 transitions. [2019-10-13 21:05:16,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:16,319 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13830 transitions. [2019-10-13 21:05:16,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 21:05:16,331 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:16,331 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-13 21:05:16,331 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:16,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:16,331 INFO L82 PathProgramCache]: Analyzing trace with hash -126002102, now seen corresponding path program 1 times [2019-10-13 21:05:16,332 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:16,332 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810844794] [2019-10-13 21:05:16,332 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:16,332 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:16,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:16,352 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-13 21:05:16,352 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810844794] [2019-10-13 21:05:16,353 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:16,353 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:16,353 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104283748] [2019-10-13 21:05:16,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:16,354 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:16,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:16,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:16,355 INFO L87 Difference]: Start difference. First operand 9608 states and 13830 transitions. Second operand 3 states. [2019-10-13 21:05:16,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:16,537 INFO L93 Difference]: Finished difference Result 16780 states and 24712 transitions. [2019-10-13 21:05:16,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:16,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-13 21:05:16,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:16,575 INFO L225 Difference]: With dead ends: 16780 [2019-10-13 21:05:16,575 INFO L226 Difference]: Without dead ends: 16778 [2019-10-13 21:05:16,585 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-13 21:05:16,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16778 states. [2019-10-13 21:05:16,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16778 to 14216. [2019-10-13 21:05:16,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2019-10-13 21:05:16,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 19846 transitions. [2019-10-13 21:05:16,985 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 19846 transitions. Word has length 31 [2019-10-13 21:05:16,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:16,985 INFO L462 AbstractCegarLoop]: Abstraction has 14216 states and 19846 transitions. [2019-10-13 21:05:16,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:16,985 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 19846 transitions. [2019-10-13 21:05:17,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 21:05:17,007 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:17,008 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-13 21:05:17,008 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:17,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:17,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1147070456, now seen corresponding path program 1 times [2019-10-13 21:05:17,008 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:17,009 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041952528] [2019-10-13 21:05:17,009 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:17,009 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:17,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:17,028 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-13 21:05:17,028 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041952528] [2019-10-13 21:05:17,029 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:17,029 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:17,029 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480525129] [2019-10-13 21:05:17,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:17,030 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:17,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:17,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:17,030 INFO L87 Difference]: Start difference. First operand 14216 states and 19846 transitions. Second operand 3 states. [2019-10-13 21:05:17,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:17,249 INFO L93 Difference]: Finished difference Result 32908 states and 46216 transitions. [2019-10-13 21:05:17,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:17,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-13 21:05:17,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:17,286 INFO L225 Difference]: With dead ends: 32908 [2019-10-13 21:05:17,287 INFO L226 Difference]: Without dead ends: 18826 [2019-10-13 21:05:17,316 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:17,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18826 states. [2019-10-13 21:05:18,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18826 to 18824. [2019-10-13 21:05:18,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18824 states. [2019-10-13 21:05:18,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18824 states to 18824 states and 26118 transitions. [2019-10-13 21:05:18,195 INFO L78 Accepts]: Start accepts. Automaton has 18824 states and 26118 transitions. Word has length 31 [2019-10-13 21:05:18,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:18,196 INFO L462 AbstractCegarLoop]: Abstraction has 18824 states and 26118 transitions. [2019-10-13 21:05:18,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:18,196 INFO L276 IsEmpty]: Start isEmpty. Operand 18824 states and 26118 transitions. [2019-10-13 21:05:18,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 21:05:18,220 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:18,220 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-13 21:05:18,220 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:18,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:18,221 INFO L82 PathProgramCache]: Analyzing trace with hash 389117270, now seen corresponding path program 1 times [2019-10-13 21:05:18,221 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:18,221 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237133690] [2019-10-13 21:05:18,221 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:18,222 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:18,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:18,238 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-13 21:05:18,239 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237133690] [2019-10-13 21:05:18,239 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:18,239 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:18,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343058557] [2019-10-13 21:05:18,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:18,240 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:18,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:18,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:18,240 INFO L87 Difference]: Start difference. First operand 18824 states and 26118 transitions. Second operand 3 states. [2019-10-13 21:05:18,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:18,448 INFO L93 Difference]: Finished difference Result 28428 states and 39432 transitions. [2019-10-13 21:05:18,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:18,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-13 21:05:18,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:18,485 INFO L225 Difference]: With dead ends: 28428 [2019-10-13 21:05:18,485 INFO L226 Difference]: Without dead ends: 19210 [2019-10-13 21:05:18,507 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-13 21:05:18,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19210 states. [2019-10-13 21:05:18,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19210 to 19208. [2019-10-13 21:05:18,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19208 states. [2019-10-13 21:05:18,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19208 states to 19208 states and 26374 transitions. [2019-10-13 21:05:18,966 INFO L78 Accepts]: Start accepts. Automaton has 19208 states and 26374 transitions. Word has length 32 [2019-10-13 21:05:18,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:18,966 INFO L462 AbstractCegarLoop]: Abstraction has 19208 states and 26374 transitions. [2019-10-13 21:05:18,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:18,967 INFO L276 IsEmpty]: Start isEmpty. Operand 19208 states and 26374 transitions. [2019-10-13 21:05:18,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 21:05:18,996 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:18,996 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-13 21:05:18,996 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:18,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:18,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1199230632, now seen corresponding path program 1 times [2019-10-13 21:05:18,997 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:18,998 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858606405] [2019-10-13 21:05:18,999 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:18,999 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:18,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:19,026 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-13 21:05:19,028 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858606405] [2019-10-13 21:05:19,028 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:19,028 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:19,028 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591383240] [2019-10-13 21:05:19,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:19,029 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:19,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:19,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:19,030 INFO L87 Difference]: Start difference. First operand 19208 states and 26374 transitions. Second operand 3 states. [2019-10-13 21:05:19,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:19,300 INFO L93 Difference]: Finished difference Result 32780 states and 45832 transitions. [2019-10-13 21:05:19,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:19,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-13 21:05:19,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:19,366 INFO L225 Difference]: With dead ends: 32780 [2019-10-13 21:05:19,366 INFO L226 Difference]: Without dead ends: 32778 [2019-10-13 21:05:19,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-13 21:05:19,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32778 states. [2019-10-13 21:05:19,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32778 to 28680. [2019-10-13 21:05:19,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28680 states. [2019-10-13 21:05:20,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28680 states to 28680 states and 38150 transitions. [2019-10-13 21:05:20,045 INFO L78 Accepts]: Start accepts. Automaton has 28680 states and 38150 transitions. Word has length 32 [2019-10-13 21:05:20,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:20,046 INFO L462 AbstractCegarLoop]: Abstraction has 28680 states and 38150 transitions. [2019-10-13 21:05:20,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:20,046 INFO L276 IsEmpty]: Start isEmpty. Operand 28680 states and 38150 transitions. [2019-10-13 21:05:20,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 21:05:20,088 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:20,089 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:20,089 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:20,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:20,089 INFO L82 PathProgramCache]: Analyzing trace with hash 2074668310, now seen corresponding path program 1 times [2019-10-13 21:05:20,090 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:20,090 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083405775] [2019-10-13 21:05:20,090 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,090 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:20,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:20,107 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083405775] [2019-10-13 21:05:20,108 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:20,108 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:20,108 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956818216] [2019-10-13 21:05:20,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:20,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:20,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:20,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:20,109 INFO L87 Difference]: Start difference. First operand 28680 states and 38150 transitions. Second operand 3 states. [2019-10-13 21:05:21,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:21,096 INFO L93 Difference]: Finished difference Result 65548 states and 87304 transitions. [2019-10-13 21:05:21,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:21,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-13 21:05:21,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:21,154 INFO L225 Difference]: With dead ends: 65548 [2019-10-13 21:05:21,154 INFO L226 Difference]: Without dead ends: 37386 [2019-10-13 21:05:21,202 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-13 21:05:21,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37386 states. [2019-10-13 21:05:21,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37386 to 37384. [2019-10-13 21:05:21,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37384 states. [2019-10-13 21:05:22,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37384 states to 37384 states and 49158 transitions. [2019-10-13 21:05:22,001 INFO L78 Accepts]: Start accepts. Automaton has 37384 states and 49158 transitions. Word has length 32 [2019-10-13 21:05:22,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:22,002 INFO L462 AbstractCegarLoop]: Abstraction has 37384 states and 49158 transitions. [2019-10-13 21:05:22,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:22,002 INFO L276 IsEmpty]: Start isEmpty. Operand 37384 states and 49158 transitions. [2019-10-13 21:05:22,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-13 21:05:22,019 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:22,019 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-13 21:05:22,019 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:22,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:22,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1478771549, now seen corresponding path program 1 times [2019-10-13 21:05:22,020 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:22,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008184003] [2019-10-13 21:05:22,020 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:22,020 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:22,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:22,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-13 21:05:22,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008184003] [2019-10-13 21:05:22,040 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:22,041 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:22,041 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136877797] [2019-10-13 21:05:22,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:22,041 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:22,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:22,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:22,042 INFO L87 Difference]: Start difference. First operand 37384 states and 49158 transitions. Second operand 3 states. [2019-10-13 21:05:22,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:22,359 INFO L93 Difference]: Finished difference Result 56076 states and 73480 transitions. [2019-10-13 21:05:22,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:22,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-13 21:05:22,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:22,400 INFO L225 Difference]: With dead ends: 56076 [2019-10-13 21:05:22,401 INFO L226 Difference]: Without dead ends: 37898 [2019-10-13 21:05:22,422 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-13 21:05:22,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37898 states. [2019-10-13 21:05:23,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37898 to 37896. [2019-10-13 21:05:23,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37896 states. [2019-10-13 21:05:23,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37896 states to 37896 states and 49158 transitions. [2019-10-13 21:05:23,212 INFO L78 Accepts]: Start accepts. Automaton has 37896 states and 49158 transitions. Word has length 33 [2019-10-13 21:05:23,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:23,212 INFO L462 AbstractCegarLoop]: Abstraction has 37896 states and 49158 transitions. [2019-10-13 21:05:23,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:23,213 INFO L276 IsEmpty]: Start isEmpty. Operand 37896 states and 49158 transitions. [2019-10-13 21:05:23,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-13 21:05:23,228 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:23,228 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-13 21:05:23,228 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:23,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:23,229 INFO L82 PathProgramCache]: Analyzing trace with hash -109576353, now seen corresponding path program 1 times [2019-10-13 21:05:23,229 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:23,229 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138079807] [2019-10-13 21:05:23,229 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:23,230 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:23,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:23,246 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-13 21:05:23,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138079807] [2019-10-13 21:05:23,247 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:23,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:23,247 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475568328] [2019-10-13 21:05:23,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:23,248 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:23,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:23,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:23,248 INFO L87 Difference]: Start difference. First operand 37896 states and 49158 transitions. Second operand 3 states. [2019-10-13 21:05:23,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:23,578 INFO L93 Difference]: Finished difference Result 63500 states and 83464 transitions. [2019-10-13 21:05:23,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:23,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-13 21:05:23,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:23,643 INFO L225 Difference]: With dead ends: 63500 [2019-10-13 21:05:23,643 INFO L226 Difference]: Without dead ends: 63498 [2019-10-13 21:05:23,657 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-13 21:05:23,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63498 states. [2019-10-13 21:05:24,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63498 to 57352. [2019-10-13 21:05:24,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57352 states. [2019-10-13 21:05:24,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57352 states to 57352 states and 72198 transitions. [2019-10-13 21:05:24,549 INFO L78 Accepts]: Start accepts. Automaton has 57352 states and 72198 transitions. Word has length 33 [2019-10-13 21:05:24,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:24,549 INFO L462 AbstractCegarLoop]: Abstraction has 57352 states and 72198 transitions. [2019-10-13 21:05:24,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:24,549 INFO L276 IsEmpty]: Start isEmpty. Operand 57352 states and 72198 transitions. [2019-10-13 21:05:24,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-13 21:05:24,585 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:24,585 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-13 21:05:24,585 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:24,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:24,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1130644707, now seen corresponding path program 1 times [2019-10-13 21:05:24,586 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:24,586 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608954923] [2019-10-13 21:05:24,586 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:24,586 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:24,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:24,601 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-13 21:05:24,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608954923] [2019-10-13 21:05:24,602 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:24,602 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:24,602 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146229034] [2019-10-13 21:05:24,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:24,603 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:24,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:24,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:24,603 INFO L87 Difference]: Start difference. First operand 57352 states and 72198 transitions. Second operand 3 states. [2019-10-13 21:05:26,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:26,126 INFO L93 Difference]: Finished difference Result 130060 states and 163336 transitions. [2019-10-13 21:05:26,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:26,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-13 21:05:26,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:26,198 INFO L225 Difference]: With dead ends: 130060 [2019-10-13 21:05:26,198 INFO L226 Difference]: Without dead ends: 73738 [2019-10-13 21:05:26,243 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-13 21:05:26,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73738 states. [2019-10-13 21:05:27,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73738 to 73736. [2019-10-13 21:05:27,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73736 states. [2019-10-13 21:05:27,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73736 states to 73736 states and 91142 transitions. [2019-10-13 21:05:27,264 INFO L78 Accepts]: Start accepts. Automaton has 73736 states and 91142 transitions. Word has length 33 [2019-10-13 21:05:27,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:27,264 INFO L462 AbstractCegarLoop]: Abstraction has 73736 states and 91142 transitions. [2019-10-13 21:05:27,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:27,264 INFO L276 IsEmpty]: Start isEmpty. Operand 73736 states and 91142 transitions. [2019-10-13 21:05:27,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-13 21:05:27,295 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:27,295 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-13 21:05:27,295 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:27,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:27,296 INFO L82 PathProgramCache]: Analyzing trace with hash 898316171, now seen corresponding path program 1 times [2019-10-13 21:05:27,296 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:27,296 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220709065] [2019-10-13 21:05:27,296 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:27,296 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:27,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:27,329 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-13 21:05:27,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220709065] [2019-10-13 21:05:27,330 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:27,330 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:27,330 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064053555] [2019-10-13 21:05:27,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:27,332 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:27,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:27,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:27,332 INFO L87 Difference]: Start difference. First operand 73736 states and 91142 transitions. Second operand 3 states. [2019-10-13 21:05:27,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:27,783 INFO L93 Difference]: Finished difference Result 110604 states and 136200 transitions. [2019-10-13 21:05:27,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:27,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-13 21:05:27,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:27,855 INFO L225 Difference]: With dead ends: 110604 [2019-10-13 21:05:27,856 INFO L226 Difference]: Without dead ends: 74762 [2019-10-13 21:05:27,895 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-13 21:05:27,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74762 states. [2019-10-13 21:05:29,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74762 to 74760. [2019-10-13 21:05:29,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74760 states. [2019-10-13 21:05:29,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74760 states to 74760 states and 91142 transitions. [2019-10-13 21:05:29,176 INFO L78 Accepts]: Start accepts. Automaton has 74760 states and 91142 transitions. Word has length 34 [2019-10-13 21:05:29,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:29,177 INFO L462 AbstractCegarLoop]: Abstraction has 74760 states and 91142 transitions. [2019-10-13 21:05:29,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:29,177 INFO L276 IsEmpty]: Start isEmpty. Operand 74760 states and 91142 transitions. [2019-10-13 21:05:29,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-13 21:05:29,208 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:29,208 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-13 21:05:29,208 INFO L410 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:29,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:29,209 INFO L82 PathProgramCache]: Analyzing trace with hash -690031731, now seen corresponding path program 1 times [2019-10-13 21:05:29,209 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:29,209 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009122016] [2019-10-13 21:05:29,209 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:29,209 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:29,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:29,231 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-13 21:05:29,231 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009122016] [2019-10-13 21:05:29,231 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:29,231 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:29,231 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918542936] [2019-10-13 21:05:29,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:29,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:29,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:29,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:29,233 INFO L87 Difference]: Start difference. First operand 74760 states and 91142 transitions. Second operand 3 states. [2019-10-13 21:05:31,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:31,210 INFO L93 Difference]: Finished difference Result 122892 states and 150536 transitions. [2019-10-13 21:05:31,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:31,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-13 21:05:31,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:31,313 INFO L225 Difference]: With dead ends: 122892 [2019-10-13 21:05:31,313 INFO L226 Difference]: Without dead ends: 122890 [2019-10-13 21:05:31,329 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-13 21:05:31,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122890 states. [2019-10-13 21:05:32,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122890 to 114696. [2019-10-13 21:05:32,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114696 states. [2019-10-13 21:05:32,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114696 states to 114696 states and 136198 transitions. [2019-10-13 21:05:32,777 INFO L78 Accepts]: Start accepts. Automaton has 114696 states and 136198 transitions. Word has length 34 [2019-10-13 21:05:32,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:32,778 INFO L462 AbstractCegarLoop]: Abstraction has 114696 states and 136198 transitions. [2019-10-13 21:05:32,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:32,778 INFO L276 IsEmpty]: Start isEmpty. Operand 114696 states and 136198 transitions. [2019-10-13 21:05:32,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-13 21:05:32,845 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:32,845 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:32,845 INFO L410 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:32,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:32,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1711100085, now seen corresponding path program 1 times [2019-10-13 21:05:32,845 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:32,846 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688373948] [2019-10-13 21:05:32,846 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:32,846 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:32,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:32,875 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-13 21:05:32,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688373948] [2019-10-13 21:05:32,875 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:32,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:32,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763266225] [2019-10-13 21:05:32,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:32,876 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:32,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:32,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:32,877 INFO L87 Difference]: Start difference. First operand 114696 states and 136198 transitions. Second operand 3 states. [2019-10-13 21:05:33,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:33,969 INFO L93 Difference]: Finished difference Result 258060 states and 304136 transitions. [2019-10-13 21:05:33,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:33,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-13 21:05:33,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:34,128 INFO L225 Difference]: With dead ends: 258060 [2019-10-13 21:05:34,128 INFO L226 Difference]: Without dead ends: 145418 [2019-10-13 21:05:36,636 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-13 21:05:36,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145418 states. [2019-10-13 21:05:38,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145418 to 145416. [2019-10-13 21:05:38,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145416 states. [2019-10-13 21:05:38,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145416 states to 145416 states and 167942 transitions. [2019-10-13 21:05:38,562 INFO L78 Accepts]: Start accepts. Automaton has 145416 states and 167942 transitions. Word has length 34 [2019-10-13 21:05:38,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:38,562 INFO L462 AbstractCegarLoop]: Abstraction has 145416 states and 167942 transitions. [2019-10-13 21:05:38,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:38,562 INFO L276 IsEmpty]: Start isEmpty. Operand 145416 states and 167942 transitions. [2019-10-13 21:05:38,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-13 21:05:38,624 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:38,624 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-13 21:05:38,625 INFO L410 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:38,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:38,625 INFO L82 PathProgramCache]: Analyzing trace with hash 84068978, now seen corresponding path program 1 times [2019-10-13 21:05:38,625 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:38,625 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937821417] [2019-10-13 21:05:38,625 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:38,625 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:38,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:38,658 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-13 21:05:38,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937821417] [2019-10-13 21:05:38,658 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:38,658 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:38,659 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36099832] [2019-10-13 21:05:38,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:38,659 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:38,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:38,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:38,660 INFO L87 Difference]: Start difference. First operand 145416 states and 167942 transitions. Second operand 3 states. [2019-10-13 21:05:39,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:39,620 INFO L93 Difference]: Finished difference Result 218124 states and 250888 transitions. [2019-10-13 21:05:39,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:39,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-13 21:05:39,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:39,779 INFO L225 Difference]: With dead ends: 218124 [2019-10-13 21:05:39,779 INFO L226 Difference]: Without dead ends: 147466 [2019-10-13 21:05:39,855 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-13 21:05:39,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147466 states. [2019-10-13 21:05:43,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147466 to 147464. [2019-10-13 21:05:43,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147464 states. [2019-10-13 21:05:44,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147464 states to 147464 states and 167942 transitions. [2019-10-13 21:05:44,020 INFO L78 Accepts]: Start accepts. Automaton has 147464 states and 167942 transitions. Word has length 35 [2019-10-13 21:05:44,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:44,020 INFO L462 AbstractCegarLoop]: Abstraction has 147464 states and 167942 transitions. [2019-10-13 21:05:44,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:44,020 INFO L276 IsEmpty]: Start isEmpty. Operand 147464 states and 167942 transitions. [2019-10-13 21:05:44,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-13 21:05:44,083 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:44,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, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:44,083 INFO L410 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:44,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:44,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1504278924, now seen corresponding path program 1 times [2019-10-13 21:05:44,084 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:44,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396321506] [2019-10-13 21:05:44,084 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:44,084 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:44,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:44,113 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-13 21:05:44,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396321506] [2019-10-13 21:05:44,113 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:44,113 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:44,113 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019107391] [2019-10-13 21:05:44,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:44,114 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:44,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:44,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:44,115 INFO L87 Difference]: Start difference. First operand 147464 states and 167942 transitions. Second operand 3 states.