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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/locks/test_locks_14-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:26:48,748 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:26:48,751 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:26:48,769 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:26:48,769 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:26:48,770 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:26:48,773 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:26:48,785 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:26:48,788 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:26:48,789 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:26:48,790 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:26:48,791 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:26:48,791 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:26:48,792 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:26:48,793 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:26:48,794 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:26:48,795 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:26:48,796 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:26:48,797 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:26:48,800 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:26:48,801 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:26:48,802 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:26:48,803 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:26:48,806 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:26:48,809 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:26:48,809 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:26:48,809 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:26:48,810 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:26:48,811 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:26:48,811 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:26:48,812 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:26:48,813 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:26:48,814 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:26:48,815 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:26:48,818 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:26:48,818 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:26:48,819 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:26:48,819 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:26:48,819 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:26:48,822 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:26:48,825 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:26:48,825 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-20 13:26:48,849 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:26:48,850 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:26:48,852 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:26:48,852 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:26:48,853 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:26:48,853 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:26:48,853 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:26:48,853 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:26:48,854 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:26:48,854 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:26:48,854 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:26:48,855 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:26:48,855 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:26:48,855 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:26:48,855 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:26:48,855 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:26:48,856 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:26:48,856 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:26:48,856 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:26:48,856 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:26:48,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:26:48,857 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:26:48,857 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:26:48,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:26:48,858 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:26:48,859 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:26:48,859 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:26:48,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:26:48,859 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:26:48,859 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:26:48,910 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:26:48,928 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:26:48,932 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:26:48,933 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:26:48,933 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:26:48,934 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_14-1.c [2019-09-20 13:26:49,004 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78b8d36db/557333b990ff4834afda9e0d5b5092fe/FLAGaa4887ef8 [2019-09-20 13:26:49,455 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:26:49,456 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14-1.c [2019-09-20 13:26:49,464 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78b8d36db/557333b990ff4834afda9e0d5b5092fe/FLAGaa4887ef8 [2019-09-20 13:26:49,883 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78b8d36db/557333b990ff4834afda9e0d5b5092fe [2019-09-20 13:26:49,891 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:26:49,893 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:26:49,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:26:49,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:26:49,897 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:26:49,898 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:26:49" (1/1) ... [2019-09-20 13:26:49,901 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f8701c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:49, skipping insertion in model container [2019-09-20 13:26:49,901 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:26:49" (1/1) ... [2019-09-20 13:26:49,908 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:26:49,945 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:26:50,155 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:26:50,159 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:26:50,287 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:26:50,303 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:26:50,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:50 WrapperNode [2019-09-20 13:26:50,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:26:50,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:26:50,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:26:50,305 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:26:50,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:50" (1/1) ... [2019-09-20 13:26:50,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:50" (1/1) ... [2019-09-20 13:26:50,321 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:50" (1/1) ... [2019-09-20 13:26:50,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:50" (1/1) ... [2019-09-20 13:26:50,328 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:50" (1/1) ... [2019-09-20 13:26:50,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:50" (1/1) ... [2019-09-20 13:26:50,338 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:50" (1/1) ... [2019-09-20 13:26:50,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:26:50,341 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:26:50,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:26:50,341 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:26:50,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:50" (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-09-20 13:26:50,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:26:50,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:26:50,398 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:26:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:26:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:26:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:26:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:26:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:26:50,775 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:26:50,775 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:26:50,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:26:50 BoogieIcfgContainer [2019-09-20 13:26:50,777 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:26:50,778 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:26:50,778 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:26:50,781 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:26:50,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:26:49" (1/3) ... [2019-09-20 13:26:50,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ce36b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:26:50, skipping insertion in model container [2019-09-20 13:26:50,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:50" (2/3) ... [2019-09-20 13:26:50,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ce36b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:26:50, skipping insertion in model container [2019-09-20 13:26:50,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:26:50" (3/3) ... [2019-09-20 13:26:50,784 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2019-09-20 13:26:50,794 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:26:50,801 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:26:50,824 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:26:50,851 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:26:50,851 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:26:50,851 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:26:50,851 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:26:50,851 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:26:50,852 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:26:50,852 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:26:50,852 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:26:50,868 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2019-09-20 13:26:50,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:26:50,878 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:50,878 INFO L407 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-09-20 13:26:50,880 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:50,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:50,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1694520263, now seen corresponding path program 1 times [2019-09-20 13:26:50,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:50,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:50,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:51,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,092 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,113 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 3 states. [2019-09-20 13:26:51,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,180 INFO L93 Difference]: Finished difference Result 104 states and 185 transitions. [2019-09-20 13:26:51,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:26:51,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,193 INFO L225 Difference]: With dead ends: 104 [2019-09-20 13:26:51,193 INFO L226 Difference]: Without dead ends: 96 [2019-09-20 13:26:51,205 INFO L636 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-09-20 13:26:51,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-20 13:26:51,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2019-09-20 13:26:51,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-20 13:26:51,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 121 transitions. [2019-09-20 13:26:51,258 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 121 transitions. Word has length 24 [2019-09-20 13:26:51,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,259 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 121 transitions. [2019-09-20 13:26:51,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,259 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 121 transitions. [2019-09-20 13:26:51,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:26:51,261 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,261 INFO L407 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-09-20 13:26:51,261 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,262 INFO L82 PathProgramCache]: Analyzing trace with hash 106172361, now seen corresponding path program 1 times [2019-09-20 13:26:51,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:51,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,366 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,369 INFO L87 Difference]: Start difference. First operand 66 states and 121 transitions. Second operand 3 states. [2019-09-20 13:26:51,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,415 INFO L93 Difference]: Finished difference Result 96 states and 174 transitions. [2019-09-20 13:26:51,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:26:51,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,421 INFO L225 Difference]: With dead ends: 96 [2019-09-20 13:26:51,421 INFO L226 Difference]: Without dead ends: 96 [2019-09-20 13:26:51,422 INFO L636 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-09-20 13:26:51,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-20 13:26:51,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-09-20 13:26:51,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-09-20 13:26:51,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 173 transitions. [2019-09-20 13:26:51,438 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 173 transitions. Word has length 24 [2019-09-20 13:26:51,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,440 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 173 transitions. [2019-09-20 13:26:51,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,440 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 173 transitions. [2019-09-20 13:26:51,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:26:51,443 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,443 INFO L407 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-09-20 13:26:51,443 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,444 INFO L82 PathProgramCache]: Analyzing trace with hash 990732685, now seen corresponding path program 1 times [2019-09-20 13:26:51,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:51,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,536 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,539 INFO L87 Difference]: Start difference. First operand 94 states and 173 transitions. Second operand 3 states. [2019-09-20 13:26:51,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,564 INFO L93 Difference]: Finished difference Result 99 states and 176 transitions. [2019-09-20 13:26:51,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:26:51,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,566 INFO L225 Difference]: With dead ends: 99 [2019-09-20 13:26:51,567 INFO L226 Difference]: Without dead ends: 99 [2019-09-20 13:26:51,567 INFO L636 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-09-20 13:26:51,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-20 13:26:51,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-09-20 13:26:51,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-20 13:26:51,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 175 transitions. [2019-09-20 13:26:51,577 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 175 transitions. Word has length 25 [2019-09-20 13:26:51,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,578 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 175 transitions. [2019-09-20 13:26:51,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,578 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 175 transitions. [2019-09-20 13:26:51,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:26:51,579 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,579 INFO L407 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-09-20 13:26:51,580 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1003412021, now seen corresponding path program 1 times [2019-09-20 13:26:51,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:51,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,637 INFO L87 Difference]: Start difference. First operand 97 states and 175 transitions. Second operand 3 states. [2019-09-20 13:26:51,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,661 INFO L93 Difference]: Finished difference Result 182 states and 333 transitions. [2019-09-20 13:26:51,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:26:51,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,665 INFO L225 Difference]: With dead ends: 182 [2019-09-20 13:26:51,665 INFO L226 Difference]: Without dead ends: 182 [2019-09-20 13:26:51,666 INFO L636 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-09-20 13:26:51,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-20 13:26:51,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 128. [2019-09-20 13:26:51,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-20 13:26:51,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 232 transitions. [2019-09-20 13:26:51,677 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 232 transitions. Word has length 25 [2019-09-20 13:26:51,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,678 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 232 transitions. [2019-09-20 13:26:51,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,678 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 232 transitions. [2019-09-20 13:26:51,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:26:51,679 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,680 INFO L407 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-09-20 13:26:51,680 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1703207373, now seen corresponding path program 1 times [2019-09-20 13:26:51,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:51,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,727 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,729 INFO L87 Difference]: Start difference. First operand 128 states and 232 transitions. Second operand 3 states. [2019-09-20 13:26:51,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,766 INFO L93 Difference]: Finished difference Result 184 states and 331 transitions. [2019-09-20 13:26:51,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:26:51,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,768 INFO L225 Difference]: With dead ends: 184 [2019-09-20 13:26:51,769 INFO L226 Difference]: Without dead ends: 184 [2019-09-20 13:26:51,769 INFO L636 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-09-20 13:26:51,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-20 13:26:51,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2019-09-20 13:26:51,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-20 13:26:51,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 330 transitions. [2019-09-20 13:26:51,782 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 330 transitions. Word has length 25 [2019-09-20 13:26:51,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,782 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 330 transitions. [2019-09-20 13:26:51,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,783 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 330 transitions. [2019-09-20 13:26:51,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:26:51,784 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,784 INFO L407 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-09-20 13:26:51,785 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1040789154, now seen corresponding path program 1 times [2019-09-20 13:26:51,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:51,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,831 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,833 INFO L87 Difference]: Start difference. First operand 182 states and 330 transitions. Second operand 3 states. [2019-09-20 13:26:51,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,855 INFO L93 Difference]: Finished difference Result 186 states and 331 transitions. [2019-09-20 13:26:51,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:26:51,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,859 INFO L225 Difference]: With dead ends: 186 [2019-09-20 13:26:51,859 INFO L226 Difference]: Without dead ends: 186 [2019-09-20 13:26:51,859 INFO L636 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-09-20 13:26:51,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-20 13:26:51,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2019-09-20 13:26:51,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-20 13:26:51,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 330 transitions. [2019-09-20 13:26:51,879 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 330 transitions. Word has length 26 [2019-09-20 13:26:51,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,880 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 330 transitions. [2019-09-20 13:26:51,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,880 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 330 transitions. [2019-09-20 13:26:51,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:26:51,881 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,882 INFO L407 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-09-20 13:26:51,882 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1260033436, now seen corresponding path program 1 times [2019-09-20 13:26:51,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:51,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,944 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,950 INFO L87 Difference]: Start difference. First operand 184 states and 330 transitions. Second operand 3 states. [2019-09-20 13:26:51,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,975 INFO L93 Difference]: Finished difference Result 346 states and 627 transitions. [2019-09-20 13:26:51,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:26:51,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,979 INFO L225 Difference]: With dead ends: 346 [2019-09-20 13:26:51,980 INFO L226 Difference]: Without dead ends: 346 [2019-09-20 13:26:51,981 INFO L636 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-09-20 13:26:51,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-09-20 13:26:51,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 248. [2019-09-20 13:26:51,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-20 13:26:51,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 442 transitions. [2019-09-20 13:26:52,001 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 442 transitions. Word has length 26 [2019-09-20 13:26:52,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:52,002 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 442 transitions. [2019-09-20 13:26:52,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:52,002 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 442 transitions. [2019-09-20 13:26:52,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:26:52,024 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:52,024 INFO L407 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-09-20 13:26:52,025 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:52,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:52,025 INFO L82 PathProgramCache]: Analyzing trace with hash -328314466, now seen corresponding path program 1 times [2019-09-20 13:26:52,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:52,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:52,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:52,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:52,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:52,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:52,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:52,056 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:52,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:52,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:52,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:52,057 INFO L87 Difference]: Start difference. First operand 248 states and 442 transitions. Second operand 3 states. [2019-09-20 13:26:52,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:52,073 INFO L93 Difference]: Finished difference Result 354 states and 627 transitions. [2019-09-20 13:26:52,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:52,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:26:52,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:52,076 INFO L225 Difference]: With dead ends: 354 [2019-09-20 13:26:52,076 INFO L226 Difference]: Without dead ends: 354 [2019-09-20 13:26:52,076 INFO L636 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-09-20 13:26:52,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-09-20 13:26:52,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2019-09-20 13:26:52,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-20 13:26:52,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 626 transitions. [2019-09-20 13:26:52,086 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 626 transitions. Word has length 26 [2019-09-20 13:26:52,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:52,086 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 626 transitions. [2019-09-20 13:26:52,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:52,087 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 626 transitions. [2019-09-20 13:26:52,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:26:52,088 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:52,088 INFO L407 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-09-20 13:26:52,088 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:52,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:52,089 INFO L82 PathProgramCache]: Analyzing trace with hash 406543618, now seen corresponding path program 1 times [2019-09-20 13:26:52,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:52,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:52,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:52,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:52,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:52,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:52,126 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:52,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:52,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:52,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:52,127 INFO L87 Difference]: Start difference. First operand 352 states and 626 transitions. Second operand 3 states. [2019-09-20 13:26:52,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:52,141 INFO L93 Difference]: Finished difference Result 358 states and 627 transitions. [2019-09-20 13:26:52,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:52,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-20 13:26:52,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:52,146 INFO L225 Difference]: With dead ends: 358 [2019-09-20 13:26:52,146 INFO L226 Difference]: Without dead ends: 358 [2019-09-20 13:26:52,146 INFO L636 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-09-20 13:26:52,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-09-20 13:26:52,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-09-20 13:26:52,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-09-20 13:26:52,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 626 transitions. [2019-09-20 13:26:52,157 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 626 transitions. Word has length 27 [2019-09-20 13:26:52,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:52,159 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 626 transitions. [2019-09-20 13:26:52,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:52,159 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 626 transitions. [2019-09-20 13:26:52,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:26:52,163 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:52,163 INFO L407 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-09-20 13:26:52,163 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:52,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:52,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1587601088, now seen corresponding path program 1 times [2019-09-20 13:26:52,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:52,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:52,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:52,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:52,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:52,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:52,210 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:52,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:52,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:52,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:52,211 INFO L87 Difference]: Start difference. First operand 356 states and 626 transitions. Second operand 3 states. [2019-09-20 13:26:52,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:52,228 INFO L93 Difference]: Finished difference Result 666 states and 1183 transitions. [2019-09-20 13:26:52,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:52,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-20 13:26:52,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:52,232 INFO L225 Difference]: With dead ends: 666 [2019-09-20 13:26:52,232 INFO L226 Difference]: Without dead ends: 666 [2019-09-20 13:26:52,233 INFO L636 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-09-20 13:26:52,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-09-20 13:26:52,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 488. [2019-09-20 13:26:52,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-20 13:26:52,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 846 transitions. [2019-09-20 13:26:52,249 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 846 transitions. Word has length 27 [2019-09-20 13:26:52,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:52,251 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 846 transitions. [2019-09-20 13:26:52,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:52,252 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 846 transitions. [2019-09-20 13:26:52,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:26:52,254 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:52,254 INFO L407 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-09-20 13:26:52,254 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:52,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:52,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1119018306, now seen corresponding path program 1 times [2019-09-20 13:26:52,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:52,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:52,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:52,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:52,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:52,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:52,297 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:52,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:52,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:52,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:52,299 INFO L87 Difference]: Start difference. First operand 488 states and 846 transitions. Second operand 3 states. [2019-09-20 13:26:52,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:52,316 INFO L93 Difference]: Finished difference Result 690 states and 1191 transitions. [2019-09-20 13:26:52,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:52,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-20 13:26:52,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:52,320 INFO L225 Difference]: With dead ends: 690 [2019-09-20 13:26:52,321 INFO L226 Difference]: Without dead ends: 690 [2019-09-20 13:26:52,321 INFO L636 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-09-20 13:26:52,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-09-20 13:26:52,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 688. [2019-09-20 13:26:52,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2019-09-20 13:26:52,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1190 transitions. [2019-09-20 13:26:52,338 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1190 transitions. Word has length 27 [2019-09-20 13:26:52,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:52,338 INFO L475 AbstractCegarLoop]: Abstraction has 688 states and 1190 transitions. [2019-09-20 13:26:52,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:52,338 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1190 transitions. [2019-09-20 13:26:52,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:26:52,339 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:52,340 INFO L407 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-09-20 13:26:52,340 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:52,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:52,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1970780365, now seen corresponding path program 1 times [2019-09-20 13:26:52,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:52,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:52,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:52,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:52,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:52,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:52,372 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:52,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:52,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:52,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:52,374 INFO L87 Difference]: Start difference. First operand 688 states and 1190 transitions. Second operand 3 states. [2019-09-20 13:26:52,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:52,393 INFO L93 Difference]: Finished difference Result 698 states and 1191 transitions. [2019-09-20 13:26:52,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:52,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-20 13:26:52,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:52,397 INFO L225 Difference]: With dead ends: 698 [2019-09-20 13:26:52,397 INFO L226 Difference]: Without dead ends: 698 [2019-09-20 13:26:52,397 INFO L636 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-09-20 13:26:52,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-09-20 13:26:52,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2019-09-20 13:26:52,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-09-20 13:26:52,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1190 transitions. [2019-09-20 13:26:52,413 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1190 transitions. Word has length 28 [2019-09-20 13:26:52,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:52,413 INFO L475 AbstractCegarLoop]: Abstraction has 696 states and 1190 transitions. [2019-09-20 13:26:52,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:52,413 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1190 transitions. [2019-09-20 13:26:52,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:26:52,414 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:52,415 INFO L407 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-09-20 13:26:52,415 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:52,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:52,415 INFO L82 PathProgramCache]: Analyzing trace with hash 330042225, now seen corresponding path program 1 times [2019-09-20 13:26:52,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:52,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:52,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:52,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:52,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:52,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:52,438 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:52,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:52,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:52,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:52,439 INFO L87 Difference]: Start difference. First operand 696 states and 1190 transitions. Second operand 3 states. [2019-09-20 13:26:52,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:52,458 INFO L93 Difference]: Finished difference Result 1290 states and 2231 transitions. [2019-09-20 13:26:52,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:52,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-20 13:26:52,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:52,465 INFO L225 Difference]: With dead ends: 1290 [2019-09-20 13:26:52,466 INFO L226 Difference]: Without dead ends: 1290 [2019-09-20 13:26:52,466 INFO L636 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-09-20 13:26:52,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2019-09-20 13:26:52,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 968. [2019-09-20 13:26:52,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-09-20 13:26:52,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1622 transitions. [2019-09-20 13:26:52,490 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1622 transitions. Word has length 28 [2019-09-20 13:26:52,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:52,491 INFO L475 AbstractCegarLoop]: Abstraction has 968 states and 1622 transitions. [2019-09-20 13:26:52,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:52,491 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1622 transitions. [2019-09-20 13:26:52,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:26:52,493 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:52,493 INFO L407 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-09-20 13:26:52,493 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:52,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:52,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1258305677, now seen corresponding path program 1 times [2019-09-20 13:26:52,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:52,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:52,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:52,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:52,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:52,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:52,513 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:52,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:52,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:52,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:52,514 INFO L87 Difference]: Start difference. First operand 968 states and 1622 transitions. Second operand 3 states. [2019-09-20 13:26:52,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:52,536 INFO L93 Difference]: Finished difference Result 1354 states and 2263 transitions. [2019-09-20 13:26:52,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:52,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-20 13:26:52,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:52,543 INFO L225 Difference]: With dead ends: 1354 [2019-09-20 13:26:52,543 INFO L226 Difference]: Without dead ends: 1354 [2019-09-20 13:26:52,544 INFO L636 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-09-20 13:26:52,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-09-20 13:26:52,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2019-09-20 13:26:52,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-09-20 13:26:52,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2262 transitions. [2019-09-20 13:26:52,572 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2262 transitions. Word has length 28 [2019-09-20 13:26:52,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:52,572 INFO L475 AbstractCegarLoop]: Abstraction has 1352 states and 2262 transitions. [2019-09-20 13:26:52,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:52,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2262 transitions. [2019-09-20 13:26:52,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:26:52,575 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:52,575 INFO L407 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-09-20 13:26:52,575 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:52,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:52,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1641587831, now seen corresponding path program 1 times [2019-09-20 13:26:52,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:52,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:52,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:52,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:52,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:52,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:52,597 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:52,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:52,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:52,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:52,598 INFO L87 Difference]: Start difference. First operand 1352 states and 2262 transitions. Second operand 3 states. [2019-09-20 13:26:52,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:52,619 INFO L93 Difference]: Finished difference Result 1370 states and 2263 transitions. [2019-09-20 13:26:52,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:52,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-20 13:26:52,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:52,626 INFO L225 Difference]: With dead ends: 1370 [2019-09-20 13:26:52,627 INFO L226 Difference]: Without dead ends: 1370 [2019-09-20 13:26:52,627 INFO L636 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-09-20 13:26:52,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2019-09-20 13:26:52,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1368. [2019-09-20 13:26:52,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2019-09-20 13:26:52,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2262 transitions. [2019-09-20 13:26:52,661 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2262 transitions. Word has length 29 [2019-09-20 13:26:52,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:52,661 INFO L475 AbstractCegarLoop]: Abstraction has 1368 states and 2262 transitions. [2019-09-20 13:26:52,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:52,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2262 transitions. [2019-09-20 13:26:52,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:26:52,663 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:52,663 INFO L407 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-09-20 13:26:52,664 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:52,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:52,664 INFO L82 PathProgramCache]: Analyzing trace with hash -352556875, now seen corresponding path program 1 times [2019-09-20 13:26:52,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:52,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:52,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:52,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:52,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:52,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:52,701 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:52,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:52,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:52,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:52,702 INFO L87 Difference]: Start difference. First operand 1368 states and 2262 transitions. Second operand 3 states. [2019-09-20 13:26:52,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:52,730 INFO L93 Difference]: Finished difference Result 2506 states and 4199 transitions. [2019-09-20 13:26:52,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:52,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-20 13:26:52,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:52,743 INFO L225 Difference]: With dead ends: 2506 [2019-09-20 13:26:52,743 INFO L226 Difference]: Without dead ends: 2506 [2019-09-20 13:26:52,743 INFO L636 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-09-20 13:26:52,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2019-09-20 13:26:52,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 1928. [2019-09-20 13:26:52,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2019-09-20 13:26:52,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 3110 transitions. [2019-09-20 13:26:52,791 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 3110 transitions. Word has length 29 [2019-09-20 13:26:52,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:52,791 INFO L475 AbstractCegarLoop]: Abstraction has 1928 states and 3110 transitions. [2019-09-20 13:26:52,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:52,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 3110 transitions. [2019-09-20 13:26:52,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:26:52,795 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:52,795 INFO L407 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-09-20 13:26:52,795 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:52,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:52,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1940904777, now seen corresponding path program 1 times [2019-09-20 13:26:52,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:52,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:52,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:52,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:52,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:52,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:52,816 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:52,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:52,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:52,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:52,817 INFO L87 Difference]: Start difference. First operand 1928 states and 3110 transitions. Second operand 3 states. [2019-09-20 13:26:52,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:52,849 INFO L93 Difference]: Finished difference Result 2666 states and 4295 transitions. [2019-09-20 13:26:52,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:52,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-20 13:26:52,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:52,868 INFO L225 Difference]: With dead ends: 2666 [2019-09-20 13:26:52,868 INFO L226 Difference]: Without dead ends: 2666 [2019-09-20 13:26:52,869 INFO L636 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-09-20 13:26:52,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2019-09-20 13:26:52,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2664. [2019-09-20 13:26:52,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2664 states. [2019-09-20 13:26:52,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 4294 transitions. [2019-09-20 13:26:52,951 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 4294 transitions. Word has length 29 [2019-09-20 13:26:52,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:52,951 INFO L475 AbstractCegarLoop]: Abstraction has 2664 states and 4294 transitions. [2019-09-20 13:26:52,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:52,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 4294 transitions. [2019-09-20 13:26:52,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:26:52,957 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:52,957 INFO L407 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-09-20 13:26:52,957 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:52,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:52,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1955852552, now seen corresponding path program 1 times [2019-09-20 13:26:52,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:52,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:52,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:53,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:53,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:53,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:53,009 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:53,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:53,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:53,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:53,010 INFO L87 Difference]: Start difference. First operand 2664 states and 4294 transitions. Second operand 3 states. [2019-09-20 13:26:53,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:53,051 INFO L93 Difference]: Finished difference Result 2698 states and 4295 transitions. [2019-09-20 13:26:53,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:53,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-20 13:26:53,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:53,070 INFO L225 Difference]: With dead ends: 2698 [2019-09-20 13:26:53,070 INFO L226 Difference]: Without dead ends: 2698 [2019-09-20 13:26:53,071 INFO L636 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-09-20 13:26:53,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2019-09-20 13:26:53,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2696. [2019-09-20 13:26:53,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2696 states. [2019-09-20 13:26:53,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 4294 transitions. [2019-09-20 13:26:53,162 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 4294 transitions. Word has length 30 [2019-09-20 13:26:53,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:53,163 INFO L475 AbstractCegarLoop]: Abstraction has 2696 states and 4294 transitions. [2019-09-20 13:26:53,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:53,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 4294 transitions. [2019-09-20 13:26:53,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:26:53,168 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:53,168 INFO L407 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-09-20 13:26:53,168 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:53,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:53,169 INFO L82 PathProgramCache]: Analyzing trace with hash -38292154, now seen corresponding path program 1 times [2019-09-20 13:26:53,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:53,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:53,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:53,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:53,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:53,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:53,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:53,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:53,195 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:53,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:53,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:53,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:53,196 INFO L87 Difference]: Start difference. First operand 2696 states and 4294 transitions. Second operand 3 states. [2019-09-20 13:26:53,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:53,249 INFO L93 Difference]: Finished difference Result 4874 states and 7879 transitions. [2019-09-20 13:26:53,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:53,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-20 13:26:53,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:53,278 INFO L225 Difference]: With dead ends: 4874 [2019-09-20 13:26:53,279 INFO L226 Difference]: Without dead ends: 4874 [2019-09-20 13:26:53,280 INFO L636 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-09-20 13:26:53,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2019-09-20 13:26:53,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 3848. [2019-09-20 13:26:53,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3848 states. [2019-09-20 13:26:53,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3848 states to 3848 states and 5958 transitions. [2019-09-20 13:26:53,387 INFO L78 Accepts]: Start accepts. Automaton has 3848 states and 5958 transitions. Word has length 30 [2019-09-20 13:26:53,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:53,388 INFO L475 AbstractCegarLoop]: Abstraction has 3848 states and 5958 transitions. [2019-09-20 13:26:53,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:53,388 INFO L276 IsEmpty]: Start isEmpty. Operand 3848 states and 5958 transitions. [2019-09-20 13:26:53,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:26:53,396 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:53,396 INFO L407 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-09-20 13:26:53,396 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:53,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:53,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1626640056, now seen corresponding path program 1 times [2019-09-20 13:26:53,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:53,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:53,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:53,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:53,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:53,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:53,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:53,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:53,424 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:53,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:53,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:53,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:53,425 INFO L87 Difference]: Start difference. First operand 3848 states and 5958 transitions. Second operand 3 states. [2019-09-20 13:26:53,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:53,468 INFO L93 Difference]: Finished difference Result 5258 states and 8135 transitions. [2019-09-20 13:26:53,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:53,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-20 13:26:53,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:53,506 INFO L225 Difference]: With dead ends: 5258 [2019-09-20 13:26:53,506 INFO L226 Difference]: Without dead ends: 5258 [2019-09-20 13:26:53,507 INFO L636 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-09-20 13:26:53,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2019-09-20 13:26:53,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 5256. [2019-09-20 13:26:53,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5256 states. [2019-09-20 13:26:53,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5256 states to 5256 states and 8134 transitions. [2019-09-20 13:26:53,659 INFO L78 Accepts]: Start accepts. Automaton has 5256 states and 8134 transitions. Word has length 30 [2019-09-20 13:26:53,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:53,659 INFO L475 AbstractCegarLoop]: Abstraction has 5256 states and 8134 transitions. [2019-09-20 13:26:53,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:53,659 INFO L276 IsEmpty]: Start isEmpty. Operand 5256 states and 8134 transitions. [2019-09-20 13:26:53,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 13:26:53,668 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:53,669 INFO L407 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-09-20 13:26:53,669 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:53,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:53,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1186842644, now seen corresponding path program 1 times [2019-09-20 13:26:53,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:53,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:53,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:53,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:53,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:53,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:53,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:53,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:53,699 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:53,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:53,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:53,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:53,700 INFO L87 Difference]: Start difference. First operand 5256 states and 8134 transitions. Second operand 3 states. [2019-09-20 13:26:53,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:53,747 INFO L93 Difference]: Finished difference Result 5322 states and 8135 transitions. [2019-09-20 13:26:53,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:53,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-20 13:26:53,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:53,762 INFO L225 Difference]: With dead ends: 5322 [2019-09-20 13:26:53,762 INFO L226 Difference]: Without dead ends: 5322 [2019-09-20 13:26:53,763 INFO L636 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-09-20 13:26:53,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2019-09-20 13:26:53,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 5320. [2019-09-20 13:26:53,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5320 states. [2019-09-20 13:26:53,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5320 states to 5320 states and 8134 transitions. [2019-09-20 13:26:53,871 INFO L78 Accepts]: Start accepts. Automaton has 5320 states and 8134 transitions. Word has length 31 [2019-09-20 13:26:53,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:53,872 INFO L475 AbstractCegarLoop]: Abstraction has 5320 states and 8134 transitions. [2019-09-20 13:26:53,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:53,872 INFO L276 IsEmpty]: Start isEmpty. Operand 5320 states and 8134 transitions. [2019-09-20 13:26:53,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 13:26:53,878 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:53,878 INFO L407 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-09-20 13:26:53,879 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:53,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:53,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1113979946, now seen corresponding path program 1 times [2019-09-20 13:26:53,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:53,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:53,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:53,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:53,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:53,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:53,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:53,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:53,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:53,909 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:53,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:53,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:53,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:53,910 INFO L87 Difference]: Start difference. First operand 5320 states and 8134 transitions. Second operand 3 states. [2019-09-20 13:26:53,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:53,960 INFO L93 Difference]: Finished difference Result 10378 states and 15495 transitions. [2019-09-20 13:26:53,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:53,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-20 13:26:53,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:53,984 INFO L225 Difference]: With dead ends: 10378 [2019-09-20 13:26:53,985 INFO L226 Difference]: Without dead ends: 10378 [2019-09-20 13:26:53,985 INFO L636 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-09-20 13:26:53,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10378 states. [2019-09-20 13:26:54,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10378 to 10376. [2019-09-20 13:26:54,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2019-09-20 13:26:54,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15494 transitions. [2019-09-20 13:26:54,221 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15494 transitions. Word has length 31 [2019-09-20 13:26:54,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:54,221 INFO L475 AbstractCegarLoop]: Abstraction has 10376 states and 15494 transitions. [2019-09-20 13:26:54,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:54,222 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15494 transitions. [2019-09-20 13:26:54,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 13:26:54,233 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:54,233 INFO L407 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-09-20 13:26:54,233 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:54,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:54,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1592639448, now seen corresponding path program 1 times [2019-09-20 13:26:54,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:54,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:54,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:54,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:54,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:54,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:54,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:54,259 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:54,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:54,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:54,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:54,260 INFO L87 Difference]: Start difference. First operand 10376 states and 15494 transitions. Second operand 3 states. [2019-09-20 13:26:54,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:54,306 INFO L93 Difference]: Finished difference Result 12170 states and 18695 transitions. [2019-09-20 13:26:54,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:54,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-20 13:26:54,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:54,332 INFO L225 Difference]: With dead ends: 12170 [2019-09-20 13:26:54,332 INFO L226 Difference]: Without dead ends: 12170 [2019-09-20 13:26:54,333 INFO L636 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-09-20 13:26:54,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2019-09-20 13:26:54,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 10376. [2019-09-20 13:26:54,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2019-09-20 13:26:54,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15366 transitions. [2019-09-20 13:26:54,527 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15366 transitions. Word has length 31 [2019-09-20 13:26:54,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:54,528 INFO L475 AbstractCegarLoop]: Abstraction has 10376 states and 15366 transitions. [2019-09-20 13:26:54,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:54,528 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15366 transitions. [2019-09-20 13:26:54,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 13:26:54,540 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:54,540 INFO L407 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-09-20 13:26:54,540 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:54,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:54,541 INFO L82 PathProgramCache]: Analyzing trace with hash 173854429, now seen corresponding path program 1 times [2019-09-20 13:26:54,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:54,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:54,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:54,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:54,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:54,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:54,562 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:54,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:54,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:54,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:54,563 INFO L87 Difference]: Start difference. First operand 10376 states and 15366 transitions. Second operand 3 states. [2019-09-20 13:26:54,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:54,624 INFO L93 Difference]: Finished difference Result 18314 states and 27527 transitions. [2019-09-20 13:26:54,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:54,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-20 13:26:54,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:54,666 INFO L225 Difference]: With dead ends: 18314 [2019-09-20 13:26:54,666 INFO L226 Difference]: Without dead ends: 18314 [2019-09-20 13:26:54,671 INFO L636 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-09-20 13:26:54,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18314 states. [2019-09-20 13:26:54,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18314 to 15240. [2019-09-20 13:26:54,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15240 states. [2019-09-20 13:26:55,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15240 states to 15240 states and 21894 transitions. [2019-09-20 13:26:55,481 INFO L78 Accepts]: Start accepts. Automaton has 15240 states and 21894 transitions. Word has length 32 [2019-09-20 13:26:55,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:55,481 INFO L475 AbstractCegarLoop]: Abstraction has 15240 states and 21894 transitions. [2019-09-20 13:26:55,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:55,482 INFO L276 IsEmpty]: Start isEmpty. Operand 15240 states and 21894 transitions. [2019-09-20 13:26:55,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 13:26:55,508 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:55,508 INFO L407 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-09-20 13:26:55,508 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:55,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:55,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1414493473, now seen corresponding path program 1 times [2019-09-20 13:26:55,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:55,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:55,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:55,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:55,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:55,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:55,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:55,542 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:55,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:55,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:55,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,543 INFO L87 Difference]: Start difference. First operand 15240 states and 21894 transitions. Second operand 3 states. [2019-09-20 13:26:55,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:55,616 INFO L93 Difference]: Finished difference Result 20362 states and 29191 transitions. [2019-09-20 13:26:55,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:55,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-20 13:26:55,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:55,665 INFO L225 Difference]: With dead ends: 20362 [2019-09-20 13:26:55,665 INFO L226 Difference]: Without dead ends: 20362 [2019-09-20 13:26:55,665 INFO L636 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-09-20 13:26:55,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20362 states. [2019-09-20 13:26:55,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20362 to 20360. [2019-09-20 13:26:55,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20360 states. [2019-09-20 13:26:55,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20360 states to 20360 states and 29190 transitions. [2019-09-20 13:26:55,939 INFO L78 Accepts]: Start accepts. Automaton has 20360 states and 29190 transitions. Word has length 32 [2019-09-20 13:26:55,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:55,939 INFO L475 AbstractCegarLoop]: Abstraction has 20360 states and 29190 transitions. [2019-09-20 13:26:55,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:55,940 INFO L276 IsEmpty]: Start isEmpty. Operand 20360 states and 29190 transitions. [2019-09-20 13:26:55,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-20 13:26:55,963 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:55,963 INFO L407 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-09-20 13:26:55,963 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:55,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:55,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1094734815, now seen corresponding path program 1 times [2019-09-20 13:26:55,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:55,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:55,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:55,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:55,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:55,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:55,989 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:55,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:55,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:55,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,990 INFO L87 Difference]: Start difference. First operand 20360 states and 29190 transitions. Second operand 3 states. [2019-09-20 13:26:56,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:56,055 INFO L93 Difference]: Finished difference Result 20746 states and 29447 transitions. [2019-09-20 13:26:56,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:56,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-20 13:26:56,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:56,092 INFO L225 Difference]: With dead ends: 20746 [2019-09-20 13:26:56,092 INFO L226 Difference]: Without dead ends: 20746 [2019-09-20 13:26:56,092 INFO L636 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-09-20 13:26:56,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20746 states. [2019-09-20 13:26:56,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20746 to 20744. [2019-09-20 13:26:56,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20744 states. [2019-09-20 13:26:56,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20744 states to 20744 states and 29446 transitions. [2019-09-20 13:26:56,414 INFO L78 Accepts]: Start accepts. Automaton has 20744 states and 29446 transitions. Word has length 33 [2019-09-20 13:26:56,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:56,414 INFO L475 AbstractCegarLoop]: Abstraction has 20744 states and 29446 transitions. [2019-09-20 13:26:56,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:56,414 INFO L276 IsEmpty]: Start isEmpty. Operand 20744 states and 29446 transitions. [2019-09-20 13:26:56,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-20 13:26:56,440 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:56,440 INFO L407 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-09-20 13:26:56,440 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:56,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:56,441 INFO L82 PathProgramCache]: Analyzing trace with hash -899409891, now seen corresponding path program 1 times [2019-09-20 13:26:56,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:56,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:56,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:56,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:56,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:56,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:56,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:56,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:56,465 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:56,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:56,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:56,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:56,466 INFO L87 Difference]: Start difference. First operand 20744 states and 29446 transitions. Second operand 3 states. [2019-09-20 13:26:56,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:56,553 INFO L93 Difference]: Finished difference Result 35850 states and 51463 transitions. [2019-09-20 13:26:56,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:56,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-20 13:26:56,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:56,622 INFO L225 Difference]: With dead ends: 35850 [2019-09-20 13:26:56,622 INFO L226 Difference]: Without dead ends: 35850 [2019-09-20 13:26:56,623 INFO L636 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-09-20 13:26:56,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35850 states. [2019-09-20 13:26:57,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35850 to 30728. [2019-09-20 13:26:57,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30728 states. [2019-09-20 13:26:57,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30728 states to 30728 states and 42246 transitions. [2019-09-20 13:26:57,176 INFO L78 Accepts]: Start accepts. Automaton has 30728 states and 42246 transitions. Word has length 33 [2019-09-20 13:26:57,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:57,177 INFO L475 AbstractCegarLoop]: Abstraction has 30728 states and 42246 transitions. [2019-09-20 13:26:57,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:57,177 INFO L276 IsEmpty]: Start isEmpty. Operand 30728 states and 42246 transitions. [2019-09-20 13:26:57,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-20 13:26:57,225 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:57,225 INFO L407 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-09-20 13:26:57,226 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:57,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:57,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1807209503, now seen corresponding path program 1 times [2019-09-20 13:26:57,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:57,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:57,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:57,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:57,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:57,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:57,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:57,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:57,252 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:57,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:57,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:57,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:57,253 INFO L87 Difference]: Start difference. First operand 30728 states and 42246 transitions. Second operand 3 states. [2019-09-20 13:26:57,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:57,363 INFO L93 Difference]: Finished difference Result 40458 states and 55303 transitions. [2019-09-20 13:26:57,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:57,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-20 13:26:57,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:57,437 INFO L225 Difference]: With dead ends: 40458 [2019-09-20 13:26:57,438 INFO L226 Difference]: Without dead ends: 40458 [2019-09-20 13:26:57,438 INFO L636 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-09-20 13:26:57,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40458 states. [2019-09-20 13:26:58,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40458 to 40456. [2019-09-20 13:26:58,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40456 states. [2019-09-20 13:26:58,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40456 states to 40456 states and 55302 transitions. [2019-09-20 13:26:58,809 INFO L78 Accepts]: Start accepts. Automaton has 40456 states and 55302 transitions. Word has length 33 [2019-09-20 13:26:58,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:58,809 INFO L475 AbstractCegarLoop]: Abstraction has 40456 states and 55302 transitions. [2019-09-20 13:26:58,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:58,810 INFO L276 IsEmpty]: Start isEmpty. Operand 40456 states and 55302 transitions. [2019-09-20 13:26:58,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-20 13:26:58,849 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:58,850 INFO L407 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-09-20 13:26:58,850 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:58,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:58,850 INFO L82 PathProgramCache]: Analyzing trace with hash -2111687692, now seen corresponding path program 1 times [2019-09-20 13:26:58,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:58,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:58,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:58,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:58,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:58,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:58,873 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:58,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:58,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:58,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:58,874 INFO L87 Difference]: Start difference. First operand 40456 states and 55302 transitions. Second operand 3 states. [2019-09-20 13:26:58,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:58,972 INFO L93 Difference]: Finished difference Result 40970 states and 55303 transitions. [2019-09-20 13:26:58,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:58,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-20 13:26:58,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:59,016 INFO L225 Difference]: With dead ends: 40970 [2019-09-20 13:26:59,016 INFO L226 Difference]: Without dead ends: 40970 [2019-09-20 13:26:59,017 INFO L636 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-09-20 13:26:59,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40970 states. [2019-09-20 13:26:59,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40970 to 40968. [2019-09-20 13:26:59,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40968 states. [2019-09-20 13:26:59,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40968 states to 40968 states and 55302 transitions. [2019-09-20 13:26:59,502 INFO L78 Accepts]: Start accepts. Automaton has 40968 states and 55302 transitions. Word has length 34 [2019-09-20 13:26:59,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:59,502 INFO L475 AbstractCegarLoop]: Abstraction has 40968 states and 55302 transitions. [2019-09-20 13:26:59,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:59,503 INFO L276 IsEmpty]: Start isEmpty. Operand 40968 states and 55302 transitions. [2019-09-20 13:26:59,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-20 13:26:59,539 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:59,539 INFO L407 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-09-20 13:26:59,539 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:59,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:59,540 INFO L82 PathProgramCache]: Analyzing trace with hash 189134898, now seen corresponding path program 1 times [2019-09-20 13:26:59,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:59,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:59,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:59,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:59,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:59,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:59,563 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:59,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:59,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:59,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:59,564 INFO L87 Difference]: Start difference. First operand 40968 states and 55302 transitions. Second operand 3 states. [2019-09-20 13:26:59,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:59,916 INFO L93 Difference]: Finished difference Result 69642 states and 94727 transitions. [2019-09-20 13:26:59,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:59,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-20 13:26:59,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:59,998 INFO L225 Difference]: With dead ends: 69642 [2019-09-20 13:26:59,998 INFO L226 Difference]: Without dead ends: 69642 [2019-09-20 13:27:00,000 INFO L636 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-09-20 13:27:00,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69642 states. [2019-09-20 13:27:01,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69642 to 61448. [2019-09-20 13:27:01,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61448 states. [2019-09-20 13:27:01,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61448 states to 61448 states and 80390 transitions. [2019-09-20 13:27:01,976 INFO L78 Accepts]: Start accepts. Automaton has 61448 states and 80390 transitions. Word has length 34 [2019-09-20 13:27:01,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:01,976 INFO L475 AbstractCegarLoop]: Abstraction has 61448 states and 80390 transitions. [2019-09-20 13:27:01,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:01,977 INFO L276 IsEmpty]: Start isEmpty. Operand 61448 states and 80390 transitions. [2019-09-20 13:27:02,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-20 13:27:02,027 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:02,027 INFO L407 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-09-20 13:27:02,028 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:02,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:02,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1399213004, now seen corresponding path program 1 times [2019-09-20 13:27:02,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:02,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:02,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:02,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:02,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:02,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:02,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:02,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:02,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:02,062 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:02,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:02,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:02,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:02,063 INFO L87 Difference]: Start difference. First operand 61448 states and 80390 transitions. Second operand 3 states. [2019-09-20 13:27:02,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:02,244 INFO L93 Difference]: Finished difference Result 79882 states and 103431 transitions. [2019-09-20 13:27:02,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:02,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-20 13:27:02,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:02,326 INFO L225 Difference]: With dead ends: 79882 [2019-09-20 13:27:02,326 INFO L226 Difference]: Without dead ends: 79882 [2019-09-20 13:27:02,327 INFO L636 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-09-20 13:27:02,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79882 states. [2019-09-20 13:27:03,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79882 to 79880. [2019-09-20 13:27:03,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79880 states. [2019-09-20 13:27:03,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79880 states to 79880 states and 103430 transitions. [2019-09-20 13:27:03,349 INFO L78 Accepts]: Start accepts. Automaton has 79880 states and 103430 transitions. Word has length 34 [2019-09-20 13:27:03,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:03,350 INFO L475 AbstractCegarLoop]: Abstraction has 79880 states and 103430 transitions. [2019-09-20 13:27:03,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:03,350 INFO L276 IsEmpty]: Start isEmpty. Operand 79880 states and 103430 transitions. [2019-09-20 13:27:03,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-20 13:27:03,391 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:03,391 INFO L407 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-09-20 13:27:03,391 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:03,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:03,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1568430036, now seen corresponding path program 1 times [2019-09-20 13:27:03,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:03,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:03,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:03,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:03,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:03,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:03,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:03,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:03,414 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:03,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:03,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:03,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:03,416 INFO L87 Difference]: Start difference. First operand 79880 states and 103430 transitions. Second operand 3 states. [2019-09-20 13:27:03,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:03,612 INFO L93 Difference]: Finished difference Result 80906 states and 103431 transitions. [2019-09-20 13:27:03,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:03,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-09-20 13:27:03,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:03,690 INFO L225 Difference]: With dead ends: 80906 [2019-09-20 13:27:03,690 INFO L226 Difference]: Without dead ends: 80906 [2019-09-20 13:27:03,692 INFO L636 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-09-20 13:27:03,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80906 states. [2019-09-20 13:27:04,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80906 to 80904. [2019-09-20 13:27:04,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80904 states. [2019-09-20 13:27:04,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80904 states to 80904 states and 103430 transitions. [2019-09-20 13:27:04,625 INFO L78 Accepts]: Start accepts. Automaton has 80904 states and 103430 transitions. Word has length 35 [2019-09-20 13:27:04,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:04,625 INFO L475 AbstractCegarLoop]: Abstraction has 80904 states and 103430 transitions. [2019-09-20 13:27:04,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:04,625 INFO L276 IsEmpty]: Start isEmpty. Operand 80904 states and 103430 transitions. [2019-09-20 13:27:04,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-20 13:27:04,649 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:04,649 INFO L407 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-09-20 13:27:04,649 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:04,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:04,650 INFO L82 PathProgramCache]: Analyzing trace with hash -425714670, now seen corresponding path program 1 times [2019-09-20 13:27:04,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:04,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:04,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:04,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:04,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:04,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:04,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:04,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:04,668 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:04,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:04,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:04,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:04,669 INFO L87 Difference]: Start difference. First operand 80904 states and 103430 transitions. Second operand 3 states. [2019-09-20 13:27:04,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:04,946 INFO L93 Difference]: Finished difference Result 135178 states and 173063 transitions. [2019-09-20 13:27:04,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:04,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-09-20 13:27:04,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:05,102 INFO L225 Difference]: With dead ends: 135178 [2019-09-20 13:27:05,102 INFO L226 Difference]: Without dead ends: 135178 [2019-09-20 13:27:05,104 INFO L636 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-09-20 13:27:05,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135178 states. [2019-09-20 13:27:07,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135178 to 122888. [2019-09-20 13:27:07,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122888 states. [2019-09-20 13:27:07,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122888 states to 122888 states and 152582 transitions. [2019-09-20 13:27:07,790 INFO L78 Accepts]: Start accepts. Automaton has 122888 states and 152582 transitions. Word has length 35 [2019-09-20 13:27:07,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:07,791 INFO L475 AbstractCegarLoop]: Abstraction has 122888 states and 152582 transitions. [2019-09-20 13:27:07,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:07,791 INFO L276 IsEmpty]: Start isEmpty. Operand 122888 states and 152582 transitions. [2019-09-20 13:27:07,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-20 13:27:07,850 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:07,850 INFO L407 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-09-20 13:27:07,850 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:07,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:07,851 INFO L82 PathProgramCache]: Analyzing trace with hash -2014062572, now seen corresponding path program 1 times [2019-09-20 13:27:07,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:07,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:07,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:07,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:07,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:07,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-09-20 13:27:07,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:07,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:07,876 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:07,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:07,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:07,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:07,877 INFO L87 Difference]: Start difference. First operand 122888 states and 152582 transitions. Second operand 3 states. [2019-09-20 13:27:08,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:08,176 INFO L93 Difference]: Finished difference Result 157706 states and 192519 transitions. [2019-09-20 13:27:08,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:08,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-09-20 13:27:08,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:08,306 INFO L225 Difference]: With dead ends: 157706 [2019-09-20 13:27:08,306 INFO L226 Difference]: Without dead ends: 157706 [2019-09-20 13:27:08,306 INFO L636 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-09-20 13:27:08,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157706 states. [2019-09-20 13:27:12,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157706 to 157704. [2019-09-20 13:27:12,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157704 states. [2019-09-20 13:27:12,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157704 states to 157704 states and 192518 transitions. [2019-09-20 13:27:12,702 INFO L78 Accepts]: Start accepts. Automaton has 157704 states and 192518 transitions. Word has length 35 [2019-09-20 13:27:12,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:12,703 INFO L475 AbstractCegarLoop]: Abstraction has 157704 states and 192518 transitions. [2019-09-20 13:27:12,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:12,703 INFO L276 IsEmpty]: Start isEmpty. Operand 157704 states and 192518 transitions. [2019-09-20 13:27:12,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-20 13:27:12,755 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:12,755 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:12,755 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:12,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:12,756 INFO L82 PathProgramCache]: Analyzing trace with hash -312037047, now seen corresponding path program 1 times [2019-09-20 13:27:12,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:12,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:12,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:12,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:12,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:12,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:12,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:12,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:12,773 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:12,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:12,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:12,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:12,774 INFO L87 Difference]: Start difference. First operand 157704 states and 192518 transitions. Second operand 3 states. [2019-09-20 13:27:13,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:13,110 INFO L93 Difference]: Finished difference Result 159754 states and 192519 transitions. [2019-09-20 13:27:13,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:13,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-09-20 13:27:13,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:13,235 INFO L225 Difference]: With dead ends: 159754 [2019-09-20 13:27:13,235 INFO L226 Difference]: Without dead ends: 159754 [2019-09-20 13:27:13,236 INFO L636 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-09-20 13:27:13,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159754 states. [2019-09-20 13:27:14,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159754 to 159752. [2019-09-20 13:27:14,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159752 states. [2019-09-20 13:27:14,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159752 states to 159752 states and 192518 transitions. [2019-09-20 13:27:14,837 INFO L78 Accepts]: Start accepts. Automaton has 159752 states and 192518 transitions. Word has length 36 [2019-09-20 13:27:14,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:14,837 INFO L475 AbstractCegarLoop]: Abstraction has 159752 states and 192518 transitions. [2019-09-20 13:27:14,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:14,837 INFO L276 IsEmpty]: Start isEmpty. Operand 159752 states and 192518 transitions. [2019-09-20 13:27:14,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-20 13:27:14,897 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:14,897 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:14,897 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:14,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:14,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1988785543, now seen corresponding path program 1 times [2019-09-20 13:27:14,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:14,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:14,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:14,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:14,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:14,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:14,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:14,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:14,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:14,914 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:14,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:14,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:14,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:14,915 INFO L87 Difference]: Start difference. First operand 159752 states and 192518 transitions. Second operand 3 states. [2019-09-20 13:27:15,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:15,334 INFO L93 Difference]: Finished difference Result 262154 states and 313351 transitions. [2019-09-20 13:27:15,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:15,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-09-20 13:27:15,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:15,592 INFO L225 Difference]: With dead ends: 262154 [2019-09-20 13:27:15,592 INFO L226 Difference]: Without dead ends: 262154 [2019-09-20 13:27:15,592 INFO L636 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-09-20 13:27:15,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262154 states. [2019-09-20 13:27:20,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262154 to 245768. [2019-09-20 13:27:20,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245768 states. [2019-09-20 13:27:20,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245768 states to 245768 states and 288774 transitions. [2019-09-20 13:27:20,299 INFO L78 Accepts]: Start accepts. Automaton has 245768 states and 288774 transitions. Word has length 36 [2019-09-20 13:27:20,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:20,299 INFO L475 AbstractCegarLoop]: Abstraction has 245768 states and 288774 transitions. [2019-09-20 13:27:20,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:20,299 INFO L276 IsEmpty]: Start isEmpty. Operand 245768 states and 288774 transitions. [2019-09-20 13:27:20,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-20 13:27:20,416 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:20,416 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:20,417 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:20,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:20,417 INFO L82 PathProgramCache]: Analyzing trace with hash 400437641, now seen corresponding path program 1 times [2019-09-20 13:27:20,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:20,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:20,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:20,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:20,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:20,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:20,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:20,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:20,435 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:20,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:20,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:20,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:20,436 INFO L87 Difference]: Start difference. First operand 245768 states and 288774 transitions. Second operand 3 states. [2019-09-20 13:27:21,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:21,013 INFO L93 Difference]: Finished difference Result 311306 states and 356359 transitions. [2019-09-20 13:27:21,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:21,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-09-20 13:27:21,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:21,305 INFO L225 Difference]: With dead ends: 311306 [2019-09-20 13:27:21,305 INFO L226 Difference]: Without dead ends: 311306 [2019-09-20 13:27:21,305 INFO L636 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-09-20 13:27:21,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311306 states.