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/seq-mthreaded/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:58:52,214 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:58:52,216 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:58:52,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:58:52,228 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:58:52,229 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:58:52,230 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:58:52,232 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:58:52,234 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:58:52,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:58:52,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:58:52,236 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:58:52,237 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:58:52,238 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:58:52,238 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:58:52,239 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:58:52,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:58:52,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:58:52,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:58:52,244 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:58:52,246 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:58:52,247 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:58:52,248 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:58:52,248 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:58:52,250 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:58:52,250 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:58:52,251 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:58:52,251 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:58:52,252 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:58:52,253 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:58:52,253 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:58:52,254 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:58:52,254 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:58:52,255 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:58:52,256 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:58:52,256 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:58:52,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:58:52,257 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:58:52,257 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:58:52,258 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:58:52,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:58:52,259 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-10 04:58:52,273 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:58:52,274 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:58:52,274 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:58:52,274 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:58:52,275 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:58:52,275 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:58:52,275 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:58:52,275 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:58:52,276 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:58:52,276 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:58:52,276 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:58:52,277 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:58:52,277 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:58:52,277 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:58:52,277 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:58:52,277 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:58:52,278 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:58:52,278 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:58:52,278 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:58:52,278 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:58:52,278 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:58:52,278 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:58:52,279 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:58:52,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:58:52,279 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:58:52,279 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:58:52,279 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:58:52,280 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:58:52,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:58:52,280 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:58:52,307 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:58:52,320 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:58:52,323 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:58:52,325 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:58:52,325 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:58:52,326 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c [2019-09-10 04:58:52,384 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db1686788/a033acee67c64c0aaebb7f8d3f9bc542/FLAG17f3cd522 [2019-09-10 04:58:52,881 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:58:52,887 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c [2019-09-10 04:58:52,909 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db1686788/a033acee67c64c0aaebb7f8d3f9bc542/FLAG17f3cd522 [2019-09-10 04:58:53,216 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db1686788/a033acee67c64c0aaebb7f8d3f9bc542 [2019-09-10 04:58:53,228 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:58:53,230 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:58:53,231 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:58:53,231 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:58:53,234 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:58:53,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:58:53" (1/1) ... [2019-09-10 04:58:53,238 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74340391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:53, skipping insertion in model container [2019-09-10 04:58:53,238 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:58:53" (1/1) ... [2019-09-10 04:58:53,246 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:58:53,316 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:58:53,785 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:58:53,796 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:58:53,911 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:58:53,933 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:58:53,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:53 WrapperNode [2019-09-10 04:58:53,934 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:58:53,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:58:53,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:58:53,935 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:58:53,947 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:53" (1/1) ... [2019-09-10 04:58:53,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:53" (1/1) ... [2019-09-10 04:58:53,967 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:53" (1/1) ... [2019-09-10 04:58:53,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:53" (1/1) ... [2019-09-10 04:58:54,021 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:53" (1/1) ... [2019-09-10 04:58:54,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:53" (1/1) ... [2019-09-10 04:58:54,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:53" (1/1) ... [2019-09-10 04:58:54,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:58:54,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:58:54,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:58:54,083 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:58:54,084 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:53" (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-10 04:58:54,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:58:54,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:58:54,160 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:58:54,160 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:58:54,160 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:58:54,160 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:58:54,161 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:58:54,161 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:58:54,161 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:58:54,161 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:58:54,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:58:54,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:58:54,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 04:58:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:58:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:58:54,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:58:54,164 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:58:54,164 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:58:54,165 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:58:54,165 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:58:54,165 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:58:54,165 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:58:54,165 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:58:54,165 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:58:54,166 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:58:54,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:58:54,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:58:55,660 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:58:55,660 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:58:55,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:58:55 BoogieIcfgContainer [2019-09-10 04:58:55,662 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:58:55,663 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:58:55,663 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:58:55,666 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:58:55,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:58:53" (1/3) ... [2019-09-10 04:58:55,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d87a028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:58:55, skipping insertion in model container [2019-09-10 04:58:55,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:53" (2/3) ... [2019-09-10 04:58:55,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d87a028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:58:55, skipping insertion in model container [2019-09-10 04:58:55,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:58:55" (3/3) ... [2019-09-10 04:58:55,670 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c [2019-09-10 04:58:55,681 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:58:55,690 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:58:55,708 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:58:55,737 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:58:55,737 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:58:55,737 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:58:55,737 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:58:55,738 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:58:55,738 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:58:55,738 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:58:55,738 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:58:55,773 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states. [2019-09-10 04:58:55,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 04:58:55,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:58:55,809 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:58:55,811 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:58:55,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:58:55,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1968290658, now seen corresponding path program 1 times [2019-09-10 04:58:55,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:58:55,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:55,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:58:55,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:55,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:58:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:58:56,434 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-10 04:58:56,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:58:56,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:58:56,437 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:58:56,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:58:56,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:58:56,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:58:56,462 INFO L87 Difference]: Start difference. First operand 359 states. Second operand 5 states. [2019-09-10 04:58:56,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:58:56,637 INFO L93 Difference]: Finished difference Result 358 states and 616 transitions. [2019-09-10 04:58:56,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:58:56,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-10 04:58:56,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:58:56,679 INFO L225 Difference]: With dead ends: 358 [2019-09-10 04:58:56,679 INFO L226 Difference]: Without dead ends: 354 [2019-09-10 04:58:56,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:58:56,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-09-10 04:58:56,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2019-09-10 04:58:56,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-09-10 04:58:56,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 567 transitions. [2019-09-10 04:58:56,799 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 567 transitions. Word has length 102 [2019-09-10 04:58:56,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:58:56,800 INFO L475 AbstractCegarLoop]: Abstraction has 354 states and 567 transitions. [2019-09-10 04:58:56,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:58:56,800 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 567 transitions. [2019-09-10 04:58:56,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 04:58:56,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:58:56,807 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:58:56,807 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:58:56,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:58:56,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1586639344, now seen corresponding path program 1 times [2019-09-10 04:58:56,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:58:56,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:56,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:58:56,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:56,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:58:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:58:57,241 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-10 04:58:57,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:58:57,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:58:57,242 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:58:57,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:58:57,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:58:57,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:58:57,245 INFO L87 Difference]: Start difference. First operand 354 states and 567 transitions. Second operand 11 states. [2019-09-10 04:59:03,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:59:03,776 INFO L93 Difference]: Finished difference Result 1511 states and 2458 transitions. [2019-09-10 04:59:03,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 04:59:03,776 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 147 [2019-09-10 04:59:03,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:59:03,793 INFO L225 Difference]: With dead ends: 1511 [2019-09-10 04:59:03,794 INFO L226 Difference]: Without dead ends: 1511 [2019-09-10 04:59:03,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=416, Invalid=1390, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 04:59:03,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2019-09-10 04:59:03,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1284. [2019-09-10 04:59:03,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1284 states. [2019-09-10 04:59:03,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 2076 transitions. [2019-09-10 04:59:03,905 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 2076 transitions. Word has length 147 [2019-09-10 04:59:03,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:59:03,906 INFO L475 AbstractCegarLoop]: Abstraction has 1284 states and 2076 transitions. [2019-09-10 04:59:03,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:59:03,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 2076 transitions. [2019-09-10 04:59:03,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 04:59:03,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:59:03,917 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:59:03,918 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:59:03,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:59:03,919 INFO L82 PathProgramCache]: Analyzing trace with hash 615152904, now seen corresponding path program 1 times [2019-09-10 04:59:03,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:59:03,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:03,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:59:03,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:03,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:59:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:59:04,128 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-10 04:59:04,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:59:04,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:59:04,134 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:59:04,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:59:04,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:59:04,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:59:04,145 INFO L87 Difference]: Start difference. First operand 1284 states and 2076 transitions. Second operand 6 states. [2019-09-10 04:59:06,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:59:06,832 INFO L93 Difference]: Finished difference Result 3240 states and 5212 transitions. [2019-09-10 04:59:06,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:59:06,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2019-09-10 04:59:06,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:59:06,853 INFO L225 Difference]: With dead ends: 3240 [2019-09-10 04:59:06,853 INFO L226 Difference]: Without dead ends: 3240 [2019-09-10 04:59:06,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:59:06,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3240 states. [2019-09-10 04:59:06,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3240 to 3225. [2019-09-10 04:59:06,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3225 states. [2019-09-10 04:59:06,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3225 states to 3225 states and 5194 transitions. [2019-09-10 04:59:06,955 INFO L78 Accepts]: Start accepts. Automaton has 3225 states and 5194 transitions. Word has length 148 [2019-09-10 04:59:06,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:59:06,955 INFO L475 AbstractCegarLoop]: Abstraction has 3225 states and 5194 transitions. [2019-09-10 04:59:06,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:59:06,956 INFO L276 IsEmpty]: Start isEmpty. Operand 3225 states and 5194 transitions. [2019-09-10 04:59:06,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 04:59:06,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:59:06,959 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:59:06,959 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:59:06,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:59:06,960 INFO L82 PathProgramCache]: Analyzing trace with hash 512159399, now seen corresponding path program 1 times [2019-09-10 04:59:06,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:59:06,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:06,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:59:06,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:06,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:59:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:59:07,181 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-10 04:59:07,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:59:07,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:59:07,181 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:59:07,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:59:07,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:59:07,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:59:07,183 INFO L87 Difference]: Start difference. First operand 3225 states and 5194 transitions. Second operand 6 states. [2019-09-10 04:59:09,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:59:09,627 INFO L93 Difference]: Finished difference Result 8895 states and 14246 transitions. [2019-09-10 04:59:09,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:59:09,628 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2019-09-10 04:59:09,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:59:09,673 INFO L225 Difference]: With dead ends: 8895 [2019-09-10 04:59:09,674 INFO L226 Difference]: Without dead ends: 8895 [2019-09-10 04:59:09,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:59:09,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8895 states. [2019-09-10 04:59:09,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8895 to 8865. [2019-09-10 04:59:09,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8865 states. [2019-09-10 04:59:09,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8865 states to 8865 states and 14198 transitions. [2019-09-10 04:59:09,939 INFO L78 Accepts]: Start accepts. Automaton has 8865 states and 14198 transitions. Word has length 149 [2019-09-10 04:59:09,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:59:09,939 INFO L475 AbstractCegarLoop]: Abstraction has 8865 states and 14198 transitions. [2019-09-10 04:59:09,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:59:09,940 INFO L276 IsEmpty]: Start isEmpty. Operand 8865 states and 14198 transitions. [2019-09-10 04:59:09,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 04:59:09,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:59:09,944 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:59:09,944 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:59:09,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:59:09,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1562643103, now seen corresponding path program 1 times [2019-09-10 04:59:09,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:59:09,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:09,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:59:09,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:09,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:59:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:59:10,195 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-10 04:59:10,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:59:10,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:59:10,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:59:10,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:59:10,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:59:10,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:59:10,197 INFO L87 Difference]: Start difference. First operand 8865 states and 14198 transitions. Second operand 6 states. [2019-09-10 04:59:12,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:59:12,894 INFO L93 Difference]: Finished difference Result 30040 states and 47912 transitions. [2019-09-10 04:59:12,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:59:12,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-09-10 04:59:12,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:59:13,088 INFO L225 Difference]: With dead ends: 30040 [2019-09-10 04:59:13,088 INFO L226 Difference]: Without dead ends: 30040 [2019-09-10 04:59:13,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:59:13,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30040 states. [2019-09-10 04:59:14,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30040 to 29952. [2019-09-10 04:59:14,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29952 states. [2019-09-10 04:59:14,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29952 states to 29952 states and 47748 transitions. [2019-09-10 04:59:14,237 INFO L78 Accepts]: Start accepts. Automaton has 29952 states and 47748 transitions. Word has length 150 [2019-09-10 04:59:14,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:59:14,238 INFO L475 AbstractCegarLoop]: Abstraction has 29952 states and 47748 transitions. [2019-09-10 04:59:14,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:59:14,238 INFO L276 IsEmpty]: Start isEmpty. Operand 29952 states and 47748 transitions. [2019-09-10 04:59:14,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 04:59:14,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:59:14,247 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:59:14,247 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:59:14,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:59:14,248 INFO L82 PathProgramCache]: Analyzing trace with hash -283785378, now seen corresponding path program 1 times [2019-09-10 04:59:14,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:59:14,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:14,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:59:14,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:14,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:59:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:59:14,607 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-10 04:59:14,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:59:14,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:59:14,608 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:59:14,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:59:14,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:59:14,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:59:14,609 INFO L87 Difference]: Start difference. First operand 29952 states and 47748 transitions. Second operand 6 states. [2019-09-10 04:59:17,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:59:17,724 INFO L93 Difference]: Finished difference Result 128751 states and 205973 transitions. [2019-09-10 04:59:17,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:59:17,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 151 [2019-09-10 04:59:17,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:59:18,518 INFO L225 Difference]: With dead ends: 128751 [2019-09-10 04:59:18,518 INFO L226 Difference]: Without dead ends: 128751 [2019-09-10 04:59:18,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:59:18,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128751 states. [2019-09-10 04:59:20,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128751 to 102318. [2019-09-10 04:59:20,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102318 states. [2019-09-10 04:59:23,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102318 states to 102318 states and 163574 transitions. [2019-09-10 04:59:23,758 INFO L78 Accepts]: Start accepts. Automaton has 102318 states and 163574 transitions. Word has length 151 [2019-09-10 04:59:23,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:59:23,762 INFO L475 AbstractCegarLoop]: Abstraction has 102318 states and 163574 transitions. [2019-09-10 04:59:23,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:59:23,762 INFO L276 IsEmpty]: Start isEmpty. Operand 102318 states and 163574 transitions. [2019-09-10 04:59:23,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 04:59:23,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:59:23,769 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:59:23,770 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:59:23,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:59:23,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1215829162, now seen corresponding path program 1 times [2019-09-10 04:59:23,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:59:23,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:23,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:59:23,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:23,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:59:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:59:23,884 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-10 04:59:23,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:59:23,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 04:59:23,884 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:59:23,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 04:59:23,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 04:59:23,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:59:23,886 INFO L87 Difference]: Start difference. First operand 102318 states and 163574 transitions. Second operand 4 states. [2019-09-10 04:59:25,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:59:25,017 INFO L93 Difference]: Finished difference Result 270541 states and 430750 transitions. [2019-09-10 04:59:25,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 04:59:25,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-10 04:59:25,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:59:28,773 INFO L225 Difference]: With dead ends: 270541 [2019-09-10 04:59:28,774 INFO L226 Difference]: Without dead ends: 270541 [2019-09-10 04:59:28,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:59:29,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270541 states. [2019-09-10 04:59:33,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270541 to 268533. [2019-09-10 04:59:33,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268533 states. [2019-09-10 04:59:34,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268533 states to 268533 states and 428088 transitions. [2019-09-10 04:59:34,258 INFO L78 Accepts]: Start accepts. Automaton has 268533 states and 428088 transitions. Word has length 153 [2019-09-10 04:59:34,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:59:34,259 INFO L475 AbstractCegarLoop]: Abstraction has 268533 states and 428088 transitions. [2019-09-10 04:59:34,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 04:59:34,260 INFO L276 IsEmpty]: Start isEmpty. Operand 268533 states and 428088 transitions. [2019-09-10 04:59:34,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 04:59:34,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:59:34,275 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:59:34,276 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:59:34,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:59:34,276 INFO L82 PathProgramCache]: Analyzing trace with hash 649801446, now seen corresponding path program 1 times [2019-09-10 04:59:34,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:59:34,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:34,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:59:34,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:34,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:59:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:59:34,692 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-10 04:59:34,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:59:34,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:59:34,694 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:59:34,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:59:34,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:59:34,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:59:34,696 INFO L87 Difference]: Start difference. First operand 268533 states and 428088 transitions. Second operand 11 states. [2019-09-10 04:59:38,139 WARN L188 SmtUtils]: Spent 3.40 s on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2019-09-10 04:59:47,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:59:47,422 INFO L93 Difference]: Finished difference Result 385391 states and 615452 transitions. [2019-09-10 04:59:47,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-10 04:59:47,422 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 154 [2019-09-10 04:59:47,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:59:48,427 INFO L225 Difference]: With dead ends: 385391 [2019-09-10 04:59:48,427 INFO L226 Difference]: Without dead ends: 385391 [2019-09-10 04:59:48,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1073 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=607, Invalid=2473, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 04:59:48,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385391 states. [2019-09-10 04:59:54,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385391 to 346441. [2019-09-10 04:59:54,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346441 states. [2019-09-10 05:00:03,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346441 states to 346441 states and 552212 transitions. [2019-09-10 05:00:03,459 INFO L78 Accepts]: Start accepts. Automaton has 346441 states and 552212 transitions. Word has length 154 [2019-09-10 05:00:03,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:00:03,459 INFO L475 AbstractCegarLoop]: Abstraction has 346441 states and 552212 transitions. [2019-09-10 05:00:03,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 05:00:03,459 INFO L276 IsEmpty]: Start isEmpty. Operand 346441 states and 552212 transitions. [2019-09-10 05:00:03,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 05:00:03,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:03,473 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:00:03,473 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:03,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:03,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1637949138, now seen corresponding path program 1 times [2019-09-10 05:00:03,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:03,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:03,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:03,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:03,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:03,711 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-10 05:00:03,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:03,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 05:00:03,712 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:03,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 05:00:03,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 05:00:03,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-10 05:00:03,713 INFO L87 Difference]: Start difference. First operand 346441 states and 552212 transitions. Second operand 12 states. [2019-09-10 05:00:21,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:00:21,740 INFO L93 Difference]: Finished difference Result 867067 states and 1400824 transitions. [2019-09-10 05:00:21,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-10 05:00:21,740 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 155 [2019-09-10 05:00:21,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:00:24,731 INFO L225 Difference]: With dead ends: 867067 [2019-09-10 05:00:24,731 INFO L226 Difference]: Without dead ends: 867067 [2019-09-10 05:00:24,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1129 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=771, Invalid=2651, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 05:00:25,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867067 states. [2019-09-10 05:00:39,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867067 to 713916. [2019-09-10 05:00:39,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713916 states. [2019-09-10 05:00:51,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713916 states to 713916 states and 1152536 transitions. [2019-09-10 05:00:51,559 INFO L78 Accepts]: Start accepts. Automaton has 713916 states and 1152536 transitions. Word has length 155 [2019-09-10 05:00:51,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:00:51,559 INFO L475 AbstractCegarLoop]: Abstraction has 713916 states and 1152536 transitions. [2019-09-10 05:00:51,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 05:00:51,560 INFO L276 IsEmpty]: Start isEmpty. Operand 713916 states and 1152536 transitions. [2019-09-10 05:00:51,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 05:00:51,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:51,566 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:00:51,566 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:51,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:51,567 INFO L82 PathProgramCache]: Analyzing trace with hash 608589840, now seen corresponding path program 1 times [2019-09-10 05:00:51,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:51,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:51,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:51,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:51,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:51,752 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-10 05:00:51,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:51,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 05:00:51,752 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:51,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 05:00:51,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 05:00:51,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 05:00:51,755 INFO L87 Difference]: Start difference. First operand 713916 states and 1152536 transitions. Second operand 7 states. [2019-09-10 05:01:08,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:01:08,490 INFO L93 Difference]: Finished difference Result 698521 states and 1128595 transitions. [2019-09-10 05:01:08,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 05:01:08,490 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 155 [2019-09-10 05:01:08,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:01:10,240 INFO L225 Difference]: With dead ends: 698521 [2019-09-10 05:01:10,240 INFO L226 Difference]: Without dead ends: 698521 [2019-09-10 05:01:10,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 05:01:10,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698521 states. [2019-09-10 05:01:28,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698521 to 589653. [2019-09-10 05:01:28,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589653 states. [2019-09-10 05:01:29,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589653 states to 589653 states and 952480 transitions. [2019-09-10 05:01:29,794 INFO L78 Accepts]: Start accepts. Automaton has 589653 states and 952480 transitions. Word has length 155 [2019-09-10 05:01:29,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:01:29,794 INFO L475 AbstractCegarLoop]: Abstraction has 589653 states and 952480 transitions. [2019-09-10 05:01:29,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 05:01:29,794 INFO L276 IsEmpty]: Start isEmpty. Operand 589653 states and 952480 transitions. [2019-09-10 05:01:29,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 05:01:29,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:01:29,801 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:01:29,801 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:01:29,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:01:29,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1541103031, now seen corresponding path program 1 times [2019-09-10 05:01:29,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:01:29,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:01:29,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:01:29,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:01:29,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:01:29,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:01:31,764 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-10 05:01:31,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:01:31,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 05:01:31,765 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:01:31,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 05:01:31,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 05:01:31,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 05:01:31,767 INFO L87 Difference]: Start difference. First operand 589653 states and 952480 transitions. Second operand 5 states. [2019-09-10 05:01:43,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:01:43,590 INFO L93 Difference]: Finished difference Result 1170775 states and 1877837 transitions. [2019-09-10 05:01:43,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 05:01:43,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-09-10 05:01:43,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:01:47,693 INFO L225 Difference]: With dead ends: 1170775 [2019-09-10 05:01:47,693 INFO L226 Difference]: Without dead ends: 1170775 [2019-09-10 05:01:47,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 05:01:48,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170775 states. [2019-09-10 05:02:21,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170775 to 1170773. [2019-09-10 05:02:21,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1170773 states. [2019-09-10 05:02:42,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170773 states to 1170773 states and 1877836 transitions. [2019-09-10 05:02:42,328 INFO L78 Accepts]: Start accepts. Automaton has 1170773 states and 1877836 transitions. Word has length 156 [2019-09-10 05:02:42,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:02:42,328 INFO L475 AbstractCegarLoop]: Abstraction has 1170773 states and 1877836 transitions. [2019-09-10 05:02:42,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 05:02:42,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1170773 states and 1877836 transitions. [2019-09-10 05:02:42,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 05:02:42,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:02:42,337 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:02:42,337 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:02:42,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:02:42,338 INFO L82 PathProgramCache]: Analyzing trace with hash 2124094970, now seen corresponding path program 1 times [2019-09-10 05:02:42,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:02:42,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:02:42,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:02:42,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:02:42,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:02:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:02:42,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-10 05:02:42,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:02:42,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 05:02:42,536 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:02:42,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 05:02:42,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 05:02:42,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 05:02:42,537 INFO L87 Difference]: Start difference. First operand 1170773 states and 1877836 transitions. Second operand 5 states. [2019-09-10 05:03:04,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:03:04,350 INFO L93 Difference]: Finished difference Result 1580029 states and 2529812 transitions. [2019-09-10 05:03:04,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 05:03:04,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-09-10 05:03:04,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:03:10,404 INFO L225 Difference]: With dead ends: 1580029 [2019-09-10 05:03:10,404 INFO L226 Difference]: Without dead ends: 1580029 [2019-09-10 05:03:10,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 05:03:11,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580029 states.