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-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:11:59,295 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:11:59,298 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:11:59,317 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:11:59,317 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:11:59,319 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:11:59,321 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:11:59,331 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:11:59,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:11:59,334 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:11:59,335 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:11:59,336 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:11:59,336 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:11:59,337 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:11:59,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:11:59,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:11:59,343 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:11:59,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:11:59,347 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:11:59,351 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:11:59,354 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:11:59,356 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:11:59,359 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:11:59,360 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:11:59,362 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:11:59,362 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:11:59,363 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:11:59,365 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:11:59,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:11:59,368 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:11:59,368 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:11:59,370 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:11:59,370 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:11:59,371 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:11:59,375 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:11:59,376 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:11:59,377 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:11:59,377 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:11:59,377 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:11:59,378 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:11:59,378 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:11:59,380 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 06:11:59,419 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:11:59,420 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:11:59,420 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:11:59,420 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:11:59,424 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:11:59,424 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:11:59,424 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:11:59,424 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:11:59,425 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:11:59,425 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:11:59,426 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:11:59,426 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:11:59,426 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:11:59,426 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:11:59,426 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:11:59,427 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:11:59,427 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:11:59,427 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:11:59,428 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:11:59,428 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:11:59,429 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:11:59,429 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:11:59,429 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:11:59,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:11:59,430 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:11:59,430 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:11:59,430 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:11:59,430 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:11:59,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:11:59,431 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:11:59,479 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:11:59,492 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:11:59,495 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:11:59,497 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:11:59,497 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:11:59,498 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 06:11:59,560 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d02f528e/b090f0f484814bf5b0ea6b3d9dfcc65d/FLAGa799cccd2 [2019-09-10 06:12:00,121 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:12:00,122 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 06:12:00,135 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d02f528e/b090f0f484814bf5b0ea6b3d9dfcc65d/FLAGa799cccd2 [2019-09-10 06:12:00,420 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d02f528e/b090f0f484814bf5b0ea6b3d9dfcc65d [2019-09-10 06:12:00,434 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:12:00,437 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:12:00,440 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:12:00,441 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:12:00,444 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:12:00,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:12:00" (1/1) ... [2019-09-10 06:12:00,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408566e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:00, skipping insertion in model container [2019-09-10 06:12:00,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:12:00" (1/1) ... [2019-09-10 06:12:00,458 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:12:00,539 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:12:01,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:12:01,113 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:12:01,272 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:12:01,292 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:12:01,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:01 WrapperNode [2019-09-10 06:12:01,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:12:01,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:12:01,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:12:01,294 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:12:01,305 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:01" (1/1) ... [2019-09-10 06:12:01,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:01" (1/1) ... [2019-09-10 06:12:01,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:01" (1/1) ... [2019-09-10 06:12:01,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:01" (1/1) ... [2019-09-10 06:12:01,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:01" (1/1) ... [2019-09-10 06:12:01,368 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:01" (1/1) ... [2019-09-10 06:12:01,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:01" (1/1) ... [2019-09-10 06:12:01,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:12:01,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:12:01,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:12:01,382 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:12:01,382 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:01" (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 06:12:01,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:12:01,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:12:01,461 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:12:01,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:12:01,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:12:01,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:12:01,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:12:01,462 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:12:01,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:12:01,462 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:12:01,462 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:12:01,462 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:12:01,463 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:12:01,463 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:12:01,463 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:12:01,463 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:12:01,463 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:12:01,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:12:01,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:12:02,955 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:12:02,955 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:12:02,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:12:02 BoogieIcfgContainer [2019-09-10 06:12:02,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:12:02,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:12:02,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:12:02,962 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:12:02,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:12:00" (1/3) ... [2019-09-10 06:12:02,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55421151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:12:02, skipping insertion in model container [2019-09-10 06:12:02,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:01" (2/3) ... [2019-09-10 06:12:02,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55421151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:12:02, skipping insertion in model container [2019-09-10 06:12:02,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:12:02" (3/3) ... [2019-09-10 06:12:02,966 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 06:12:02,976 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:12:03,001 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:12:03,019 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:12:03,052 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:12:03,052 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:12:03,052 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:12:03,052 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:12:03,052 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:12:03,053 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:12:03,053 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:12:03,053 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:12:03,095 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states. [2019-09-10 06:12:03,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 06:12:03,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:03,132 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 06:12:03,134 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:03,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:03,139 INFO L82 PathProgramCache]: Analyzing trace with hash 885340602, now seen corresponding path program 1 times [2019-09-10 06:12:03,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:03,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:03,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:03,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:03,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:03,756 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 06:12:03,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:03,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:03,759 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:03,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:03,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:03,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:03,785 INFO L87 Difference]: Start difference. First operand 317 states. Second operand 3 states. [2019-09-10 06:12:04,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:04,052 INFO L93 Difference]: Finished difference Result 522 states and 913 transitions. [2019-09-10 06:12:04,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:04,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-09-10 06:12:04,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:04,133 INFO L225 Difference]: With dead ends: 522 [2019-09-10 06:12:04,134 INFO L226 Difference]: Without dead ends: 514 [2019-09-10 06:12:04,137 INFO L628 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-10 06:12:04,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-09-10 06:12:04,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 512. [2019-09-10 06:12:04,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-09-10 06:12:04,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 761 transitions. [2019-09-10 06:12:04,243 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 761 transitions. Word has length 150 [2019-09-10 06:12:04,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:04,247 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 761 transitions. [2019-09-10 06:12:04,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:04,248 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 761 transitions. [2019-09-10 06:12:04,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 06:12:04,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:04,261 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 06:12:04,262 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:04,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:04,263 INFO L82 PathProgramCache]: Analyzing trace with hash -20093490, now seen corresponding path program 1 times [2019-09-10 06:12:04,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:04,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:04,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:04,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:04,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:04,527 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 06:12:04,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:04,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:04,528 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:04,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:04,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:04,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:04,530 INFO L87 Difference]: Start difference. First operand 512 states and 761 transitions. Second operand 3 states. [2019-09-10 06:12:04,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:04,637 INFO L93 Difference]: Finished difference Result 884 states and 1324 transitions. [2019-09-10 06:12:04,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:04,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-09-10 06:12:04,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:04,643 INFO L225 Difference]: With dead ends: 884 [2019-09-10 06:12:04,643 INFO L226 Difference]: Without dead ends: 884 [2019-09-10 06:12:04,644 INFO L628 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-10 06:12:04,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2019-09-10 06:12:04,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 882. [2019-09-10 06:12:04,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2019-09-10 06:12:04,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1323 transitions. [2019-09-10 06:12:04,665 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1323 transitions. Word has length 150 [2019-09-10 06:12:04,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:04,666 INFO L475 AbstractCegarLoop]: Abstraction has 882 states and 1323 transitions. [2019-09-10 06:12:04,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:04,666 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1323 transitions. [2019-09-10 06:12:04,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 06:12:04,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:04,669 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 06:12:04,669 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:04,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:04,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1175617460, now seen corresponding path program 1 times [2019-09-10 06:12:04,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:04,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:04,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:04,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:04,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:05,033 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 06:12:05,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:05,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:05,034 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:05,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:05,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:05,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:05,036 INFO L87 Difference]: Start difference. First operand 882 states and 1323 transitions. Second operand 4 states. [2019-09-10 06:12:05,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:05,155 INFO L93 Difference]: Finished difference Result 1708 states and 2537 transitions. [2019-09-10 06:12:05,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:05,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-09-10 06:12:05,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:05,165 INFO L225 Difference]: With dead ends: 1708 [2019-09-10 06:12:05,166 INFO L226 Difference]: Without dead ends: 1708 [2019-09-10 06:12:05,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:12:05,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2019-09-10 06:12:05,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1706. [2019-09-10 06:12:05,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2019-09-10 06:12:05,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2536 transitions. [2019-09-10 06:12:05,209 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 2536 transitions. Word has length 150 [2019-09-10 06:12:05,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:05,209 INFO L475 AbstractCegarLoop]: Abstraction has 1706 states and 2536 transitions. [2019-09-10 06:12:05,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:12:05,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2536 transitions. [2019-09-10 06:12:05,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 06:12:05,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:05,213 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 06:12:05,214 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:05,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:05,214 INFO L82 PathProgramCache]: Analyzing trace with hash -522806920, now seen corresponding path program 1 times [2019-09-10 06:12:05,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:05,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:05,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:05,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:05,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:05,272 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 06:12:05,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:05,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:05,273 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:05,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:05,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:05,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:05,274 INFO L87 Difference]: Start difference. First operand 1706 states and 2536 transitions. Second operand 3 states. [2019-09-10 06:12:05,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:05,313 INFO L93 Difference]: Finished difference Result 3398 states and 5051 transitions. [2019-09-10 06:12:05,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:05,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-09-10 06:12:05,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:05,329 INFO L225 Difference]: With dead ends: 3398 [2019-09-10 06:12:05,329 INFO L226 Difference]: Without dead ends: 3398 [2019-09-10 06:12:05,329 INFO L628 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-10 06:12:05,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-09-10 06:12:05,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 1708. [2019-09-10 06:12:05,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1708 states. [2019-09-10 06:12:05,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 2538 transitions. [2019-09-10 06:12:05,381 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 2538 transitions. Word has length 151 [2019-09-10 06:12:05,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:05,381 INFO L475 AbstractCegarLoop]: Abstraction has 1708 states and 2538 transitions. [2019-09-10 06:12:05,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:05,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2538 transitions. [2019-09-10 06:12:05,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 06:12:05,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:05,385 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] [2019-09-10 06:12:05,385 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:05,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:05,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1124709406, now seen corresponding path program 1 times [2019-09-10 06:12:05,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:05,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:05,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:05,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:05,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:05,488 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 06:12:05,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:05,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:05,490 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:05,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:05,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:05,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:05,492 INFO L87 Difference]: Start difference. First operand 1708 states and 2538 transitions. Second operand 3 states. [2019-09-10 06:12:05,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:05,556 INFO L93 Difference]: Finished difference Result 3310 states and 4872 transitions. [2019-09-10 06:12:05,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:05,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-09-10 06:12:05,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:05,572 INFO L225 Difference]: With dead ends: 3310 [2019-09-10 06:12:05,572 INFO L226 Difference]: Without dead ends: 3310 [2019-09-10 06:12:05,573 INFO L628 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-10 06:12:05,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3310 states. [2019-09-10 06:12:05,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3310 to 3308. [2019-09-10 06:12:05,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3308 states. [2019-09-10 06:12:05,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3308 states to 3308 states and 4871 transitions. [2019-09-10 06:12:05,705 INFO L78 Accepts]: Start accepts. Automaton has 3308 states and 4871 transitions. Word has length 152 [2019-09-10 06:12:05,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:05,706 INFO L475 AbstractCegarLoop]: Abstraction has 3308 states and 4871 transitions. [2019-09-10 06:12:05,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:05,706 INFO L276 IsEmpty]: Start isEmpty. Operand 3308 states and 4871 transitions. [2019-09-10 06:12:05,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 06:12:05,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:05,712 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] [2019-09-10 06:12:05,712 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:05,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:05,713 INFO L82 PathProgramCache]: Analyzing trace with hash -617278081, now seen corresponding path program 1 times [2019-09-10 06:12:05,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:05,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:05,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:05,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:05,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:05,903 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 06:12:05,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:05,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:05,903 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:05,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:05,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:05,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:05,905 INFO L87 Difference]: Start difference. First operand 3308 states and 4871 transitions. Second operand 4 states. [2019-09-10 06:12:05,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:05,948 INFO L93 Difference]: Finished difference Result 2588 states and 3793 transitions. [2019-09-10 06:12:05,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:05,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-09-10 06:12:05,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:05,961 INFO L225 Difference]: With dead ends: 2588 [2019-09-10 06:12:05,961 INFO L226 Difference]: Without dead ends: 2528 [2019-09-10 06:12:05,961 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:12:05,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2019-09-10 06:12:06,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2528. [2019-09-10 06:12:06,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2528 states. [2019-09-10 06:12:06,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2528 states and 3707 transitions. [2019-09-10 06:12:06,023 INFO L78 Accepts]: Start accepts. Automaton has 2528 states and 3707 transitions. Word has length 152 [2019-09-10 06:12:06,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:06,024 INFO L475 AbstractCegarLoop]: Abstraction has 2528 states and 3707 transitions. [2019-09-10 06:12:06,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:12:06,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2528 states and 3707 transitions. [2019-09-10 06:12:06,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-10 06:12:06,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:06,034 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, 1] [2019-09-10 06:12:06,035 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:06,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:06,043 INFO L82 PathProgramCache]: Analyzing trace with hash 696225132, now seen corresponding path program 1 times [2019-09-10 06:12:06,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:06,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:06,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:06,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:06,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:06,210 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 06:12:06,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:06,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:06,211 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:06,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:06,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:06,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:06,213 INFO L87 Difference]: Start difference. First operand 2528 states and 3707 transitions. Second operand 3 states. [2019-09-10 06:12:06,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:06,611 INFO L93 Difference]: Finished difference Result 4696 states and 6888 transitions. [2019-09-10 06:12:06,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:06,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-09-10 06:12:06,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:06,644 INFO L225 Difference]: With dead ends: 4696 [2019-09-10 06:12:06,644 INFO L226 Difference]: Without dead ends: 4696 [2019-09-10 06:12:06,645 INFO L628 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-10 06:12:06,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4696 states. [2019-09-10 06:12:06,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4696 to 4694. [2019-09-10 06:12:06,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4694 states. [2019-09-10 06:12:06,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4694 states to 4694 states and 6887 transitions. [2019-09-10 06:12:06,806 INFO L78 Accepts]: Start accepts. Automaton has 4694 states and 6887 transitions. Word has length 158 [2019-09-10 06:12:06,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:06,806 INFO L475 AbstractCegarLoop]: Abstraction has 4694 states and 6887 transitions. [2019-09-10 06:12:06,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:06,807 INFO L276 IsEmpty]: Start isEmpty. Operand 4694 states and 6887 transitions. [2019-09-10 06:12:06,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-10 06:12:06,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:06,816 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, 1] [2019-09-10 06:12:06,816 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:06,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:06,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1185599087, now seen corresponding path program 1 times [2019-09-10 06:12:06,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:06,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:06,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:06,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:06,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:06,983 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 06:12:06,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:06,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:12:06,983 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:06,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:12:06,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:12:06,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:12:06,985 INFO L87 Difference]: Start difference. First operand 4694 states and 6887 transitions. Second operand 5 states. [2019-09-10 06:12:07,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:07,278 INFO L93 Difference]: Finished difference Result 4086 states and 6077 transitions. [2019-09-10 06:12:07,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:12:07,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-09-10 06:12:07,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:07,295 INFO L225 Difference]: With dead ends: 4086 [2019-09-10 06:12:07,295 INFO L226 Difference]: Without dead ends: 4076 [2019-09-10 06:12:07,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:12:07,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4076 states. [2019-09-10 06:12:07,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4076 to 4074. [2019-09-10 06:12:07,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4074 states. [2019-09-10 06:12:07,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4074 states to 4074 states and 6064 transitions. [2019-09-10 06:12:07,376 INFO L78 Accepts]: Start accepts. Automaton has 4074 states and 6064 transitions. Word has length 158 [2019-09-10 06:12:07,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:07,376 INFO L475 AbstractCegarLoop]: Abstraction has 4074 states and 6064 transitions. [2019-09-10 06:12:07,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:12:07,376 INFO L276 IsEmpty]: Start isEmpty. Operand 4074 states and 6064 transitions. [2019-09-10 06:12:07,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-10 06:12:07,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:07,382 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, 1] [2019-09-10 06:12:07,382 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:07,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:07,383 INFO L82 PathProgramCache]: Analyzing trace with hash 11065959, now seen corresponding path program 1 times [2019-09-10 06:12:07,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:07,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:07,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:07,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:07,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:07,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:12:07,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:07,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:12:07,735 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:07,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:12:07,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:12:07,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:12:07,738 INFO L87 Difference]: Start difference. First operand 4074 states and 6064 transitions. Second operand 9 states. [2019-09-10 06:12:08,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:08,109 INFO L93 Difference]: Finished difference Result 7798 states and 11623 transitions. [2019-09-10 06:12:08,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:08,109 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 158 [2019-09-10 06:12:08,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:08,154 INFO L225 Difference]: With dead ends: 7798 [2019-09-10 06:12:08,155 INFO L226 Difference]: Without dead ends: 7798 [2019-09-10 06:12:08,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:12:08,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7798 states. [2019-09-10 06:12:08,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7798 to 7796. [2019-09-10 06:12:08,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7796 states. [2019-09-10 06:12:08,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7796 states to 7796 states and 11622 transitions. [2019-09-10 06:12:08,293 INFO L78 Accepts]: Start accepts. Automaton has 7796 states and 11622 transitions. Word has length 158 [2019-09-10 06:12:08,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:08,293 INFO L475 AbstractCegarLoop]: Abstraction has 7796 states and 11622 transitions. [2019-09-10 06:12:08,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:12:08,294 INFO L276 IsEmpty]: Start isEmpty. Operand 7796 states and 11622 transitions. [2019-09-10 06:12:08,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-10 06:12:08,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:08,303 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, 1] [2019-09-10 06:12:08,303 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:08,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:08,304 INFO L82 PathProgramCache]: Analyzing trace with hash -362607228, now seen corresponding path program 1 times [2019-09-10 06:12:08,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:08,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:08,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:08,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:08,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:08,968 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 06:12:08,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:08,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:12:08,969 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:08,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:12:08,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:12:08,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:12:08,973 INFO L87 Difference]: Start difference. First operand 7796 states and 11622 transitions. Second operand 17 states. [2019-09-10 06:12:11,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:11,348 INFO L93 Difference]: Finished difference Result 12015 states and 17910 transitions. [2019-09-10 06:12:11,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:12:11,354 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 158 [2019-09-10 06:12:11,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:11,378 INFO L225 Difference]: With dead ends: 12015 [2019-09-10 06:12:11,378 INFO L226 Difference]: Without dead ends: 12015 [2019-09-10 06:12:11,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=334, Invalid=926, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 06:12:11,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12015 states. [2019-09-10 06:12:11,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12015 to 8247. [2019-09-10 06:12:11,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8247 states. [2019-09-10 06:12:11,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8247 states to 8247 states and 12204 transitions. [2019-09-10 06:12:11,522 INFO L78 Accepts]: Start accepts. Automaton has 8247 states and 12204 transitions. Word has length 158 [2019-09-10 06:12:11,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:11,523 INFO L475 AbstractCegarLoop]: Abstraction has 8247 states and 12204 transitions. [2019-09-10 06:12:11,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:12:11,523 INFO L276 IsEmpty]: Start isEmpty. Operand 8247 states and 12204 transitions. [2019-09-10 06:12:11,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-10 06:12:11,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:11,533 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, 1] [2019-09-10 06:12:11,533 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:11,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:11,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1550557348, now seen corresponding path program 1 times [2019-09-10 06:12:11,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:11,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:11,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:11,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:11,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:11,709 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 06:12:11,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:11,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:11,710 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:11,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:11,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:11,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:11,711 INFO L87 Difference]: Start difference. First operand 8247 states and 12204 transitions. Second operand 4 states. [2019-09-10 06:12:11,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:11,810 INFO L93 Difference]: Finished difference Result 13499 states and 19738 transitions. [2019-09-10 06:12:11,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:11,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-10 06:12:11,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:11,837 INFO L225 Difference]: With dead ends: 13499 [2019-09-10 06:12:11,837 INFO L226 Difference]: Without dead ends: 13491 [2019-09-10 06:12:11,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:12:11,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13491 states. [2019-09-10 06:12:12,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13491 to 13489. [2019-09-10 06:12:12,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13489 states. [2019-09-10 06:12:12,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13489 states to 13489 states and 19729 transitions. [2019-09-10 06:12:12,049 INFO L78 Accepts]: Start accepts. Automaton has 13489 states and 19729 transitions. Word has length 158 [2019-09-10 06:12:12,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:12,049 INFO L475 AbstractCegarLoop]: Abstraction has 13489 states and 19729 transitions. [2019-09-10 06:12:12,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:12:12,049 INFO L276 IsEmpty]: Start isEmpty. Operand 13489 states and 19729 transitions. [2019-09-10 06:12:12,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 06:12:12,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:12,067 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, 1, 1, 1] [2019-09-10 06:12:12,067 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:12,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:12,068 INFO L82 PathProgramCache]: Analyzing trace with hash -470353988, now seen corresponding path program 1 times [2019-09-10 06:12:12,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:12,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:12,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:12,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:12,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:12,169 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 06:12:12,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:12,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:12,170 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:12,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:12,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:12,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:12,171 INFO L87 Difference]: Start difference. First operand 13489 states and 19729 transitions. Second operand 3 states. [2019-09-10 06:12:12,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:12,313 INFO L93 Difference]: Finished difference Result 23672 states and 34141 transitions. [2019-09-10 06:12:12,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:12,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-09-10 06:12:12,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:12,358 INFO L225 Difference]: With dead ends: 23672 [2019-09-10 06:12:12,358 INFO L226 Difference]: Without dead ends: 23672 [2019-09-10 06:12:12,359 INFO L628 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-10 06:12:12,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23672 states. [2019-09-10 06:12:12,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23672 to 23670. [2019-09-10 06:12:12,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23670 states. [2019-09-10 06:12:12,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23670 states to 23670 states and 34140 transitions. [2019-09-10 06:12:12,677 INFO L78 Accepts]: Start accepts. Automaton has 23670 states and 34140 transitions. Word has length 160 [2019-09-10 06:12:12,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:12,677 INFO L475 AbstractCegarLoop]: Abstraction has 23670 states and 34140 transitions. [2019-09-10 06:12:12,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:12,678 INFO L276 IsEmpty]: Start isEmpty. Operand 23670 states and 34140 transitions. [2019-09-10 06:12:12,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 06:12:12,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:12,704 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, 1, 1, 1] [2019-09-10 06:12:12,704 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:12,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:12,704 INFO L82 PathProgramCache]: Analyzing trace with hash 292378521, now seen corresponding path program 1 times [2019-09-10 06:12:12,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:12,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:12,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:12,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:12,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:12,831 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 06:12:12,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:12,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:12,832 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:12,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:12,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:12,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:12,834 INFO L87 Difference]: Start difference. First operand 23670 states and 34140 transitions. Second operand 4 states. [2019-09-10 06:12:12,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:12,927 INFO L93 Difference]: Finished difference Result 21110 states and 30419 transitions. [2019-09-10 06:12:12,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:12,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-10 06:12:12,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:12,975 INFO L225 Difference]: With dead ends: 21110 [2019-09-10 06:12:12,975 INFO L226 Difference]: Without dead ends: 21062 [2019-09-10 06:12:12,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:12:12,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21062 states. [2019-09-10 06:12:13,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21062 to 21062. [2019-09-10 06:12:13,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21062 states. [2019-09-10 06:12:13,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21062 states to 21062 states and 30356 transitions. [2019-09-10 06:12:13,368 INFO L78 Accepts]: Start accepts. Automaton has 21062 states and 30356 transitions. Word has length 160 [2019-09-10 06:12:13,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:13,369 INFO L475 AbstractCegarLoop]: Abstraction has 21062 states and 30356 transitions. [2019-09-10 06:12:13,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:12:13,369 INFO L276 IsEmpty]: Start isEmpty. Operand 21062 states and 30356 transitions. [2019-09-10 06:12:13,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 06:12:13,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:13,393 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:13,393 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:13,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:13,394 INFO L82 PathProgramCache]: Analyzing trace with hash 707984276, now seen corresponding path program 1 times [2019-09-10 06:12:13,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:13,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:13,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:13,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:13,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:13,554 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 06:12:13,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:13,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:12:13,555 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:13,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:12:13,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:12:13,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:12:13,556 INFO L87 Difference]: Start difference. First operand 21062 states and 30356 transitions. Second operand 5 states. [2019-09-10 06:12:13,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:13,784 INFO L93 Difference]: Finished difference Result 29312 states and 43583 transitions. [2019-09-10 06:12:13,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:12:13,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 166 [2019-09-10 06:12:13,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:13,869 INFO L225 Difference]: With dead ends: 29312 [2019-09-10 06:12:13,870 INFO L226 Difference]: Without dead ends: 29312 [2019-09-10 06:12:13,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:12:13,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29312 states. [2019-09-10 06:12:14,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29312 to 24610. [2019-09-10 06:12:14,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24610 states. [2019-09-10 06:12:14,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24610 states to 24610 states and 36036 transitions. [2019-09-10 06:12:14,209 INFO L78 Accepts]: Start accepts. Automaton has 24610 states and 36036 transitions. Word has length 166 [2019-09-10 06:12:14,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:14,210 INFO L475 AbstractCegarLoop]: Abstraction has 24610 states and 36036 transitions. [2019-09-10 06:12:14,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:12:14,210 INFO L276 IsEmpty]: Start isEmpty. Operand 24610 states and 36036 transitions. [2019-09-10 06:12:14,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 06:12:14,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:14,253 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:14,254 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:14,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:14,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1903695226, now seen corresponding path program 1 times [2019-09-10 06:12:14,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:14,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:14,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:14,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:14,256 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:15,119 WARN L188 SmtUtils]: Spent 734.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2019-09-10 06:12:15,187 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 06:12:15,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:15,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:12:15,187 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:15,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:12:15,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:12:15,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:12:15,188 INFO L87 Difference]: Start difference. First operand 24610 states and 36036 transitions. Second operand 8 states. [2019-09-10 06:12:15,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:15,652 INFO L93 Difference]: Finished difference Result 44605 states and 67036 transitions. [2019-09-10 06:12:15,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 06:12:15,652 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 166 [2019-09-10 06:12:15,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:15,691 INFO L225 Difference]: With dead ends: 44605 [2019-09-10 06:12:15,692 INFO L226 Difference]: Without dead ends: 44605 [2019-09-10 06:12:15,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:12:15,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44605 states. [2019-09-10 06:12:16,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44605 to 42887. [2019-09-10 06:12:16,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42887 states. [2019-09-10 06:12:16,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42887 states to 42887 states and 64497 transitions. [2019-09-10 06:12:16,342 INFO L78 Accepts]: Start accepts. Automaton has 42887 states and 64497 transitions. Word has length 166 [2019-09-10 06:12:16,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:16,342 INFO L475 AbstractCegarLoop]: Abstraction has 42887 states and 64497 transitions. [2019-09-10 06:12:16,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:12:16,342 INFO L276 IsEmpty]: Start isEmpty. Operand 42887 states and 64497 transitions. [2019-09-10 06:12:16,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 06:12:16,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:16,361 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:16,361 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:16,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:16,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1189246805, now seen corresponding path program 1 times [2019-09-10 06:12:16,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:16,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:16,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:16,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:16,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:16,510 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 06:12:16,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:16,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:16,510 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:16,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:16,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:16,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:16,512 INFO L87 Difference]: Start difference. First operand 42887 states and 64497 transitions. Second operand 4 states. [2019-09-10 06:12:16,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:16,719 INFO L93 Difference]: Finished difference Result 82875 states and 123251 transitions. [2019-09-10 06:12:16,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:16,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-10 06:12:16,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:16,797 INFO L225 Difference]: With dead ends: 82875 [2019-09-10 06:12:16,798 INFO L226 Difference]: Without dead ends: 82875 [2019-09-10 06:12:16,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:12:16,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82875 states. [2019-09-10 06:12:18,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82875 to 82873. [2019-09-10 06:12:18,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82873 states. [2019-09-10 06:12:18,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82873 states to 82873 states and 123250 transitions. [2019-09-10 06:12:18,716 INFO L78 Accepts]: Start accepts. Automaton has 82873 states and 123250 transitions. Word has length 166 [2019-09-10 06:12:18,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:18,716 INFO L475 AbstractCegarLoop]: Abstraction has 82873 states and 123250 transitions. [2019-09-10 06:12:18,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:12:18,717 INFO L276 IsEmpty]: Start isEmpty. Operand 82873 states and 123250 transitions. [2019-09-10 06:12:18,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:12:18,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:18,741 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:18,741 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:18,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:18,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1739927887, now seen corresponding path program 1 times [2019-09-10 06:12:18,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:18,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:18,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:18,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:18,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:18,804 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 06:12:18,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:18,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:18,804 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:18,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:18,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:18,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:18,805 INFO L87 Difference]: Start difference. First operand 82873 states and 123250 transitions. Second operand 3 states. [2019-09-10 06:12:20,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:20,661 INFO L93 Difference]: Finished difference Result 165657 states and 246385 transitions. [2019-09-10 06:12:20,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:20,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-09-10 06:12:20,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:20,842 INFO L225 Difference]: With dead ends: 165657 [2019-09-10 06:12:20,842 INFO L226 Difference]: Without dead ends: 165657 [2019-09-10 06:12:20,843 INFO L628 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-10 06:12:20,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165657 states. [2019-09-10 06:12:22,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165657 to 82879. [2019-09-10 06:12:22,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82879 states. [2019-09-10 06:12:22,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82879 states to 82879 states and 123256 transitions. [2019-09-10 06:12:22,250 INFO L78 Accepts]: Start accepts. Automaton has 82879 states and 123256 transitions. Word has length 167 [2019-09-10 06:12:22,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:22,250 INFO L475 AbstractCegarLoop]: Abstraction has 82879 states and 123256 transitions. [2019-09-10 06:12:22,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:22,251 INFO L276 IsEmpty]: Start isEmpty. Operand 82879 states and 123256 transitions. [2019-09-10 06:12:22,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 06:12:22,280 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:22,280 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:22,281 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:22,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:22,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1139483156, now seen corresponding path program 1 times [2019-09-10 06:12:22,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:22,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:22,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:22,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:22,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:22,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:22,415 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 06:12:22,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:22,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:22,415 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:22,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:22,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:22,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:22,417 INFO L87 Difference]: Start difference. First operand 82879 states and 123256 transitions. Second operand 4 states. [2019-09-10 06:12:22,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:22,620 INFO L93 Difference]: Finished difference Result 83064 states and 123472 transitions. [2019-09-10 06:12:22,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:22,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-09-10 06:12:22,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:22,704 INFO L225 Difference]: With dead ends: 83064 [2019-09-10 06:12:22,704 INFO L226 Difference]: Without dead ends: 82873 [2019-09-10 06:12:22,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:12:22,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82873 states. [2019-09-10 06:12:23,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82873 to 82873. [2019-09-10 06:12:23,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82873 states. [2019-09-10 06:12:23,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82873 states to 82873 states and 123244 transitions. [2019-09-10 06:12:23,984 INFO L78 Accepts]: Start accepts. Automaton has 82873 states and 123244 transitions. Word has length 168 [2019-09-10 06:12:23,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:23,984 INFO L475 AbstractCegarLoop]: Abstraction has 82873 states and 123244 transitions. [2019-09-10 06:12:23,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:12:23,984 INFO L276 IsEmpty]: Start isEmpty. Operand 82873 states and 123244 transitions. [2019-09-10 06:12:24,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 06:12:24,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:24,016 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:24,017 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:24,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:24,017 INFO L82 PathProgramCache]: Analyzing trace with hash -119100867, now seen corresponding path program 1 times [2019-09-10 06:12:24,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:24,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:24,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:24,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:24,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:24,115 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 06:12:24,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:24,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:24,116 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:24,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:24,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:24,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:24,117 INFO L87 Difference]: Start difference. First operand 82873 states and 123244 transitions. Second operand 3 states. [2019-09-10 06:12:24,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:24,500 INFO L93 Difference]: Finished difference Result 123432 states and 180867 transitions. [2019-09-10 06:12:24,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:24,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-10 06:12:24,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:24,682 INFO L225 Difference]: With dead ends: 123432 [2019-09-10 06:12:24,683 INFO L226 Difference]: Without dead ends: 123432 [2019-09-10 06:12:24,683 INFO L628 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-10 06:12:24,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123432 states. [2019-09-10 06:12:27,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123432 to 123430. [2019-09-10 06:12:27,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123430 states. [2019-09-10 06:12:27,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123430 states to 123430 states and 180866 transitions. [2019-09-10 06:12:27,800 INFO L78 Accepts]: Start accepts. Automaton has 123430 states and 180866 transitions. Word has length 168 [2019-09-10 06:12:27,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:27,800 INFO L475 AbstractCegarLoop]: Abstraction has 123430 states and 180866 transitions. [2019-09-10 06:12:27,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:27,800 INFO L276 IsEmpty]: Start isEmpty. Operand 123430 states and 180866 transitions. [2019-09-10 06:12:27,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-10 06:12:27,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:27,832 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:27,833 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:27,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:27,833 INFO L82 PathProgramCache]: Analyzing trace with hash 938171426, now seen corresponding path program 1 times [2019-09-10 06:12:27,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:27,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:27,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:27,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:27,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:27,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:27,913 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 06:12:27,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:27,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:27,913 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:27,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:27,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:27,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:27,915 INFO L87 Difference]: Start difference. First operand 123430 states and 180866 transitions. Second operand 3 states. [2019-09-10 06:12:28,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:28,496 INFO L93 Difference]: Finished difference Result 170310 states and 252967 transitions. [2019-09-10 06:12:28,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:28,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-10 06:12:28,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:28,701 INFO L225 Difference]: With dead ends: 170310 [2019-09-10 06:12:28,702 INFO L226 Difference]: Without dead ends: 170310 [2019-09-10 06:12:28,702 INFO L628 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-10 06:12:28,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170310 states. [2019-09-10 06:12:30,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170310 to 148535. [2019-09-10 06:12:30,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148535 states. [2019-09-10 06:12:30,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148535 states to 148535 states and 219672 transitions. [2019-09-10 06:12:30,824 INFO L78 Accepts]: Start accepts. Automaton has 148535 states and 219672 transitions. Word has length 174 [2019-09-10 06:12:30,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:30,825 INFO L475 AbstractCegarLoop]: Abstraction has 148535 states and 219672 transitions. [2019-09-10 06:12:30,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:30,825 INFO L276 IsEmpty]: Start isEmpty. Operand 148535 states and 219672 transitions. [2019-09-10 06:12:30,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-10 06:12:30,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:30,861 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:30,861 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:30,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:30,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1722974211, now seen corresponding path program 1 times [2019-09-10 06:12:30,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:30,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:30,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:30,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:30,863 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:30,982 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 06:12:30,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:30,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:30,982 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:30,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:30,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:30,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:30,984 INFO L87 Difference]: Start difference. First operand 148535 states and 219672 transitions. Second operand 3 states. [2019-09-10 06:12:33,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:33,812 INFO L93 Difference]: Finished difference Result 212213 states and 313294 transitions. [2019-09-10 06:12:33,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:33,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-10 06:12:33,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:34,222 INFO L225 Difference]: With dead ends: 212213 [2019-09-10 06:12:34,223 INFO L226 Difference]: Without dead ends: 212213 [2019-09-10 06:12:34,223 INFO L628 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-10 06:12:34,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212213 states. [2019-09-10 06:12:36,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212213 to 195802. [2019-09-10 06:12:36,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195802 states. [2019-09-10 06:12:36,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195802 states to 195802 states and 288439 transitions. [2019-09-10 06:12:36,789 INFO L78 Accepts]: Start accepts. Automaton has 195802 states and 288439 transitions. Word has length 174 [2019-09-10 06:12:36,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:36,790 INFO L475 AbstractCegarLoop]: Abstraction has 195802 states and 288439 transitions. [2019-09-10 06:12:36,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:36,790 INFO L276 IsEmpty]: Start isEmpty. Operand 195802 states and 288439 transitions. [2019-09-10 06:12:36,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-10 06:12:36,822 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:36,822 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:36,822 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:36,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:36,823 INFO L82 PathProgramCache]: Analyzing trace with hash 674762004, now seen corresponding path program 1 times [2019-09-10 06:12:36,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:36,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:36,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:36,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:36,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:37,118 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 06:12:37,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:37,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:12:37,120 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:37,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:12:37,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:12:37,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:12:37,121 INFO L87 Difference]: Start difference. First operand 195802 states and 288439 transitions. Second operand 10 states. [2019-09-10 06:12:37,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:37,965 INFO L93 Difference]: Finished difference Result 195802 states and 284635 transitions. [2019-09-10 06:12:37,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:12:37,966 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 174 [2019-09-10 06:12:37,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:41,674 INFO L225 Difference]: With dead ends: 195802 [2019-09-10 06:12:41,674 INFO L226 Difference]: Without dead ends: 195802 [2019-09-10 06:12:41,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:12:41,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195802 states. [2019-09-10 06:12:43,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195802 to 195802. [2019-09-10 06:12:43,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195802 states. [2019-09-10 06:12:43,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195802 states to 195802 states and 284635 transitions. [2019-09-10 06:12:43,751 INFO L78 Accepts]: Start accepts. Automaton has 195802 states and 284635 transitions. Word has length 174 [2019-09-10 06:12:43,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:43,752 INFO L475 AbstractCegarLoop]: Abstraction has 195802 states and 284635 transitions. [2019-09-10 06:12:43,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:12:43,752 INFO L276 IsEmpty]: Start isEmpty. Operand 195802 states and 284635 transitions. [2019-09-10 06:12:43,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-10 06:12:43,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:43,785 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:43,785 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:43,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:43,785 INFO L82 PathProgramCache]: Analyzing trace with hash 63372601, now seen corresponding path program 1 times [2019-09-10 06:12:43,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:43,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:43,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:43,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:43,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:43,955 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 06:12:43,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:43,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:12:43,955 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:43,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:12:43,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:12:43,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:12:43,957 INFO L87 Difference]: Start difference. First operand 195802 states and 284635 transitions. Second operand 5 states. [2019-09-10 06:12:45,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:45,103 INFO L93 Difference]: Finished difference Result 353221 states and 527212 transitions. [2019-09-10 06:12:45,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:12:45,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 174 [2019-09-10 06:12:45,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:45,555 INFO L225 Difference]: With dead ends: 353221 [2019-09-10 06:12:45,555 INFO L226 Difference]: Without dead ends: 353221 [2019-09-10 06:12:45,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:12:45,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353221 states. [2019-09-10 06:12:53,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353221 to 282249. [2019-09-10 06:12:53,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282249 states. [2019-09-10 06:12:54,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282249 states to 282249 states and 418271 transitions. [2019-09-10 06:12:54,174 INFO L78 Accepts]: Start accepts. Automaton has 282249 states and 418271 transitions. Word has length 174 [2019-09-10 06:12:54,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:54,175 INFO L475 AbstractCegarLoop]: Abstraction has 282249 states and 418271 transitions. [2019-09-10 06:12:54,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:12:54,175 INFO L276 IsEmpty]: Start isEmpty. Operand 282249 states and 418271 transitions. [2019-09-10 06:12:54,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-10 06:12:54,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:54,207 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:54,207 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:54,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:54,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1819571277, now seen corresponding path program 1 times [2019-09-10 06:12:54,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:54,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:54,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:54,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:54,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:54,471 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 06:12:54,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:54,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:12:54,472 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:54,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:12:54,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:12:54,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:12:54,474 INFO L87 Difference]: Start difference. First operand 282249 states and 418271 transitions. Second operand 9 states. [2019-09-10 06:12:56,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:56,183 INFO L93 Difference]: Finished difference Result 235162 states and 344251 transitions. [2019-09-10 06:12:56,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:56,184 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 174 [2019-09-10 06:12:56,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:56,485 INFO L225 Difference]: With dead ends: 235162 [2019-09-10 06:12:56,485 INFO L226 Difference]: Without dead ends: 235162 [2019-09-10 06:12:56,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:12:56,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235162 states. [2019-09-10 06:13:02,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235162 to 211306. [2019-09-10 06:13:02,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211306 states. [2019-09-10 06:13:03,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211306 states to 211306 states and 308038 transitions. [2019-09-10 06:13:03,243 INFO L78 Accepts]: Start accepts. Automaton has 211306 states and 308038 transitions. Word has length 174 [2019-09-10 06:13:03,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:03,243 INFO L475 AbstractCegarLoop]: Abstraction has 211306 states and 308038 transitions. [2019-09-10 06:13:03,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:13:03,244 INFO L276 IsEmpty]: Start isEmpty. Operand 211306 states and 308038 transitions. [2019-09-10 06:13:03,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-10 06:13:03,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:03,276 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:03,276 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:03,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:03,276 INFO L82 PathProgramCache]: Analyzing trace with hash 306575255, now seen corresponding path program 1 times [2019-09-10 06:13:03,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:03,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:03,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:03,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:03,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:03,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:03,445 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 06:13:03,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:03,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:13:03,446 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:03,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:13:03,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:13:03,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:13:03,450 INFO L87 Difference]: Start difference. First operand 211306 states and 308038 transitions. Second operand 5 states. [2019-09-10 06:13:04,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:04,612 INFO L93 Difference]: Finished difference Result 366892 states and 542863 transitions. [2019-09-10 06:13:04,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:13:04,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 174 [2019-09-10 06:13:04,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:06,239 INFO L225 Difference]: With dead ends: 366892 [2019-09-10 06:13:06,239 INFO L226 Difference]: Without dead ends: 366892 [2019-09-10 06:13:06,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:13:06,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366892 states. [2019-09-10 06:13:15,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366892 to 342322. [2019-09-10 06:13:15,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342322 states. [2019-09-10 06:13:16,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342322 states to 342322 states and 505660 transitions. [2019-09-10 06:13:16,522 INFO L78 Accepts]: Start accepts. Automaton has 342322 states and 505660 transitions. Word has length 174 [2019-09-10 06:13:16,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:16,522 INFO L475 AbstractCegarLoop]: Abstraction has 342322 states and 505660 transitions. [2019-09-10 06:13:16,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:13:16,522 INFO L276 IsEmpty]: Start isEmpty. Operand 342322 states and 505660 transitions. [2019-09-10 06:13:16,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-10 06:13:16,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:16,553 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:16,553 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:16,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:16,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1590655826, now seen corresponding path program 1 times [2019-09-10 06:13:16,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:16,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:16,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:16,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:16,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:16,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:16,992 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 06:13:16,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:16,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 06:13:16,993 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:16,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 06:13:16,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 06:13:16,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:13:16,994 INFO L87 Difference]: Start difference. First operand 342322 states and 505660 transitions. Second operand 14 states. [2019-09-10 06:13:29,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:29,961 INFO L93 Difference]: Finished difference Result 1103160 states and 1640744 transitions. [2019-09-10 06:13:29,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 06:13:29,961 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 174 [2019-09-10 06:13:29,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:31,545 INFO L225 Difference]: With dead ends: 1103160 [2019-09-10 06:13:31,545 INFO L226 Difference]: Without dead ends: 1103160 [2019-09-10 06:13:31,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=235, Invalid=695, Unknown=0, NotChecked=0, Total=930 [2019-09-10 06:13:32,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103160 states. [2019-09-10 06:13:40,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103160 to 347100. [2019-09-10 06:13:40,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347100 states. [2019-09-10 06:13:42,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347100 states to 347100 states and 511174 transitions. [2019-09-10 06:13:42,241 INFO L78 Accepts]: Start accepts. Automaton has 347100 states and 511174 transitions. Word has length 174 [2019-09-10 06:13:42,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:42,241 INFO L475 AbstractCegarLoop]: Abstraction has 347100 states and 511174 transitions. [2019-09-10 06:13:42,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 06:13:42,241 INFO L276 IsEmpty]: Start isEmpty. Operand 347100 states and 511174 transitions. [2019-09-10 06:13:42,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-10 06:13:42,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:42,276 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:42,276 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:42,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:42,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1437603277, now seen corresponding path program 1 times [2019-09-10 06:13:42,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:42,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:42,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:42,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:42,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:42,419 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 06:13:42,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:42,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:13:42,420 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:42,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:13:42,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:13:42,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:13:42,422 INFO L87 Difference]: Start difference. First operand 347100 states and 511174 transitions. Second operand 4 states. [2019-09-10 06:13:43,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:43,441 INFO L93 Difference]: Finished difference Result 310198 states and 455118 transitions. [2019-09-10 06:13:43,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:13:43,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-09-10 06:13:43,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:43,901 INFO L225 Difference]: With dead ends: 310198 [2019-09-10 06:13:43,902 INFO L226 Difference]: Without dead ends: 310198 [2019-09-10 06:13:43,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:13:44,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310198 states. [2019-09-10 06:13:49,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310198 to 310118. [2019-09-10 06:13:49,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310118 states. [2019-09-10 06:13:57,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310118 states to 310118 states and 455027 transitions. [2019-09-10 06:13:57,967 INFO L78 Accepts]: Start accepts. Automaton has 310118 states and 455027 transitions. Word has length 174 [2019-09-10 06:13:57,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:57,968 INFO L475 AbstractCegarLoop]: Abstraction has 310118 states and 455027 transitions. [2019-09-10 06:13:57,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:13:57,968 INFO L276 IsEmpty]: Start isEmpty. Operand 310118 states and 455027 transitions. [2019-09-10 06:13:58,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 06:13:58,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:58,001 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:58,001 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:58,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:58,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1621376446, now seen corresponding path program 1 times [2019-09-10 06:13:58,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:58,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:58,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:58,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:58,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:58,230 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 06:13:58,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:58,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:13:58,231 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:58,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:13:58,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:13:58,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:13:58,232 INFO L87 Difference]: Start difference. First operand 310118 states and 455027 transitions. Second operand 9 states. [2019-09-10 06:13:59,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:59,275 INFO L93 Difference]: Finished difference Result 310120 states and 453420 transitions. [2019-09-10 06:13:59,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:13:59,275 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 176 [2019-09-10 06:13:59,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:59,791 INFO L225 Difference]: With dead ends: 310120 [2019-09-10 06:13:59,792 INFO L226 Difference]: Without dead ends: 310120 [2019-09-10 06:13:59,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:14:00,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310120 states. [2019-09-10 06:14:06,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310120 to 137046. [2019-09-10 06:14:06,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137046 states. [2019-09-10 06:14:06,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137046 states to 137046 states and 195602 transitions. [2019-09-10 06:14:06,555 INFO L78 Accepts]: Start accepts. Automaton has 137046 states and 195602 transitions. Word has length 176 [2019-09-10 06:14:06,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:06,555 INFO L475 AbstractCegarLoop]: Abstraction has 137046 states and 195602 transitions. [2019-09-10 06:14:06,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:14:06,556 INFO L276 IsEmpty]: Start isEmpty. Operand 137046 states and 195602 transitions. [2019-09-10 06:14:06,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 06:14:06,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:06,579 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:14:06,579 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:06,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:06,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1300815465, now seen corresponding path program 1 times [2019-09-10 06:14:06,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:06,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:06,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:06,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:06,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:06,706 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 06:14:06,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:06,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:14:06,707 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:06,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:14:06,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:14:06,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:14:06,708 INFO L87 Difference]: Start difference. First operand 137046 states and 195602 transitions. Second operand 4 states. [2019-09-10 06:14:07,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:07,611 INFO L93 Difference]: Finished difference Result 137368 states and 195953 transitions. [2019-09-10 06:14:07,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:14:07,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-09-10 06:14:07,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:07,777 INFO L225 Difference]: With dead ends: 137368 [2019-09-10 06:14:07,777 INFO L226 Difference]: Without dead ends: 137368 [2019-09-10 06:14:07,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:14:07,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137368 states. [2019-09-10 06:14:09,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137368 to 137205. [2019-09-10 06:14:09,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137205 states. [2019-09-10 06:14:09,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137205 states to 137205 states and 195770 transitions. [2019-09-10 06:14:09,556 INFO L78 Accepts]: Start accepts. Automaton has 137205 states and 195770 transitions. Word has length 176 [2019-09-10 06:14:09,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:09,556 INFO L475 AbstractCegarLoop]: Abstraction has 137205 states and 195770 transitions. [2019-09-10 06:14:09,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:14:09,556 INFO L276 IsEmpty]: Start isEmpty. Operand 137205 states and 195770 transitions. [2019-09-10 06:14:09,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-10 06:14:09,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:09,583 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:14:09,583 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:09,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:09,584 INFO L82 PathProgramCache]: Analyzing trace with hash -2121425679, now seen corresponding path program 1 times [2019-09-10 06:14:09,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:09,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:09,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:09,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:09,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:09,645 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 06:14:09,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:09,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:14:09,645 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:09,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:14:09,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:14:09,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:09,646 INFO L87 Difference]: Start difference. First operand 137205 states and 195770 transitions. Second operand 3 states. [2019-09-10 06:14:10,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:10,188 INFO L93 Difference]: Finished difference Result 274208 states and 391300 transitions. [2019-09-10 06:14:10,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:10,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-09-10 06:14:10,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:10,575 INFO L225 Difference]: With dead ends: 274208 [2019-09-10 06:14:10,575 INFO L226 Difference]: Without dead ends: 274208 [2019-09-10 06:14:10,576 INFO L628 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-10 06:14:10,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274208 states. [2019-09-10 06:14:16,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274208 to 137215. [2019-09-10 06:14:16,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137215 states. [2019-09-10 06:14:16,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137215 states to 137215 states and 195780 transitions. [2019-09-10 06:14:16,593 INFO L78 Accepts]: Start accepts. Automaton has 137215 states and 195780 transitions. Word has length 177 [2019-09-10 06:14:16,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:16,594 INFO L475 AbstractCegarLoop]: Abstraction has 137215 states and 195780 transitions. [2019-09-10 06:14:16,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:16,594 INFO L276 IsEmpty]: Start isEmpty. Operand 137215 states and 195780 transitions. [2019-09-10 06:14:16,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 06:14:16,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:16,619 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:14:16,619 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:16,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:16,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1041013826, now seen corresponding path program 1 times [2019-09-10 06:14:16,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:16,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:16,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:16,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:16,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:16,794 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 06:14:16,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:16,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:14:16,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:16,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:14:16,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:14:16,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:14:16,796 INFO L87 Difference]: Start difference. First operand 137215 states and 195780 transitions. Second operand 6 states. [2019-09-10 06:14:18,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:18,035 INFO L93 Difference]: Finished difference Result 230021 states and 329040 transitions. [2019-09-10 06:14:18,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:14:18,036 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2019-09-10 06:14:18,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:18,366 INFO L225 Difference]: With dead ends: 230021 [2019-09-10 06:14:18,366 INFO L226 Difference]: Without dead ends: 230021 [2019-09-10 06:14:18,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:14:18,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230021 states. [2019-09-10 06:14:21,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230021 to 184396. [2019-09-10 06:14:21,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184396 states. [2019-09-10 06:14:21,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184396 states to 184396 states and 261239 transitions. [2019-09-10 06:14:21,665 INFO L78 Accepts]: Start accepts. Automaton has 184396 states and 261239 transitions. Word has length 178 [2019-09-10 06:14:21,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:21,665 INFO L475 AbstractCegarLoop]: Abstraction has 184396 states and 261239 transitions. [2019-09-10 06:14:21,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:14:21,665 INFO L276 IsEmpty]: Start isEmpty. Operand 184396 states and 261239 transitions. [2019-09-10 06:14:21,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 06:14:21,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:21,697 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:14:21,697 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:21,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:21,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1755730156, now seen corresponding path program 1 times [2019-09-10 06:14:21,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:21,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:21,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:21,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:21,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:21,831 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 06:14:21,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:21,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:14:21,832 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:21,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:14:21,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:14:21,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:14:21,833 INFO L87 Difference]: Start difference. First operand 184396 states and 261239 transitions. Second operand 4 states. [2019-09-10 06:14:22,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:22,410 INFO L93 Difference]: Finished difference Result 185078 states and 262001 transitions. [2019-09-10 06:14:22,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:14:22,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-09-10 06:14:22,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:22,633 INFO L225 Difference]: With dead ends: 185078 [2019-09-10 06:14:22,634 INFO L226 Difference]: Without dead ends: 185078 [2019-09-10 06:14:22,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:14:22,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185078 states. [2019-09-10 06:14:27,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185078 to 184733. [2019-09-10 06:14:27,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184733 states. [2019-09-10 06:14:27,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184733 states to 184733 states and 261596 transitions. [2019-09-10 06:14:27,811 INFO L78 Accepts]: Start accepts. Automaton has 184733 states and 261596 transitions. Word has length 178 [2019-09-10 06:14:27,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:27,812 INFO L475 AbstractCegarLoop]: Abstraction has 184733 states and 261596 transitions. [2019-09-10 06:14:27,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:14:27,812 INFO L276 IsEmpty]: Start isEmpty. Operand 184733 states and 261596 transitions. [2019-09-10 06:14:27,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 06:14:27,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:27,843 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:14:27,843 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:27,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:27,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1086702742, now seen corresponding path program 1 times [2019-09-10 06:14:27,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:27,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:27,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:27,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:27,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:27,952 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 06:14:27,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:27,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:14:27,952 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:27,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:14:27,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:14:27,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:14:27,954 INFO L87 Difference]: Start difference. First operand 184733 states and 261596 transitions. Second operand 4 states. [2019-09-10 06:14:28,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:28,569 INFO L93 Difference]: Finished difference Result 166127 states and 234926 transitions. [2019-09-10 06:14:28,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:14:28,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-09-10 06:14:28,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:28,829 INFO L225 Difference]: With dead ends: 166127 [2019-09-10 06:14:28,829 INFO L226 Difference]: Without dead ends: 166025 [2019-09-10 06:14:28,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:14:28,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166025 states. [2019-09-10 06:14:31,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166025 to 166025. [2019-09-10 06:14:31,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166025 states. [2019-09-10 06:14:32,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166025 states to 166025 states and 234824 transitions. [2019-09-10 06:14:32,710 INFO L78 Accepts]: Start accepts. Automaton has 166025 states and 234824 transitions. Word has length 178 [2019-09-10 06:14:32,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:32,710 INFO L475 AbstractCegarLoop]: Abstraction has 166025 states and 234824 transitions. [2019-09-10 06:14:32,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:14:32,711 INFO L276 IsEmpty]: Start isEmpty. Operand 166025 states and 234824 transitions. [2019-09-10 06:14:32,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:14:32,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:32,742 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, 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 06:14:32,742 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:32,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:32,743 INFO L82 PathProgramCache]: Analyzing trace with hash -395599266, now seen corresponding path program 1 times [2019-09-10 06:14:32,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:32,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:32,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:32,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:32,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:32,951 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 06:14:32,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:32,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:14:32,952 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:32,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:14:32,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:14:32,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:14:32,953 INFO L87 Difference]: Start difference. First operand 166025 states and 234824 transitions. Second operand 10 states. [2019-09-10 06:14:33,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:33,416 INFO L93 Difference]: Finished difference Result 125770 states and 177762 transitions. [2019-09-10 06:14:33,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:14:33,417 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 180 [2019-09-10 06:14:33,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:33,572 INFO L225 Difference]: With dead ends: 125770 [2019-09-10 06:14:33,572 INFO L226 Difference]: Without dead ends: 125770 [2019-09-10 06:14:33,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:14:33,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125770 states. [2019-09-10 06:14:37,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125770 to 92486. [2019-09-10 06:14:37,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92486 states. [2019-09-10 06:14:37,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92486 states to 92486 states and 129006 transitions. [2019-09-10 06:14:37,597 INFO L78 Accepts]: Start accepts. Automaton has 92486 states and 129006 transitions. Word has length 180 [2019-09-10 06:14:37,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:37,597 INFO L475 AbstractCegarLoop]: Abstraction has 92486 states and 129006 transitions. [2019-09-10 06:14:37,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:14:37,598 INFO L276 IsEmpty]: Start isEmpty. Operand 92486 states and 129006 transitions. [2019-09-10 06:14:37,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:14:37,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:37,614 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, 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 06:14:37,614 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:37,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:37,614 INFO L82 PathProgramCache]: Analyzing trace with hash -2078921565, now seen corresponding path program 1 times [2019-09-10 06:14:37,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:37,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:37,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:37,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:37,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:37,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:39,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:14:39,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:39,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 06:14:39,342 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:39,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 06:14:39,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 06:14:39,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:14:39,343 INFO L87 Difference]: Start difference. First operand 92486 states and 129006 transitions. Second operand 26 states. [2019-09-10 06:14:41,772 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 06:14:46,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:46,183 INFO L93 Difference]: Finished difference Result 152370 states and 214585 transitions. [2019-09-10 06:14:46,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 06:14:46,183 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 180 [2019-09-10 06:14:46,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:46,363 INFO L225 Difference]: With dead ends: 152370 [2019-09-10 06:14:46,363 INFO L226 Difference]: Without dead ends: 152370 [2019-09-10 06:14:46,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=462, Invalid=1890, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 06:14:46,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152370 states. [2019-09-10 06:14:47,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152370 to 93535. [2019-09-10 06:14:47,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93535 states. [2019-09-10 06:14:47,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93535 states to 93535 states and 130057 transitions. [2019-09-10 06:14:47,863 INFO L78 Accepts]: Start accepts. Automaton has 93535 states and 130057 transitions. Word has length 180 [2019-09-10 06:14:47,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:47,863 INFO L475 AbstractCegarLoop]: Abstraction has 93535 states and 130057 transitions. [2019-09-10 06:14:47,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 06:14:47,864 INFO L276 IsEmpty]: Start isEmpty. Operand 93535 states and 130057 transitions. [2019-09-10 06:14:47,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:14:47,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:47,884 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, 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 06:14:47,884 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:47,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:47,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1335076163, now seen corresponding path program 1 times [2019-09-10 06:14:47,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:47,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:47,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:47,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:47,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:49,320 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 06:14:49,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:49,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 06:14:49,320 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:49,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 06:14:49,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 06:14:49,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:14:49,321 INFO L87 Difference]: Start difference. First operand 93535 states and 130057 transitions. Second operand 23 states. [2019-09-10 06:14:50,080 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 34 [2019-09-10 06:14:50,518 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 34 [2019-09-10 06:14:50,698 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 30 [2019-09-10 06:14:51,225 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2019-09-10 06:14:51,416 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-09-10 06:14:52,036 WARN L188 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-09-10 06:14:52,310 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2019-09-10 06:14:53,021 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 60 [2019-09-10 06:14:53,251 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 50 [2019-09-10 06:14:53,497 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 49 [2019-09-10 06:14:53,658 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 32 [2019-09-10 06:14:53,864 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2019-09-10 06:14:54,003 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 32 [2019-09-10 06:14:54,236 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 50 [2019-09-10 06:14:54,487 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 47 [2019-09-10 06:14:54,893 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 45 [2019-09-10 06:14:55,073 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 36 [2019-09-10 06:14:55,264 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 45 [2019-09-10 06:14:55,423 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2019-09-10 06:14:55,733 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 36 [2019-09-10 06:14:56,264 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 45 [2019-09-10 06:14:57,668 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-09-10 06:14:59,300 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2019-09-10 06:15:00,630 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 47 [2019-09-10 06:15:00,863 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 34 [2019-09-10 06:15:00,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:00,960 INFO L93 Difference]: Finished difference Result 150557 states and 210999 transitions. [2019-09-10 06:15:00,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-10 06:15:00,960 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 180 [2019-09-10 06:15:00,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:01,146 INFO L225 Difference]: With dead ends: 150557 [2019-09-10 06:15:01,146 INFO L226 Difference]: Without dead ends: 150557 [2019-09-10 06:15:01,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=786, Invalid=2406, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 06:15:01,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150557 states. [2019-09-10 06:15:02,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150557 to 95321. [2019-09-10 06:15:02,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95321 states. [2019-09-10 06:15:02,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95321 states to 95321 states and 132116 transitions. [2019-09-10 06:15:02,248 INFO L78 Accepts]: Start accepts. Automaton has 95321 states and 132116 transitions. Word has length 180 [2019-09-10 06:15:02,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:02,248 INFO L475 AbstractCegarLoop]: Abstraction has 95321 states and 132116 transitions. [2019-09-10 06:15:02,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 06:15:02,248 INFO L276 IsEmpty]: Start isEmpty. Operand 95321 states and 132116 transitions. [2019-09-10 06:15:02,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:15:02,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:02,271 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, 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 06:15:02,272 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:02,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:02,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1924257678, now seen corresponding path program 1 times [2019-09-10 06:15:02,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:02,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:02,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:02,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:02,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:02,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:03,134 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 06:15:03,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:03,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 06:15:03,135 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:03,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 06:15:03,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 06:15:03,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:15:03,136 INFO L87 Difference]: Start difference. First operand 95321 states and 132116 transitions. Second operand 14 states. [2019-09-10 06:15:05,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:05,081 INFO L93 Difference]: Finished difference Result 192146 states and 269265 transitions. [2019-09-10 06:15:05,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:15:05,082 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 180 [2019-09-10 06:15:05,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:05,348 INFO L225 Difference]: With dead ends: 192146 [2019-09-10 06:15:05,348 INFO L226 Difference]: Without dead ends: 192146 [2019-09-10 06:15:05,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=220, Invalid=650, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:15:05,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192146 states. [2019-09-10 06:15:07,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192146 to 97419. [2019-09-10 06:15:07,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97419 states. [2019-09-10 06:15:07,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97419 states to 97419 states and 134274 transitions. [2019-09-10 06:15:07,510 INFO L78 Accepts]: Start accepts. Automaton has 97419 states and 134274 transitions. Word has length 180 [2019-09-10 06:15:07,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:07,510 INFO L475 AbstractCegarLoop]: Abstraction has 97419 states and 134274 transitions. [2019-09-10 06:15:07,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 06:15:07,510 INFO L276 IsEmpty]: Start isEmpty. Operand 97419 states and 134274 transitions. [2019-09-10 06:15:07,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:15:07,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:07,534 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, 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 06:15:07,534 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:07,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:07,535 INFO L82 PathProgramCache]: Analyzing trace with hash 462463886, now seen corresponding path program 1 times [2019-09-10 06:15:07,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:07,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:07,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:07,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:07,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:08,138 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 06:15:08,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:08,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:15:08,139 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:08,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:15:08,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:15:08,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:15:08,140 INFO L87 Difference]: Start difference. First operand 97419 states and 134274 transitions. Second operand 17 states. [2019-09-10 06:15:12,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:12,266 INFO L93 Difference]: Finished difference Result 291924 states and 410982 transitions. [2019-09-10 06:15:12,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 06:15:12,266 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 180 [2019-09-10 06:15:12,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:12,665 INFO L225 Difference]: With dead ends: 291924 [2019-09-10 06:15:12,665 INFO L226 Difference]: Without dead ends: 291597 [2019-09-10 06:15:12,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=547, Invalid=1709, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 06:15:12,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291597 states. [2019-09-10 06:15:15,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291597 to 109980. [2019-09-10 06:15:15,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109980 states. [2019-09-10 06:15:15,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109980 states to 109980 states and 148665 transitions. [2019-09-10 06:15:15,312 INFO L78 Accepts]: Start accepts. Automaton has 109980 states and 148665 transitions. Word has length 180 [2019-09-10 06:15:15,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:15,312 INFO L475 AbstractCegarLoop]: Abstraction has 109980 states and 148665 transitions. [2019-09-10 06:15:15,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:15:15,312 INFO L276 IsEmpty]: Start isEmpty. Operand 109980 states and 148665 transitions. [2019-09-10 06:15:15,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:15:15,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:15,344 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, 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 06:15:15,345 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:15,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:15,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1434767195, now seen corresponding path program 1 times [2019-09-10 06:15:15,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:15,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:15,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:15,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:15,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:16,990 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 06:15:16,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:16,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 06:15:16,991 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:16,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:15:16,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:15:16,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:15:16,992 INFO L87 Difference]: Start difference. First operand 109980 states and 148665 transitions. Second operand 22 states. [2019-09-10 06:15:18,097 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 44 [2019-09-10 06:15:18,608 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2019-09-10 06:15:23,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:23,048 INFO L93 Difference]: Finished difference Result 121930 states and 164887 transitions. [2019-09-10 06:15:23,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:15:23,048 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 180 [2019-09-10 06:15:23,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:23,170 INFO L225 Difference]: With dead ends: 121930 [2019-09-10 06:15:23,170 INFO L226 Difference]: Without dead ends: 121930 [2019-09-10 06:15:23,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=286, Invalid=974, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 06:15:23,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121930 states. [2019-09-10 06:15:24,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121930 to 110020. [2019-09-10 06:15:24,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110020 states. [2019-09-10 06:15:24,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110020 states to 110020 states and 148705 transitions. [2019-09-10 06:15:24,988 INFO L78 Accepts]: Start accepts. Automaton has 110020 states and 148705 transitions. Word has length 180 [2019-09-10 06:15:24,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:24,988 INFO L475 AbstractCegarLoop]: Abstraction has 110020 states and 148705 transitions. [2019-09-10 06:15:24,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:15:24,988 INFO L276 IsEmpty]: Start isEmpty. Operand 110020 states and 148705 transitions. [2019-09-10 06:15:25,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:15:25,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:25,019 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, 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 06:15:25,019 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:25,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:25,019 INFO L82 PathProgramCache]: Analyzing trace with hash 2144883336, now seen corresponding path program 1 times [2019-09-10 06:15:25,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:25,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:25,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:25,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:25,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:25,280 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 06:15:25,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:25,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 06:15:25,281 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:25,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:15:25,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:15:25,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:15:25,282 INFO L87 Difference]: Start difference. First operand 110020 states and 148705 transitions. Second operand 11 states. [2019-09-10 06:15:25,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:25,792 INFO L93 Difference]: Finished difference Result 103227 states and 140509 transitions. [2019-09-10 06:15:25,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:15:25,793 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 180 [2019-09-10 06:15:25,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:25,914 INFO L225 Difference]: With dead ends: 103227 [2019-09-10 06:15:25,914 INFO L226 Difference]: Without dead ends: 103227 [2019-09-10 06:15:25,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:15:25,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103227 states. [2019-09-10 06:15:26,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103227 to 82572. [2019-09-10 06:15:26,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82572 states. [2019-09-10 06:15:26,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82572 states to 82572 states and 110159 transitions. [2019-09-10 06:15:26,792 INFO L78 Accepts]: Start accepts. Automaton has 82572 states and 110159 transitions. Word has length 180 [2019-09-10 06:15:26,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:26,792 INFO L475 AbstractCegarLoop]: Abstraction has 82572 states and 110159 transitions. [2019-09-10 06:15:26,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:15:26,792 INFO L276 IsEmpty]: Start isEmpty. Operand 82572 states and 110159 transitions. [2019-09-10 06:15:26,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:15:26,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:26,818 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, 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 06:15:26,819 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:26,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:26,819 INFO L82 PathProgramCache]: Analyzing trace with hash 19841805, now seen corresponding path program 1 times [2019-09-10 06:15:26,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:26,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:26,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:26,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:26,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:28,780 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 06:15:28,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:28,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 06:15:28,780 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:28,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 06:15:28,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 06:15:28,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:15:28,781 INFO L87 Difference]: Start difference. First operand 82572 states and 110159 transitions. Second operand 23 states. [2019-09-10 06:15:29,464 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-09-10 06:15:29,784 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-09-10 06:15:30,263 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-09-10 06:15:30,530 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 06:15:30,708 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-10 06:15:31,257 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-09-10 06:15:31,649 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-09-10 06:15:32,052 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-09-10 06:15:32,716 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-09-10 06:15:33,182 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2019-09-10 06:15:33,547 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-09-10 06:15:33,855 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-09-10 06:15:34,112 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-09-10 06:15:34,482 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-09-10 06:15:34,839 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-09-10 06:15:35,576 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-09-10 06:15:36,177 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-10 06:15:36,504 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-09-10 06:15:39,495 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-10 06:15:39,658 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 06:15:40,416 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-09-10 06:15:40,730 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-09-10 06:15:41,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:41,517 INFO L93 Difference]: Finished difference Result 125615 states and 170730 transitions. [2019-09-10 06:15:41,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 06:15:41,517 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 180 [2019-09-10 06:15:41,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:41,641 INFO L225 Difference]: With dead ends: 125615 [2019-09-10 06:15:41,641 INFO L226 Difference]: Without dead ends: 125615 [2019-09-10 06:15:41,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=584, Invalid=1672, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 06:15:41,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125615 states. [2019-09-10 06:15:42,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125615 to 84338. [2019-09-10 06:15:42,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84338 states. [2019-09-10 06:15:42,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84338 states to 84338 states and 112148 transitions. [2019-09-10 06:15:42,578 INFO L78 Accepts]: Start accepts. Automaton has 84338 states and 112148 transitions. Word has length 180 [2019-09-10 06:15:42,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:42,578 INFO L475 AbstractCegarLoop]: Abstraction has 84338 states and 112148 transitions. [2019-09-10 06:15:42,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 06:15:42,578 INFO L276 IsEmpty]: Start isEmpty. Operand 84338 states and 112148 transitions. [2019-09-10 06:15:42,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:15:42,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:42,606 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, 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 06:15:42,606 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:42,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:42,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1767880124, now seen corresponding path program 1 times [2019-09-10 06:15:42,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:42,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:42,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:42,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:42,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:43,256 WARN L188 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2019-09-10 06:15:43,561 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 32 [2019-09-10 06:15:44,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:44,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:44,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 06:15:44,146 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:44,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 06:15:44,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 06:15:44,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:15:44,147 INFO L87 Difference]: Start difference. First operand 84338 states and 112148 transitions. Second operand 23 states. [2019-09-10 06:15:45,202 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2019-09-10 06:15:45,394 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2019-09-10 06:15:46,329 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 28 [2019-09-10 06:15:47,077 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 30 [2019-09-10 06:15:47,438 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 34 [2019-09-10 06:15:47,647 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 37 [2019-09-10 06:15:48,057 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2019-09-10 06:15:48,249 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 30 [2019-09-10 06:15:48,755 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2019-09-10 06:15:49,486 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2019-09-10 06:15:51,436 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 28 [2019-09-10 06:15:51,608 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2019-09-10 06:15:52,756 WARN L188 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 32 [2019-09-10 06:15:53,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:53,535 INFO L93 Difference]: Finished difference Result 121036 states and 162135 transitions. [2019-09-10 06:15:53,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 06:15:53,536 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 180 [2019-09-10 06:15:53,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:53,668 INFO L225 Difference]: With dead ends: 121036 [2019-09-10 06:15:53,668 INFO L226 Difference]: Without dead ends: 121036 [2019-09-10 06:15:53,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=595, Invalid=1955, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 06:15:53,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121036 states. [2019-09-10 06:15:54,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121036 to 87507. [2019-09-10 06:15:54,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87507 states. [2019-09-10 06:15:54,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87507 states to 87507 states and 115800 transitions. [2019-09-10 06:15:54,653 INFO L78 Accepts]: Start accepts. Automaton has 87507 states and 115800 transitions. Word has length 180 [2019-09-10 06:15:54,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:54,653 INFO L475 AbstractCegarLoop]: Abstraction has 87507 states and 115800 transitions. [2019-09-10 06:15:54,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 06:15:54,653 INFO L276 IsEmpty]: Start isEmpty. Operand 87507 states and 115800 transitions. [2019-09-10 06:15:54,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:15:54,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:54,685 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, 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 06:15:54,685 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:54,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:54,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1537335812, now seen corresponding path program 1 times [2019-09-10 06:15:54,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:54,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:54,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:54,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:54,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:55,105 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 06:15:55,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:55,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 06:15:55,106 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:55,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 06:15:55,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 06:15:55,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:15:55,107 INFO L87 Difference]: Start difference. First operand 87507 states and 115800 transitions. Second operand 14 states. [2019-09-10 06:15:59,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:59,646 INFO L93 Difference]: Finished difference Result 189543 states and 258417 transitions. [2019-09-10 06:15:59,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-10 06:15:59,646 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 180 [2019-09-10 06:15:59,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:59,850 INFO L225 Difference]: With dead ends: 189543 [2019-09-10 06:15:59,850 INFO L226 Difference]: Without dead ends: 189543 [2019-09-10 06:15:59,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=484, Invalid=1678, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 06:15:59,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189543 states. [2019-09-10 06:16:01,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189543 to 96293. [2019-09-10 06:16:01,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96293 states. [2019-09-10 06:16:01,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96293 states to 96293 states and 125960 transitions. [2019-09-10 06:16:01,922 INFO L78 Accepts]: Start accepts. Automaton has 96293 states and 125960 transitions. Word has length 180 [2019-09-10 06:16:01,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:01,923 INFO L475 AbstractCegarLoop]: Abstraction has 96293 states and 125960 transitions. [2019-09-10 06:16:01,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 06:16:01,923 INFO L276 IsEmpty]: Start isEmpty. Operand 96293 states and 125960 transitions. [2019-09-10 06:16:01,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:16:01,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:01,963 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, 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 06:16:01,964 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:01,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:01,964 INFO L82 PathProgramCache]: Analyzing trace with hash -458998880, now seen corresponding path program 1 times [2019-09-10 06:16:01,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:01,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:01,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:01,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:01,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:03,055 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2019-09-10 06:16:03,357 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 38 [2019-09-10 06:16:04,523 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 06:16:04,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:04,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 06:16:04,524 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:04,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 06:16:04,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 06:16:04,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:16:04,525 INFO L87 Difference]: Start difference. First operand 96293 states and 125960 transitions. Second operand 26 states. [2019-09-10 06:16:05,421 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 06:16:05,744 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-09-10 06:16:06,098 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-09-10 06:16:06,399 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-10 06:16:06,606 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 06:16:06,826 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 06:16:07,135 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 06:16:08,047 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2019-09-10 06:16:08,222 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2019-09-10 06:16:08,421 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 44 [2019-09-10 06:16:08,599 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 42 [2019-09-10 06:16:09,495 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2019-09-10 06:16:09,787 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-09-10 06:16:10,087 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 54 [2019-09-10 06:16:10,313 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 49 [2019-09-10 06:16:10,527 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 43 [2019-09-10 06:16:11,188 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2019-09-10 06:16:11,550 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 54 [2019-09-10 06:16:11,950 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2019-09-10 06:16:12,525 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-10 06:16:13,396 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2019-09-10 06:16:13,557 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 06:16:13,714 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 06:16:13,927 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 48 [2019-09-10 06:16:14,192 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 55 [2019-09-10 06:16:14,751 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2019-09-10 06:16:15,133 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 44 [2019-09-10 06:16:15,416 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 49 [2019-09-10 06:16:15,591 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 06:16:15,845 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 06:16:16,858 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 55 [2019-09-10 06:16:17,047 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-09-10 06:16:17,576 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 48 [2019-09-10 06:16:17,829 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 53 [2019-09-10 06:16:18,022 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 06:16:18,515 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 49 [2019-09-10 06:16:18,974 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 46 [2019-09-10 06:16:19,126 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 06:16:19,451 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 06:16:19,682 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 53 [2019-09-10 06:16:19,863 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 42 [2019-09-10 06:16:20,052 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-09-10 06:16:20,446 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 06:16:20,663 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-10 06:16:20,913 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 53 [2019-09-10 06:16:21,124 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 41 [2019-09-10 06:16:21,562 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 50 [2019-09-10 06:16:21,798 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2019-09-10 06:16:21,994 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-09-10 06:16:22,230 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 44 [2019-09-10 06:16:22,431 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 06:16:22,987 WARN L188 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 45 [2019-09-10 06:16:23,169 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 38 [2019-09-10 06:16:23,486 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 06:16:23,659 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2019-09-10 06:16:24,232 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 48 [2019-09-10 06:16:24,436 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 06:16:24,713 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 49 [2019-09-10 06:16:24,853 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 06:16:25,100 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2019-09-10 06:16:25,327 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 06:16:25,958 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 49 [2019-09-10 06:16:26,120 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 06:16:26,341 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 42 [2019-09-10 06:16:26,555 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 47 [2019-09-10 06:16:26,893 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 06:16:27,143 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 06:16:27,510 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 47 [2019-09-10 06:16:27,877 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 47 [2019-09-10 06:16:28,250 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 44 [2019-09-10 06:16:28,569 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 06:16:28,804 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 06:16:28,987 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 45 [2019-09-10 06:16:29,375 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 39 [2019-09-10 06:16:29,725 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 42 [2019-09-10 06:16:29,951 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 35 [2019-09-10 06:16:30,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:30,031 INFO L93 Difference]: Finished difference Result 159851 states and 212851 transitions. [2019-09-10 06:16:30,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-09-10 06:16:30,032 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 180 [2019-09-10 06:16:30,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:30,205 INFO L225 Difference]: With dead ends: 159851 [2019-09-10 06:16:30,205 INFO L226 Difference]: Without dead ends: 159851 [2019-09-10 06:16:30,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5461 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=2745, Invalid=13005, Unknown=0, NotChecked=0, Total=15750 [2019-09-10 06:16:30,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159851 states. [2019-09-10 06:16:31,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159851 to 98155. [2019-09-10 06:16:31,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98155 states. [2019-09-10 06:16:31,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98155 states to 98155 states and 128089 transitions. [2019-09-10 06:16:31,823 INFO L78 Accepts]: Start accepts. Automaton has 98155 states and 128089 transitions. Word has length 180 [2019-09-10 06:16:31,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:31,823 INFO L475 AbstractCegarLoop]: Abstraction has 98155 states and 128089 transitions. [2019-09-10 06:16:31,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 06:16:31,823 INFO L276 IsEmpty]: Start isEmpty. Operand 98155 states and 128089 transitions. [2019-09-10 06:16:31,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:16:31,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:31,863 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, 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 06:16:31,863 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:31,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:31,864 INFO L82 PathProgramCache]: Analyzing trace with hash 2053348196, now seen corresponding path program 1 times [2019-09-10 06:16:31,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:31,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:31,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:31,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:31,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:32,285 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 06:16:32,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:32,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:16:32,286 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:32,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:16:32,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:16:32,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:16:32,286 INFO L87 Difference]: Start difference. First operand 98155 states and 128089 transitions. Second operand 16 states. [2019-09-10 06:16:35,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:35,063 INFO L93 Difference]: Finished difference Result 208104 states and 278570 transitions. [2019-09-10 06:16:35,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 06:16:35,064 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 180 [2019-09-10 06:16:35,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:35,363 INFO L225 Difference]: With dead ends: 208104 [2019-09-10 06:16:35,364 INFO L226 Difference]: Without dead ends: 208104 [2019-09-10 06:16:35,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=309, Invalid=881, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 06:16:35,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208104 states. [2019-09-10 06:16:37,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208104 to 107653. [2019-09-10 06:16:37,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107653 states. [2019-09-10 06:16:37,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107653 states to 107653 states and 138845 transitions. [2019-09-10 06:16:37,611 INFO L78 Accepts]: Start accepts. Automaton has 107653 states and 138845 transitions. Word has length 180 [2019-09-10 06:16:37,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:37,611 INFO L475 AbstractCegarLoop]: Abstraction has 107653 states and 138845 transitions. [2019-09-10 06:16:37,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:16:37,611 INFO L276 IsEmpty]: Start isEmpty. Operand 107653 states and 138845 transitions. [2019-09-10 06:16:37,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:16:37,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:37,658 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, 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 06:16:37,658 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:37,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:37,658 INFO L82 PathProgramCache]: Analyzing trace with hash 306519167, now seen corresponding path program 1 times [2019-09-10 06:16:37,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:37,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:37,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:37,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:37,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:38,200 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 06:16:38,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:38,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:16:38,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:38,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:16:38,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:16:38,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:16:38,201 INFO L87 Difference]: Start difference. First operand 107653 states and 138845 transitions. Second operand 17 states. [2019-09-10 06:16:41,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:41,199 INFO L93 Difference]: Finished difference Result 157749 states and 205263 transitions. [2019-09-10 06:16:41,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 06:16:41,200 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 180 [2019-09-10 06:16:41,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:41,357 INFO L225 Difference]: With dead ends: 157749 [2019-09-10 06:16:41,357 INFO L226 Difference]: Without dead ends: 157749 [2019-09-10 06:16:41,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=362, Invalid=1044, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:16:41,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157749 states. [2019-09-10 06:16:42,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157749 to 115795. [2019-09-10 06:16:42,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115795 states. [2019-09-10 06:16:42,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115795 states to 115795 states and 147997 transitions. [2019-09-10 06:16:42,743 INFO L78 Accepts]: Start accepts. Automaton has 115795 states and 147997 transitions. Word has length 180 [2019-09-10 06:16:42,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:42,743 INFO L475 AbstractCegarLoop]: Abstraction has 115795 states and 147997 transitions. [2019-09-10 06:16:42,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:16:42,743 INFO L276 IsEmpty]: Start isEmpty. Operand 115795 states and 147997 transitions. [2019-09-10 06:16:42,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:16:42,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:42,799 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, 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 06:16:42,800 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:42,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:42,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1714400247, now seen corresponding path program 1 times [2019-09-10 06:16:42,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:42,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:42,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:42,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:42,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:44,483 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 06:16:44,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:44,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-10 06:16:44,483 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:44,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 06:16:44,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 06:16:44,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:16:44,484 INFO L87 Difference]: Start difference. First operand 115795 states and 147997 transitions. Second operand 24 states. [2019-09-10 06:16:49,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:49,527 INFO L93 Difference]: Finished difference Result 131110 states and 166973 transitions. [2019-09-10 06:16:49,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:16:49,527 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 180 [2019-09-10 06:16:49,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:49,644 INFO L225 Difference]: With dead ends: 131110 [2019-09-10 06:16:49,644 INFO L226 Difference]: Without dead ends: 129262 [2019-09-10 06:16:49,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=309, Invalid=1097, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:16:49,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129262 states. [2019-09-10 06:16:51,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129262 to 119402. [2019-09-10 06:16:51,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119402 states. [2019-09-10 06:16:51,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119402 states to 119402 states and 152057 transitions. [2019-09-10 06:16:51,328 INFO L78 Accepts]: Start accepts. Automaton has 119402 states and 152057 transitions. Word has length 180 [2019-09-10 06:16:51,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:51,328 INFO L475 AbstractCegarLoop]: Abstraction has 119402 states and 152057 transitions. [2019-09-10 06:16:51,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 06:16:51,328 INFO L276 IsEmpty]: Start isEmpty. Operand 119402 states and 152057 transitions. [2019-09-10 06:16:51,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:16:51,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:51,382 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, 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 06:16:51,382 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:51,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:51,383 INFO L82 PathProgramCache]: Analyzing trace with hash 2024552110, now seen corresponding path program 1 times [2019-09-10 06:16:51,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:51,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:51,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:51,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:51,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:52,878 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 06:16:52,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:52,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 06:16:52,879 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:52,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 06:16:52,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 06:16:52,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:16:52,880 INFO L87 Difference]: Start difference. First operand 119402 states and 152057 transitions. Second operand 23 states. [2019-09-10 06:16:53,827 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-09-10 06:16:53,996 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-10 06:16:54,189 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 06:16:54,422 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-10 06:16:54,660 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-10 06:16:54,848 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 44 [2019-09-10 06:16:55,407 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 06:16:55,967 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2019-09-10 06:16:56,169 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-09-10 06:16:56,920 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 43 [2019-09-10 06:16:57,101 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 38 [2019-09-10 06:16:57,288 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 43 [2019-09-10 06:16:57,463 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 38 [2019-09-10 06:16:57,750 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-09-10 06:16:57,938 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 45 [2019-09-10 06:16:58,113 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 43 [2019-09-10 06:16:58,357 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-09-10 06:16:58,557 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 40 [2019-09-10 06:16:58,707 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 38 [2019-09-10 06:16:58,922 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2019-09-10 06:16:59,240 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 43 [2019-09-10 06:16:59,489 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-09-10 06:16:59,666 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2019-09-10 06:17:02,977 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 40 [2019-09-10 06:17:03,785 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 42 [2019-09-10 06:17:04,016 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 40 [2019-09-10 06:17:04,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:04,242 INFO L93 Difference]: Finished difference Result 178053 states and 231946 transitions. [2019-09-10 06:17:04,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-10 06:17:04,242 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 180 [2019-09-10 06:17:04,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:04,417 INFO L225 Difference]: With dead ends: 178053 [2019-09-10 06:17:04,418 INFO L226 Difference]: Without dead ends: 178053 [2019-09-10 06:17:04,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=747, Invalid=2223, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 06:17:04,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178053 states. [2019-09-10 06:17:06,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178053 to 120762. [2019-09-10 06:17:06,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120762 states. [2019-09-10 06:17:06,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120762 states to 120762 states and 153617 transitions. [2019-09-10 06:17:06,507 INFO L78 Accepts]: Start accepts. Automaton has 120762 states and 153617 transitions. Word has length 180 [2019-09-10 06:17:06,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:06,507 INFO L475 AbstractCegarLoop]: Abstraction has 120762 states and 153617 transitions. [2019-09-10 06:17:06,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 06:17:06,508 INFO L276 IsEmpty]: Start isEmpty. Operand 120762 states and 153617 transitions. [2019-09-10 06:17:06,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 06:17:06,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:06,564 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, 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 06:17:06,565 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:06,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:06,565 INFO L82 PathProgramCache]: Analyzing trace with hash -778090378, now seen corresponding path program 1 times [2019-09-10 06:17:06,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:06,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:06,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:06,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:06,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:06,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:17:06,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:06,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:17:06,621 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:06,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:17:06,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:17:06,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:17:06,622 INFO L87 Difference]: Start difference. First operand 120762 states and 153617 transitions. Second operand 3 states. [2019-09-10 06:17:06,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:06,960 INFO L93 Difference]: Finished difference Result 126231 states and 163844 transitions. [2019-09-10 06:17:06,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:17:06,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-09-10 06:17:06,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:07,076 INFO L225 Difference]: With dead ends: 126231 [2019-09-10 06:17:07,076 INFO L226 Difference]: Without dead ends: 126231 [2019-09-10 06:17:07,077 INFO L628 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-10 06:17:07,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126231 states. [2019-09-10 06:17:08,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126231 to 106988. [2019-09-10 06:17:08,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106988 states. [2019-09-10 06:17:08,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106988 states to 106988 states and 136905 transitions. [2019-09-10 06:17:08,124 INFO L78 Accepts]: Start accepts. Automaton has 106988 states and 136905 transitions. Word has length 181 [2019-09-10 06:17:08,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:08,124 INFO L475 AbstractCegarLoop]: Abstraction has 106988 states and 136905 transitions. [2019-09-10 06:17:08,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:17:08,125 INFO L276 IsEmpty]: Start isEmpty. Operand 106988 states and 136905 transitions. [2019-09-10 06:17:08,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 06:17:08,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:08,171 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, 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 06:17:08,171 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:08,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:08,171 INFO L82 PathProgramCache]: Analyzing trace with hash 839595881, now seen corresponding path program 1 times [2019-09-10 06:17:08,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:08,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:08,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:08,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:08,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:08,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:17:08,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:08,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:17:08,232 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:08,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:17:08,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:17:08,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:17:08,233 INFO L87 Difference]: Start difference. First operand 106988 states and 136905 transitions. Second operand 3 states. [2019-09-10 06:17:08,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:08,498 INFO L93 Difference]: Finished difference Result 103258 states and 131667 transitions. [2019-09-10 06:17:08,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:17:08,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-09-10 06:17:08,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:08,593 INFO L225 Difference]: With dead ends: 103258 [2019-09-10 06:17:08,593 INFO L226 Difference]: Without dead ends: 103258 [2019-09-10 06:17:08,594 INFO L628 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-10 06:17:09,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103258 states. [2019-09-10 06:17:09,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103258 to 102296. [2019-09-10 06:17:09,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102296 states. [2019-09-10 06:17:09,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102296 states to 102296 states and 130705 transitions. [2019-09-10 06:17:09,902 INFO L78 Accepts]: Start accepts. Automaton has 102296 states and 130705 transitions. Word has length 181 [2019-09-10 06:17:09,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:09,903 INFO L475 AbstractCegarLoop]: Abstraction has 102296 states and 130705 transitions. [2019-09-10 06:17:09,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:17:09,903 INFO L276 IsEmpty]: Start isEmpty. Operand 102296 states and 130705 transitions. [2019-09-10 06:17:09,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 06:17:09,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:09,957 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, 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 06:17:09,957 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:09,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:09,957 INFO L82 PathProgramCache]: Analyzing trace with hash 2070664605, now seen corresponding path program 1 times [2019-09-10 06:17:09,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:09,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:09,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:09,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:09,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:10,007 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 06:17:10,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:10,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:17:10,008 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:10,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:17:10,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:17:10,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:17:10,009 INFO L87 Difference]: Start difference. First operand 102296 states and 130705 transitions. Second operand 3 states. [2019-09-10 06:17:10,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:10,280 INFO L93 Difference]: Finished difference Result 96638 states and 123469 transitions. [2019-09-10 06:17:10,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:17:10,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-09-10 06:17:10,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:10,368 INFO L225 Difference]: With dead ends: 96638 [2019-09-10 06:17:10,368 INFO L226 Difference]: Without dead ends: 96638 [2019-09-10 06:17:10,368 INFO L628 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-10 06:17:10,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96638 states. [2019-09-10 06:17:11,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96638 to 88747. [2019-09-10 06:17:11,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88747 states. [2019-09-10 06:17:11,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88747 states to 88747 states and 112730 transitions. [2019-09-10 06:17:11,677 INFO L78 Accepts]: Start accepts. Automaton has 88747 states and 112730 transitions. Word has length 181 [2019-09-10 06:17:11,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:11,677 INFO L475 AbstractCegarLoop]: Abstraction has 88747 states and 112730 transitions. [2019-09-10 06:17:11,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:17:11,678 INFO L276 IsEmpty]: Start isEmpty. Operand 88747 states and 112730 transitions. [2019-09-10 06:17:11,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 06:17:11,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:11,715 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, 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 06:17:11,715 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:11,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:11,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1458773602, now seen corresponding path program 1 times [2019-09-10 06:17:11,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:11,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:11,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:11,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:11,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:11,762 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 06:17:11,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:11,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:17:11,763 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:11,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:17:11,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:17:11,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:17:11,764 INFO L87 Difference]: Start difference. First operand 88747 states and 112730 transitions. Second operand 3 states. [2019-09-10 06:17:12,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:12,027 INFO L93 Difference]: Finished difference Result 86134 states and 111272 transitions. [2019-09-10 06:17:12,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:17:12,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-09-10 06:17:12,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:12,107 INFO L225 Difference]: With dead ends: 86134 [2019-09-10 06:17:12,107 INFO L226 Difference]: Without dead ends: 86134 [2019-09-10 06:17:12,107 INFO L628 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-10 06:17:12,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86134 states. [2019-09-10 06:17:12,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86134 to 76659. [2019-09-10 06:17:12,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76659 states. [2019-09-10 06:17:12,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76659 states to 76659 states and 98436 transitions. [2019-09-10 06:17:12,870 INFO L78 Accepts]: Start accepts. Automaton has 76659 states and 98436 transitions. Word has length 181 [2019-09-10 06:17:12,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:12,870 INFO L475 AbstractCegarLoop]: Abstraction has 76659 states and 98436 transitions. [2019-09-10 06:17:12,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:17:12,870 INFO L276 IsEmpty]: Start isEmpty. Operand 76659 states and 98436 transitions. [2019-09-10 06:17:12,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 06:17:12,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:12,896 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, 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 06:17:12,896 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:12,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:12,897 INFO L82 PathProgramCache]: Analyzing trace with hash -804202503, now seen corresponding path program 1 times [2019-09-10 06:17:12,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:12,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:12,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:12,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:12,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:12,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-10 06:17:12,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:12,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:17:12,943 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:12,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:17:12,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:17:12,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:17:12,944 INFO L87 Difference]: Start difference. First operand 76659 states and 98436 transitions. Second operand 3 states. [2019-09-10 06:17:13,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:13,155 INFO L93 Difference]: Finished difference Result 73347 states and 93882 transitions. [2019-09-10 06:17:13,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:17:13,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-09-10 06:17:13,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:13,227 INFO L225 Difference]: With dead ends: 73347 [2019-09-10 06:17:13,228 INFO L226 Difference]: Without dead ends: 73347 [2019-09-10 06:17:13,228 INFO L628 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-10 06:17:13,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73347 states. [2019-09-10 06:17:14,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73347 to 72425. [2019-09-10 06:17:14,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72425 states. [2019-09-10 06:17:14,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72425 states to 72425 states and 92960 transitions. [2019-09-10 06:17:14,191 INFO L78 Accepts]: Start accepts. Automaton has 72425 states and 92960 transitions. Word has length 181 [2019-09-10 06:17:14,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:14,191 INFO L475 AbstractCegarLoop]: Abstraction has 72425 states and 92960 transitions. [2019-09-10 06:17:14,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:17:14,191 INFO L276 IsEmpty]: Start isEmpty. Operand 72425 states and 92960 transitions. [2019-09-10 06:17:14,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 06:17:14,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:14,214 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, 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 06:17:14,214 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:14,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:14,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1096732473, now seen corresponding path program 1 times [2019-09-10 06:17:14,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:14,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:14,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:14,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:14,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:14,262 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 06:17:14,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:14,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:17:14,262 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:14,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:17:14,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:17:14,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:17:14,263 INFO L87 Difference]: Start difference. First operand 72425 states and 92960 transitions. Second operand 3 states. [2019-09-10 06:17:14,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:14,509 INFO L93 Difference]: Finished difference Result 71556 states and 92778 transitions. [2019-09-10 06:17:14,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:17:14,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-09-10 06:17:14,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:14,581 INFO L225 Difference]: With dead ends: 71556 [2019-09-10 06:17:14,581 INFO L226 Difference]: Without dead ends: 71250 [2019-09-10 06:17:14,582 INFO L628 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-10 06:17:14,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71250 states. [2019-09-10 06:17:15,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71250 to 57207. [2019-09-10 06:17:15,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57207 states. [2019-09-10 06:17:15,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57207 states to 57207 states and 73589 transitions. [2019-09-10 06:17:15,221 INFO L78 Accepts]: Start accepts. Automaton has 57207 states and 73589 transitions. Word has length 181 [2019-09-10 06:17:15,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:15,221 INFO L475 AbstractCegarLoop]: Abstraction has 57207 states and 73589 transitions. [2019-09-10 06:17:15,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:17:15,221 INFO L276 IsEmpty]: Start isEmpty. Operand 57207 states and 73589 transitions. [2019-09-10 06:17:15,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 06:17:15,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:15,242 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, 1, 1, 1, 1, 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 06:17:15,242 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:15,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:15,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1956751068, now seen corresponding path program 1 times [2019-09-10 06:17:15,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:15,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:15,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:15,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:15,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:15,299 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 06:17:15,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:15,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:17:15,299 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:15,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:17:15,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:17:15,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:17:15,300 INFO L87 Difference]: Start difference. First operand 57207 states and 73589 transitions. Second operand 3 states. [2019-09-10 06:17:15,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:15,430 INFO L93 Difference]: Finished difference Result 56177 states and 71860 transitions. [2019-09-10 06:17:15,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:17:15,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-09-10 06:17:15,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:15,484 INFO L225 Difference]: With dead ends: 56177 [2019-09-10 06:17:15,485 INFO L226 Difference]: Without dead ends: 56177 [2019-09-10 06:17:15,485 INFO L628 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-10 06:17:15,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56177 states. [2019-09-10 06:17:15,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56177 to 56175. [2019-09-10 06:17:15,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56175 states. [2019-09-10 06:17:16,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56175 states to 56175 states and 71859 transitions. [2019-09-10 06:17:16,005 INFO L78 Accepts]: Start accepts. Automaton has 56175 states and 71859 transitions. Word has length 185 [2019-09-10 06:17:16,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:16,005 INFO L475 AbstractCegarLoop]: Abstraction has 56175 states and 71859 transitions. [2019-09-10 06:17:16,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:17:16,005 INFO L276 IsEmpty]: Start isEmpty. Operand 56175 states and 71859 transitions. [2019-09-10 06:17:16,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 06:17:16,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:16,023 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, 1, 1, 1, 1, 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 06:17:16,023 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:16,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:16,023 INFO L82 PathProgramCache]: Analyzing trace with hash 544800700, now seen corresponding path program 1 times [2019-09-10 06:17:16,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:16,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:16,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:16,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:16,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:16,076 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 06:17:16,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:16,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:17:16,077 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:16,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:17:16,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:17:16,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:17:16,078 INFO L87 Difference]: Start difference. First operand 56175 states and 71859 transitions. Second operand 3 states. [2019-09-10 06:17:16,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:16,356 INFO L93 Difference]: Finished difference Result 53024 states and 67839 transitions. [2019-09-10 06:17:16,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:17:16,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-09-10 06:17:16,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:16,403 INFO L225 Difference]: With dead ends: 53024 [2019-09-10 06:17:16,403 INFO L226 Difference]: Without dead ends: 53024 [2019-09-10 06:17:16,403 INFO L628 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-10 06:17:16,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53024 states. [2019-09-10 06:17:16,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53024 to 52994. [2019-09-10 06:17:16,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52994 states. [2019-09-10 06:17:16,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52994 states to 52994 states and 67807 transitions. [2019-09-10 06:17:16,859 INFO L78 Accepts]: Start accepts. Automaton has 52994 states and 67807 transitions. Word has length 185 [2019-09-10 06:17:16,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:16,860 INFO L475 AbstractCegarLoop]: Abstraction has 52994 states and 67807 transitions. [2019-09-10 06:17:16,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:17:16,860 INFO L276 IsEmpty]: Start isEmpty. Operand 52994 states and 67807 transitions. [2019-09-10 06:17:16,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 06:17:16,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:16,875 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, 1, 1, 1, 1, 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 06:17:16,875 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:16,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:16,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1009480163, now seen corresponding path program 1 times [2019-09-10 06:17:16,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:16,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:16,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:16,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:16,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:16,927 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 06:17:16,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:16,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:17:16,927 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:16,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:17:16,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:17:16,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:17:16,928 INFO L87 Difference]: Start difference. First operand 52994 states and 67807 transitions. Second operand 3 states. [2019-09-10 06:17:17,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:17,035 INFO L93 Difference]: Finished difference Result 49562 states and 63319 transitions. [2019-09-10 06:17:17,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:17:17,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-09-10 06:17:17,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:17,077 INFO L225 Difference]: With dead ends: 49562 [2019-09-10 06:17:17,077 INFO L226 Difference]: Without dead ends: 49562 [2019-09-10 06:17:17,078 INFO L628 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-10 06:17:17,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49562 states. [2019-09-10 06:17:17,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49562 to 49524. [2019-09-10 06:17:17,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49524 states. [2019-09-10 06:17:17,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49524 states to 49524 states and 63281 transitions. [2019-09-10 06:17:17,485 INFO L78 Accepts]: Start accepts. Automaton has 49524 states and 63281 transitions. Word has length 185 [2019-09-10 06:17:17,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:17,485 INFO L475 AbstractCegarLoop]: Abstraction has 49524 states and 63281 transitions. [2019-09-10 06:17:17,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:17:17,485 INFO L276 IsEmpty]: Start isEmpty. Operand 49524 states and 63281 transitions. [2019-09-10 06:17:17,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 06:17:17,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:17,498 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, 1, 1, 1, 1, 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 06:17:17,499 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:17,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:17,499 INFO L82 PathProgramCache]: Analyzing trace with hash 2037982277, now seen corresponding path program 1 times [2019-09-10 06:17:17,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:17,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:17,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:17,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:17,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:17,550 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 06:17:17,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:17,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:17:17,550 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:17,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:17:17,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:17:17,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:17:17,551 INFO L87 Difference]: Start difference. First operand 49524 states and 63281 transitions. Second operand 3 states. [2019-09-10 06:17:17,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:17,651 INFO L93 Difference]: Finished difference Result 46548 states and 59438 transitions. [2019-09-10 06:17:17,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:17:17,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-09-10 06:17:17,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:17,692 INFO L225 Difference]: With dead ends: 46548 [2019-09-10 06:17:17,692 INFO L226 Difference]: Without dead ends: 46548 [2019-09-10 06:17:17,692 INFO L628 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-10 06:17:17,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46548 states. [2019-09-10 06:17:18,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46548 to 46432. [2019-09-10 06:17:18,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46432 states. [2019-09-10 06:17:18,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46432 states to 46432 states and 59312 transitions. [2019-09-10 06:17:18,080 INFO L78 Accepts]: Start accepts. Automaton has 46432 states and 59312 transitions. Word has length 185 [2019-09-10 06:17:18,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:18,080 INFO L475 AbstractCegarLoop]: Abstraction has 46432 states and 59312 transitions. [2019-09-10 06:17:18,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:17:18,080 INFO L276 IsEmpty]: Start isEmpty. Operand 46432 states and 59312 transitions. [2019-09-10 06:17:18,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 06:17:18,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:18,092 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, 1, 1, 1, 1, 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 06:17:18,092 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:18,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:18,093 INFO L82 PathProgramCache]: Analyzing trace with hash -2129337181, now seen corresponding path program 1 times [2019-09-10 06:17:18,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:18,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:18,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:18,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:18,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:18,139 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 06:17:18,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:18,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:17:18,139 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:18,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:17:18,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:17:18,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:17:18,140 INFO L87 Difference]: Start difference. First operand 46432 states and 59312 transitions. Second operand 3 states. [2019-09-10 06:17:18,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:18,390 INFO L93 Difference]: Finished difference Result 45300 states and 57554 transitions. [2019-09-10 06:17:18,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:17:18,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-09-10 06:17:18,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:18,430 INFO L225 Difference]: With dead ends: 45300 [2019-09-10 06:17:18,431 INFO L226 Difference]: Without dead ends: 45300 [2019-09-10 06:17:18,431 INFO L628 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-10 06:17:18,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45300 states. [2019-09-10 06:17:18,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45300 to 45298. [2019-09-10 06:17:18,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45298 states. [2019-09-10 06:17:18,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45298 states to 45298 states and 57553 transitions. [2019-09-10 06:17:18,816 INFO L78 Accepts]: Start accepts. Automaton has 45298 states and 57553 transitions. Word has length 185 [2019-09-10 06:17:18,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:18,817 INFO L475 AbstractCegarLoop]: Abstraction has 45298 states and 57553 transitions. [2019-09-10 06:17:18,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:17:18,817 INFO L276 IsEmpty]: Start isEmpty. Operand 45298 states and 57553 transitions. [2019-09-10 06:17:18,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 06:17:18,828 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:18,828 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, 1, 1, 1, 1, 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 06:17:18,828 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:18,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:18,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1641017664, now seen corresponding path program 1 times [2019-09-10 06:17:18,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:18,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:18,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:18,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:18,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:18,878 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 06:17:18,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:18,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:17:18,878 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:18,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:17:18,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:17:18,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:17:18,879 INFO L87 Difference]: Start difference. First operand 45298 states and 57553 transitions. Second operand 3 states. [2019-09-10 06:17:18,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:18,969 INFO L93 Difference]: Finished difference Result 40867 states and 51762 transitions. [2019-09-10 06:17:18,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:17:18,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-09-10 06:17:18,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:19,003 INFO L225 Difference]: With dead ends: 40867 [2019-09-10 06:17:19,003 INFO L226 Difference]: Without dead ends: 40867 [2019-09-10 06:17:19,003 INFO L628 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-10 06:17:19,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40867 states. [2019-09-10 06:17:19,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40867 to 40840. [2019-09-10 06:17:19,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40840 states. [2019-09-10 06:17:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40840 states to 40840 states and 51735 transitions. [2019-09-10 06:17:19,356 INFO L78 Accepts]: Start accepts. Automaton has 40840 states and 51735 transitions. Word has length 185 [2019-09-10 06:17:19,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:19,356 INFO L475 AbstractCegarLoop]: Abstraction has 40840 states and 51735 transitions. [2019-09-10 06:17:19,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:17:19,356 INFO L276 IsEmpty]: Start isEmpty. Operand 40840 states and 51735 transitions. [2019-09-10 06:17:19,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:17:19,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:19,367 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, 1, 1, 1, 1, 1, 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 06:17:19,367 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:19,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:19,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1769297636, now seen corresponding path program 1 times [2019-09-10 06:17:19,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:19,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:19,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:19,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:19,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:20,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:17:20,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:20,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 06:17:20,306 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:20,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:17:20,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:17:20,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:17:20,309 INFO L87 Difference]: Start difference. First operand 40840 states and 51735 transitions. Second operand 19 states. [2019-09-10 06:17:22,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:22,562 INFO L93 Difference]: Finished difference Result 58080 states and 75165 transitions. [2019-09-10 06:17:22,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 06:17:22,563 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 186 [2019-09-10 06:17:22,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:22,621 INFO L225 Difference]: With dead ends: 58080 [2019-09-10 06:17:22,622 INFO L226 Difference]: Without dead ends: 56892 [2019-09-10 06:17:22,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=228, Invalid=764, Unknown=0, NotChecked=0, Total=992 [2019-09-10 06:17:22,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56892 states. [2019-09-10 06:17:23,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56892 to 36162. [2019-09-10 06:17:23,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36162 states. [2019-09-10 06:17:23,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36162 states to 36162 states and 45699 transitions. [2019-09-10 06:17:23,199 INFO L78 Accepts]: Start accepts. Automaton has 36162 states and 45699 transitions. Word has length 186 [2019-09-10 06:17:23,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:23,199 INFO L475 AbstractCegarLoop]: Abstraction has 36162 states and 45699 transitions. [2019-09-10 06:17:23,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:17:23,199 INFO L276 IsEmpty]: Start isEmpty. Operand 36162 states and 45699 transitions. [2019-09-10 06:17:23,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:17:23,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:23,209 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, 1, 1, 1, 1, 1, 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 06:17:23,209 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:23,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:23,209 INFO L82 PathProgramCache]: Analyzing trace with hash 642553233, now seen corresponding path program 1 times [2019-09-10 06:17:23,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:23,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:23,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:23,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:23,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:23,986 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2019-09-10 06:17:24,827 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 06:17:24,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:24,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 06:17:24,828 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:24,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 06:17:24,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 06:17:24,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:17:24,829 INFO L87 Difference]: Start difference. First operand 36162 states and 45699 transitions. Second operand 25 states. [2019-09-10 06:17:25,034 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-10 06:17:25,672 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 06:17:25,847 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 06:17:26,129 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-10 06:17:26,344 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-09-10 06:17:31,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:31,289 INFO L93 Difference]: Finished difference Result 50603 states and 65633 transitions. [2019-09-10 06:17:31,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 06:17:31,289 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 186 [2019-09-10 06:17:31,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:31,337 INFO L225 Difference]: With dead ends: 50603 [2019-09-10 06:17:31,337 INFO L226 Difference]: Without dead ends: 50603 [2019-09-10 06:17:31,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=401, Invalid=2149, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 06:17:31,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50603 states. [2019-09-10 06:17:31,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50603 to 35921. [2019-09-10 06:17:31,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35921 states. [2019-09-10 06:17:31,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35921 states to 35921 states and 45354 transitions. [2019-09-10 06:17:31,846 INFO L78 Accepts]: Start accepts. Automaton has 35921 states and 45354 transitions. Word has length 186 [2019-09-10 06:17:31,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:31,846 INFO L475 AbstractCegarLoop]: Abstraction has 35921 states and 45354 transitions. [2019-09-10 06:17:31,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 06:17:31,846 INFO L276 IsEmpty]: Start isEmpty. Operand 35921 states and 45354 transitions. [2019-09-10 06:17:31,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:17:31,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:31,855 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, 1, 1, 1, 1, 1, 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 06:17:31,855 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:31,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:31,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1754829050, now seen corresponding path program 1 times [2019-09-10 06:17:31,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:31,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:31,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:31,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:31,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:31,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:32,504 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 39 [2019-09-10 06:17:32,888 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 32 [2019-09-10 06:17:33,808 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 06:17:33,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:33,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 06:17:33,808 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:33,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 06:17:33,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 06:17:33,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:17:33,809 INFO L87 Difference]: Start difference. First operand 35921 states and 45354 transitions. Second operand 26 states. [2019-09-10 06:17:34,489 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 06:17:34,669 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 06:17:34,991 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-10 06:17:35,268 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-09-10 06:17:35,664 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2019-09-10 06:17:35,890 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 06:17:36,547 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 06:17:39,562 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-10 06:17:39,723 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-10 06:17:41,253 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 41 [2019-09-10 06:17:42,352 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-09-10 06:17:42,663 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-10 06:17:43,109 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 38 [2019-09-10 06:17:43,559 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-10 06:17:44,427 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 38 [2019-09-10 06:17:45,637 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 06:17:45,799 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-09-10 06:17:46,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:46,742 INFO L93 Difference]: Finished difference Result 51325 states and 66523 transitions. [2019-09-10 06:17:46,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-10 06:17:46,743 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 186 [2019-09-10 06:17:46,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:46,793 INFO L225 Difference]: With dead ends: 51325 [2019-09-10 06:17:46,793 INFO L226 Difference]: Without dead ends: 51325 [2019-09-10 06:17:46,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1259 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=799, Invalid=4457, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 06:17:46,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51325 states. [2019-09-10 06:17:47,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51325 to 35185. [2019-09-10 06:17:47,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35185 states. [2019-09-10 06:17:47,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35185 states to 35185 states and 44349 transitions. [2019-09-10 06:17:47,170 INFO L78 Accepts]: Start accepts. Automaton has 35185 states and 44349 transitions. Word has length 186 [2019-09-10 06:17:47,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:47,170 INFO L475 AbstractCegarLoop]: Abstraction has 35185 states and 44349 transitions. [2019-09-10 06:17:47,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 06:17:47,171 INFO L276 IsEmpty]: Start isEmpty. Operand 35185 states and 44349 transitions. [2019-09-10 06:17:47,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:17:47,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:47,180 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, 1, 1, 1, 1, 1, 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 06:17:47,180 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:47,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:47,181 INFO L82 PathProgramCache]: Analyzing trace with hash -283829515, now seen corresponding path program 1 times [2019-09-10 06:17:47,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:47,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:47,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:47,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:47,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:48,339 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-09-10 06:17:49,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:17:49,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:49,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2019-09-10 06:17:49,288 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:49,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 06:17:49,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 06:17:49,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=897, Unknown=0, NotChecked=0, Total=992 [2019-09-10 06:17:49,289 INFO L87 Difference]: Start difference. First operand 35185 states and 44349 transitions. Second operand 32 states. [2019-09-10 06:17:50,970 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-10 06:17:52,328 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 06:17:52,503 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 06:17:53,178 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-09-10 06:17:53,443 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-09-10 06:17:54,091 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 71 [2019-09-10 06:17:56,134 WARN L188 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 120 DAG size of output: 97 [2019-09-10 06:17:59,625 WARN L188 SmtUtils]: Spent 3.26 s on a formula simplification. DAG size of input: 142 DAG size of output: 99 [2019-09-10 06:18:03,463 WARN L188 SmtUtils]: Spent 3.71 s on a formula simplification. DAG size of input: 151 DAG size of output: 109 [2019-09-10 06:18:03,728 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2019-09-10 06:18:03,983 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 06:18:04,828 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-09-10 06:18:05,130 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2019-09-10 06:18:05,587 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2019-09-10 06:18:05,850 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 06:18:06,126 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-10 06:18:06,375 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 06:18:07,055 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-09-10 06:18:07,314 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 51 [2019-09-10 06:18:07,515 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-10 06:18:09,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:09,892 INFO L93 Difference]: Finished difference Result 59066 states and 76983 transitions. [2019-09-10 06:18:09,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 06:18:09,892 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 186 [2019-09-10 06:18:09,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:09,949 INFO L225 Difference]: With dead ends: 59066 [2019-09-10 06:18:09,949 INFO L226 Difference]: Without dead ends: 59062 [2019-09-10 06:18:09,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=765, Invalid=2895, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 06:18:09,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59062 states. [2019-09-10 06:18:10,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59062 to 35208. [2019-09-10 06:18:10,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35208 states. [2019-09-10 06:18:10,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35208 states to 35208 states and 44374 transitions. [2019-09-10 06:18:10,363 INFO L78 Accepts]: Start accepts. Automaton has 35208 states and 44374 transitions. Word has length 186 [2019-09-10 06:18:10,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:10,363 INFO L475 AbstractCegarLoop]: Abstraction has 35208 states and 44374 transitions. [2019-09-10 06:18:10,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 06:18:10,363 INFO L276 IsEmpty]: Start isEmpty. Operand 35208 states and 44374 transitions. [2019-09-10 06:18:10,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:18:10,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:10,373 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, 1, 1, 1, 1, 1, 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 06:18:10,373 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:10,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:10,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1324096555, now seen corresponding path program 1 times [2019-09-10 06:18:10,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:10,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:10,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:10,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:10,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:10,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:10,810 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 06:18:10,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:10,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 06:18:10,811 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:10,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:18:10,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:18:10,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:18:10,812 INFO L87 Difference]: Start difference. First operand 35208 states and 44374 transitions. Second operand 13 states. [2019-09-10 06:18:12,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:12,331 INFO L93 Difference]: Finished difference Result 36570 states and 46026 transitions. [2019-09-10 06:18:12,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:18:12,331 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 186 [2019-09-10 06:18:12,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:12,363 INFO L225 Difference]: With dead ends: 36570 [2019-09-10 06:18:12,364 INFO L226 Difference]: Without dead ends: 36570 [2019-09-10 06:18:12,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:18:12,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36570 states. [2019-09-10 06:18:12,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36570 to 34574. [2019-09-10 06:18:12,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34574 states. [2019-09-10 06:18:12,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34574 states to 34574 states and 43298 transitions. [2019-09-10 06:18:12,682 INFO L78 Accepts]: Start accepts. Automaton has 34574 states and 43298 transitions. Word has length 186 [2019-09-10 06:18:12,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:12,682 INFO L475 AbstractCegarLoop]: Abstraction has 34574 states and 43298 transitions. [2019-09-10 06:18:12,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:18:12,682 INFO L276 IsEmpty]: Start isEmpty. Operand 34574 states and 43298 transitions. [2019-09-10 06:18:12,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:18:12,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:12,693 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, 1, 1, 1, 1, 1, 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 06:18:12,693 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:12,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:12,693 INFO L82 PathProgramCache]: Analyzing trace with hash -499577461, now seen corresponding path program 1 times [2019-09-10 06:18:12,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:12,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:12,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:12,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:12,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:13,489 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 06:18:13,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:13,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 06:18:13,489 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:13,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 06:18:13,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 06:18:13,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:18:13,490 INFO L87 Difference]: Start difference. First operand 34574 states and 43298 transitions. Second operand 20 states. [2019-09-10 06:18:13,644 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2019-09-10 06:18:18,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:18,678 INFO L93 Difference]: Finished difference Result 45051 states and 57810 transitions. [2019-09-10 06:18:18,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:18:18,678 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 186 [2019-09-10 06:18:18,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:18,716 INFO L225 Difference]: With dead ends: 45051 [2019-09-10 06:18:18,716 INFO L226 Difference]: Without dead ends: 44766 [2019-09-10 06:18:18,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=269, Invalid=1063, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 06:18:18,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44766 states. [2019-09-10 06:18:19,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44766 to 33358. [2019-09-10 06:18:19,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33358 states. [2019-09-10 06:18:19,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33358 states to 33358 states and 41742 transitions. [2019-09-10 06:18:19,152 INFO L78 Accepts]: Start accepts. Automaton has 33358 states and 41742 transitions. Word has length 186 [2019-09-10 06:18:19,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:19,152 INFO L475 AbstractCegarLoop]: Abstraction has 33358 states and 41742 transitions. [2019-09-10 06:18:19,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 06:18:19,153 INFO L276 IsEmpty]: Start isEmpty. Operand 33358 states and 41742 transitions. [2019-09-10 06:18:19,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:18:19,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:19,162 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, 1, 1, 1, 1, 1, 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 06:18:19,162 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:19,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:19,162 INFO L82 PathProgramCache]: Analyzing trace with hash -819075921, now seen corresponding path program 1 times [2019-09-10 06:18:19,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:19,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:19,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:19,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:19,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:20,280 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 06:18:20,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:20,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 06:18:20,281 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:20,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 06:18:20,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 06:18:20,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:18:20,282 INFO L87 Difference]: Start difference. First operand 33358 states and 41742 transitions. Second operand 25 states. [2019-09-10 06:18:20,451 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-10 06:18:24,028 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-09-10 06:18:27,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:27,043 INFO L93 Difference]: Finished difference Result 45650 states and 58592 transitions. [2019-09-10 06:18:27,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 06:18:27,044 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 186 [2019-09-10 06:18:27,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:27,085 INFO L225 Difference]: With dead ends: 45650 [2019-09-10 06:18:27,086 INFO L226 Difference]: Without dead ends: 45650 [2019-09-10 06:18:27,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=587, Invalid=2065, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 06:18:27,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45650 states. [2019-09-10 06:18:27,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45650 to 33515. [2019-09-10 06:18:27,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33515 states. [2019-09-10 06:18:27,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33515 states to 33515 states and 41907 transitions. [2019-09-10 06:18:27,419 INFO L78 Accepts]: Start accepts. Automaton has 33515 states and 41907 transitions. Word has length 186 [2019-09-10 06:18:27,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:27,419 INFO L475 AbstractCegarLoop]: Abstraction has 33515 states and 41907 transitions. [2019-09-10 06:18:27,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 06:18:27,420 INFO L276 IsEmpty]: Start isEmpty. Operand 33515 states and 41907 transitions. [2019-09-10 06:18:27,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:18:27,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:27,429 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, 1, 1, 1, 1, 1, 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 06:18:27,429 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:27,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:27,429 INFO L82 PathProgramCache]: Analyzing trace with hash -2005975935, now seen corresponding path program 1 times [2019-09-10 06:18:27,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:27,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:27,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:27,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:27,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:27,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:28,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:28,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:28,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-10 06:18:28,792 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:28,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 06:18:28,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 06:18:28,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2019-09-10 06:18:28,793 INFO L87 Difference]: Start difference. First operand 33515 states and 41907 transitions. Second operand 28 states. [2019-09-10 06:18:29,034 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-09-10 06:18:30,395 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-09-10 06:18:30,644 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-09-10 06:18:30,855 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-09-10 06:18:34,979 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-10 06:18:38,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:38,337 INFO L93 Difference]: Finished difference Result 43169 states and 55354 transitions. [2019-09-10 06:18:38,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 06:18:38,338 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 186 [2019-09-10 06:18:38,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:38,381 INFO L225 Difference]: With dead ends: 43169 [2019-09-10 06:18:38,381 INFO L226 Difference]: Without dead ends: 43169 [2019-09-10 06:18:38,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=495, Invalid=2697, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 06:18:38,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43169 states. [2019-09-10 06:18:38,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43169 to 32148. [2019-09-10 06:18:38,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32148 states. [2019-09-10 06:18:38,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32148 states to 32148 states and 40082 transitions. [2019-09-10 06:18:38,938 INFO L78 Accepts]: Start accepts. Automaton has 32148 states and 40082 transitions. Word has length 186 [2019-09-10 06:18:38,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:38,938 INFO L475 AbstractCegarLoop]: Abstraction has 32148 states and 40082 transitions. [2019-09-10 06:18:38,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 06:18:38,938 INFO L276 IsEmpty]: Start isEmpty. Operand 32148 states and 40082 transitions. [2019-09-10 06:18:38,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:18:38,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:38,948 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, 1, 1, 1, 1, 1, 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 06:18:38,949 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:38,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:38,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1487136155, now seen corresponding path program 1 times [2019-09-10 06:18:38,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:38,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:38,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:38,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:38,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:39,376 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 06:18:39,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:39,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 06:18:39,376 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:39,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:18:39,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:18:39,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:18:39,377 INFO L87 Difference]: Start difference. First operand 32148 states and 40082 transitions. Second operand 21 states. [2019-09-10 06:18:44,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:44,984 INFO L93 Difference]: Finished difference Result 39865 states and 50112 transitions. [2019-09-10 06:18:44,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-10 06:18:44,985 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 186 [2019-09-10 06:18:44,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:45,024 INFO L225 Difference]: With dead ends: 39865 [2019-09-10 06:18:45,024 INFO L226 Difference]: Without dead ends: 39865 [2019-09-10 06:18:45,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 995 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=860, Invalid=3430, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 06:18:45,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39865 states. [2019-09-10 06:18:45,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39865 to 32894. [2019-09-10 06:18:45,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32894 states. [2019-09-10 06:18:45,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32894 states to 32894 states and 40867 transitions. [2019-09-10 06:18:45,368 INFO L78 Accepts]: Start accepts. Automaton has 32894 states and 40867 transitions. Word has length 186 [2019-09-10 06:18:45,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:45,369 INFO L475 AbstractCegarLoop]: Abstraction has 32894 states and 40867 transitions. [2019-09-10 06:18:45,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:18:45,369 INFO L276 IsEmpty]: Start isEmpty. Operand 32894 states and 40867 transitions. [2019-09-10 06:18:45,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:18:45,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:45,380 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, 1, 1, 1, 1, 1, 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 06:18:45,380 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:45,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:45,381 INFO L82 PathProgramCache]: Analyzing trace with hash 526386546, now seen corresponding path program 1 times [2019-09-10 06:18:45,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:45,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:45,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:45,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:45,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:45,489 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 06:18:45,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:45,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:18:45,489 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:45,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:18:45,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:18:45,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:18:45,490 INFO L87 Difference]: Start difference. First operand 32894 states and 40867 transitions. Second operand 6 states. [2019-09-10 06:18:45,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:45,739 INFO L93 Difference]: Finished difference Result 41687 states and 53071 transitions. [2019-09-10 06:18:45,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:18:45,739 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 186 [2019-09-10 06:18:45,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:45,777 INFO L225 Difference]: With dead ends: 41687 [2019-09-10 06:18:45,777 INFO L226 Difference]: Without dead ends: 41687 [2019-09-10 06:18:45,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:18:45,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41687 states. [2019-09-10 06:18:46,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41687 to 33603. [2019-09-10 06:18:46,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33603 states. [2019-09-10 06:18:46,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33603 states to 33603 states and 41783 transitions. [2019-09-10 06:18:46,094 INFO L78 Accepts]: Start accepts. Automaton has 33603 states and 41783 transitions. Word has length 186 [2019-09-10 06:18:46,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:46,095 INFO L475 AbstractCegarLoop]: Abstraction has 33603 states and 41783 transitions. [2019-09-10 06:18:46,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:18:46,095 INFO L276 IsEmpty]: Start isEmpty. Operand 33603 states and 41783 transitions. [2019-09-10 06:18:46,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:18:46,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:46,266 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, 1, 1, 1, 1, 1, 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 06:18:46,266 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:46,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:46,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1096016762, now seen corresponding path program 1 times [2019-09-10 06:18:46,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:46,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:46,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:46,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:46,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:46,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:46,894 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 06:18:46,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:46,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 06:18:46,894 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:46,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:18:46,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:18:46,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:18:46,895 INFO L87 Difference]: Start difference. First operand 33603 states and 41783 transitions. Second operand 21 states. [2019-09-10 06:18:47,162 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 95 [2019-09-10 06:18:48,037 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 06:18:55,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:55,176 INFO L93 Difference]: Finished difference Result 67372 states and 87875 transitions. [2019-09-10 06:18:55,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-10 06:18:55,176 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 186 [2019-09-10 06:18:55,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:55,239 INFO L225 Difference]: With dead ends: 67372 [2019-09-10 06:18:55,239 INFO L226 Difference]: Without dead ends: 67372 [2019-09-10 06:18:55,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1156 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=740, Invalid=3682, Unknown=0, NotChecked=0, Total=4422 [2019-09-10 06:18:55,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67372 states. [2019-09-10 06:18:55,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67372 to 34144. [2019-09-10 06:18:55,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34144 states. [2019-09-10 06:18:55,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34144 states to 34144 states and 42334 transitions. [2019-09-10 06:18:55,666 INFO L78 Accepts]: Start accepts. Automaton has 34144 states and 42334 transitions. Word has length 186 [2019-09-10 06:18:55,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:55,667 INFO L475 AbstractCegarLoop]: Abstraction has 34144 states and 42334 transitions. [2019-09-10 06:18:55,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:18:55,667 INFO L276 IsEmpty]: Start isEmpty. Operand 34144 states and 42334 transitions. [2019-09-10 06:18:55,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:18:55,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:55,677 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, 1, 1, 1, 1, 1, 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 06:18:55,677 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:55,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:55,677 INFO L82 PathProgramCache]: Analyzing trace with hash 791030234, now seen corresponding path program 1 times [2019-09-10 06:18:55,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:55,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:55,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:55,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:55,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:56,281 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 06:18:56,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:56,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 06:18:56,281 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:56,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:18:56,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:18:56,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:18:56,282 INFO L87 Difference]: Start difference. First operand 34144 states and 42334 transitions. Second operand 18 states. [2019-09-10 06:18:59,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:59,702 INFO L93 Difference]: Finished difference Result 44665 states and 55769 transitions. [2019-09-10 06:18:59,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 06:18:59,703 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 186 [2019-09-10 06:18:59,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:59,743 INFO L225 Difference]: With dead ends: 44665 [2019-09-10 06:18:59,743 INFO L226 Difference]: Without dead ends: 44665 [2019-09-10 06:18:59,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=372, Invalid=1350, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 06:18:59,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44665 states. [2019-09-10 06:19:00,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44665 to 35326. [2019-09-10 06:19:00,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35326 states. [2019-09-10 06:19:00,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35326 states to 35326 states and 43550 transitions. [2019-09-10 06:19:00,083 INFO L78 Accepts]: Start accepts. Automaton has 35326 states and 43550 transitions. Word has length 186 [2019-09-10 06:19:00,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:00,083 INFO L475 AbstractCegarLoop]: Abstraction has 35326 states and 43550 transitions. [2019-09-10 06:19:00,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 06:19:00,083 INFO L276 IsEmpty]: Start isEmpty. Operand 35326 states and 43550 transitions. [2019-09-10 06:19:00,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:19:00,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:00,094 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, 1, 1, 1, 1, 1, 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 06:19:00,094 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:00,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:00,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1814745139, now seen corresponding path program 1 times [2019-09-10 06:19:00,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:00,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:00,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:00,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:00,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:00,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:00,856 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 06:19:00,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:00,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 06:19:00,857 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:00,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 06:19:00,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 06:19:00,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:19:00,857 INFO L87 Difference]: Start difference. First operand 35326 states and 43550 transitions. Second operand 25 states. [2019-09-10 06:19:06,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:06,121 INFO L93 Difference]: Finished difference Result 38227 states and 47110 transitions. [2019-09-10 06:19:06,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 06:19:06,121 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 186 [2019-09-10 06:19:06,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:06,150 INFO L225 Difference]: With dead ends: 38227 [2019-09-10 06:19:06,150 INFO L226 Difference]: Without dead ends: 38181 [2019-09-10 06:19:06,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=479, Invalid=1971, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 06:19:06,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38181 states. [2019-09-10 06:19:06,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38181 to 35806. [2019-09-10 06:19:06,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35806 states. [2019-09-10 06:19:06,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35806 states to 35806 states and 44037 transitions. [2019-09-10 06:19:06,441 INFO L78 Accepts]: Start accepts. Automaton has 35806 states and 44037 transitions. Word has length 186 [2019-09-10 06:19:06,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:06,441 INFO L475 AbstractCegarLoop]: Abstraction has 35806 states and 44037 transitions. [2019-09-10 06:19:06,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 06:19:06,441 INFO L276 IsEmpty]: Start isEmpty. Operand 35806 states and 44037 transitions. [2019-09-10 06:19:06,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:19:06,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:06,453 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, 1, 1, 1, 1, 1, 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 06:19:06,453 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:06,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:06,453 INFO L82 PathProgramCache]: Analyzing trace with hash 2089102764, now seen corresponding path program 1 times [2019-09-10 06:19:06,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:06,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:06,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:06,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:06,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:06,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-10 06:19:06,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:06,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:19:06,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:06,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:19:06,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:19:06,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:19:06,773 INFO L87 Difference]: Start difference. First operand 35806 states and 44037 transitions. Second operand 16 states. [2019-09-10 06:19:08,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:08,516 INFO L93 Difference]: Finished difference Result 36860 states and 45070 transitions. [2019-09-10 06:19:08,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 06:19:08,517 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 186 [2019-09-10 06:19:08,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:08,552 INFO L225 Difference]: With dead ends: 36860 [2019-09-10 06:19:08,552 INFO L226 Difference]: Without dead ends: 36642 [2019-09-10 06:19:08,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=178, Invalid=752, Unknown=0, NotChecked=0, Total=930 [2019-09-10 06:19:08,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36642 states. [2019-09-10 06:19:08,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36642 to 35180. [2019-09-10 06:19:08,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35180 states. [2019-09-10 06:19:08,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35180 states to 35180 states and 43366 transitions. [2019-09-10 06:19:08,883 INFO L78 Accepts]: Start accepts. Automaton has 35180 states and 43366 transitions. Word has length 186 [2019-09-10 06:19:08,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:08,883 INFO L475 AbstractCegarLoop]: Abstraction has 35180 states and 43366 transitions. [2019-09-10 06:19:08,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:19:08,883 INFO L276 IsEmpty]: Start isEmpty. Operand 35180 states and 43366 transitions. [2019-09-10 06:19:08,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:19:08,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:08,895 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, 1, 1, 1, 1, 1, 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 06:19:08,895 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:08,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:08,895 INFO L82 PathProgramCache]: Analyzing trace with hash -716579492, now seen corresponding path program 1 times [2019-09-10 06:19:08,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:08,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:08,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:08,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:08,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:09,012 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 06:19:09,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:09,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:19:09,012 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:09,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:19:09,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:19:09,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:19:09,013 INFO L87 Difference]: Start difference. First operand 35180 states and 43366 transitions. Second operand 6 states. [2019-09-10 06:19:09,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:09,283 INFO L93 Difference]: Finished difference Result 42754 states and 53822 transitions. [2019-09-10 06:19:09,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:19:09,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 186 [2019-09-10 06:19:09,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:09,325 INFO L225 Difference]: With dead ends: 42754 [2019-09-10 06:19:09,325 INFO L226 Difference]: Without dead ends: 42754 [2019-09-10 06:19:09,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:19:09,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42754 states. [2019-09-10 06:19:09,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42754 to 34348. [2019-09-10 06:19:09,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34348 states. [2019-09-10 06:19:09,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34348 states to 34348 states and 42140 transitions. [2019-09-10 06:19:09,673 INFO L78 Accepts]: Start accepts. Automaton has 34348 states and 42140 transitions. Word has length 186 [2019-09-10 06:19:09,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:09,674 INFO L475 AbstractCegarLoop]: Abstraction has 34348 states and 42140 transitions. [2019-09-10 06:19:09,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:19:09,674 INFO L276 IsEmpty]: Start isEmpty. Operand 34348 states and 42140 transitions. [2019-09-10 06:19:09,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:19:09,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:09,685 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, 1, 1, 1, 1, 1, 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 06:19:09,686 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:09,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:09,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1802593682, now seen corresponding path program 1 times [2019-09-10 06:19:09,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:09,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:09,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:09,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:09,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:09,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:10,044 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 06:19:10,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:10,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 06:19:10,045 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:10,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:19:10,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:19:10,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:19:10,046 INFO L87 Difference]: Start difference. First operand 34348 states and 42140 transitions. Second operand 13 states. [2019-09-10 06:19:10,936 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2019-09-10 06:19:13,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:13,290 INFO L93 Difference]: Finished difference Result 45601 states and 57382 transitions. [2019-09-10 06:19:13,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 06:19:13,290 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 186 [2019-09-10 06:19:13,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:13,330 INFO L225 Difference]: With dead ends: 45601 [2019-09-10 06:19:13,330 INFO L226 Difference]: Without dead ends: 45467 [2019-09-10 06:19:13,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=386, Invalid=946, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 06:19:13,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45467 states. [2019-09-10 06:19:13,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45467 to 34160. [2019-09-10 06:19:13,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34160 states. [2019-09-10 06:19:13,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34160 states to 34160 states and 41898 transitions. [2019-09-10 06:19:13,645 INFO L78 Accepts]: Start accepts. Automaton has 34160 states and 41898 transitions. Word has length 186 [2019-09-10 06:19:13,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:13,645 INFO L475 AbstractCegarLoop]: Abstraction has 34160 states and 41898 transitions. [2019-09-10 06:19:13,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:19:13,645 INFO L276 IsEmpty]: Start isEmpty. Operand 34160 states and 41898 transitions. [2019-09-10 06:19:13,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:19:13,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:13,656 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, 1, 1, 1, 1, 1, 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 06:19:13,656 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:13,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:13,656 INFO L82 PathProgramCache]: Analyzing trace with hash 2103385952, now seen corresponding path program 1 times [2019-09-10 06:19:13,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:13,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:13,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:13,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:13,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:14,149 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 06:19:14,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:14,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 06:19:14,150 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:14,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:19:14,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:19:14,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:19:14,151 INFO L87 Difference]: Start difference. First operand 34160 states and 41898 transitions. Second operand 21 states. [2019-09-10 06:19:21,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:21,183 INFO L93 Difference]: Finished difference Result 69328 states and 89716 transitions. [2019-09-10 06:19:21,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-10 06:19:21,183 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 186 [2019-09-10 06:19:21,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:21,258 INFO L225 Difference]: With dead ends: 69328 [2019-09-10 06:19:21,258 INFO L226 Difference]: Without dead ends: 69192 [2019-09-10 06:19:21,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=662, Invalid=2878, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 06:19:21,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69192 states. [2019-09-10 06:19:21,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69192 to 34992. [2019-09-10 06:19:21,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34992 states. [2019-09-10 06:19:21,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34992 states to 34992 states and 42765 transitions. [2019-09-10 06:19:21,923 INFO L78 Accepts]: Start accepts. Automaton has 34992 states and 42765 transitions. Word has length 186 [2019-09-10 06:19:21,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:21,923 INFO L475 AbstractCegarLoop]: Abstraction has 34992 states and 42765 transitions. [2019-09-10 06:19:21,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:19:21,923 INFO L276 IsEmpty]: Start isEmpty. Operand 34992 states and 42765 transitions. [2019-09-10 06:19:21,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:19:21,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:21,935 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, 1, 1, 1, 1, 1, 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 06:19:21,935 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:21,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:21,936 INFO L82 PathProgramCache]: Analyzing trace with hash 46060091, now seen corresponding path program 1 times [2019-09-10 06:19:21,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:21,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:21,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:21,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:21,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:23,392 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 06:19:23,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:23,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-09-10 06:19:23,393 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:23,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 06:19:23,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 06:19:23,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2019-09-10 06:19:23,394 INFO L87 Difference]: Start difference. First operand 34992 states and 42765 transitions. Second operand 27 states. [2019-09-10 06:19:23,644 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-10 06:19:24,793 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 06:19:25,518 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 06:19:26,635 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-09-10 06:19:26,974 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-09-10 06:19:27,523 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-09-10 06:19:27,886 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 83 [2019-09-10 06:19:30,816 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 88 [2019-09-10 06:19:31,078 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-09-10 06:19:31,353 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-09-10 06:19:33,009 WARN L188 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2019-09-10 06:19:33,581 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-09-10 06:19:36,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:36,377 INFO L93 Difference]: Finished difference Result 62569 states and 80857 transitions. [2019-09-10 06:19:36,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-10 06:19:36,377 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 186 [2019-09-10 06:19:36,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:36,447 INFO L225 Difference]: With dead ends: 62569 [2019-09-10 06:19:36,447 INFO L226 Difference]: Without dead ends: 62489 [2019-09-10 06:19:36,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=447, Invalid=2633, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 06:19:36,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62489 states. [2019-09-10 06:19:37,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62489 to 34697. [2019-09-10 06:19:37,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34697 states. [2019-09-10 06:19:37,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34697 states to 34697 states and 42458 transitions. [2019-09-10 06:19:37,083 INFO L78 Accepts]: Start accepts. Automaton has 34697 states and 42458 transitions. Word has length 186 [2019-09-10 06:19:37,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:37,083 INFO L475 AbstractCegarLoop]: Abstraction has 34697 states and 42458 transitions. [2019-09-10 06:19:37,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 06:19:37,083 INFO L276 IsEmpty]: Start isEmpty. Operand 34697 states and 42458 transitions. [2019-09-10 06:19:37,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:19:37,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:37,095 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, 1, 1, 1, 1, 1, 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 06:19:37,095 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:37,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:37,096 INFO L82 PathProgramCache]: Analyzing trace with hash -2048677842, now seen corresponding path program 1 times [2019-09-10 06:19:37,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:37,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:37,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:37,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:37,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:37,215 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 06:19:37,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:37,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:19:37,216 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:37,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:19:37,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:19:37,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:19:37,217 INFO L87 Difference]: Start difference. First operand 34697 states and 42458 transitions. Second operand 6 states. [2019-09-10 06:19:37,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:37,503 INFO L93 Difference]: Finished difference Result 41290 states and 51488 transitions. [2019-09-10 06:19:37,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:19:37,503 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 186 [2019-09-10 06:19:37,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:37,543 INFO L225 Difference]: With dead ends: 41290 [2019-09-10 06:19:37,544 INFO L226 Difference]: Without dead ends: 41290 [2019-09-10 06:19:37,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:19:37,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41290 states. [2019-09-10 06:19:37,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41290 to 32503. [2019-09-10 06:19:37,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32503 states. [2019-09-10 06:19:37,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32503 states to 32503 states and 39324 transitions. [2019-09-10 06:19:37,888 INFO L78 Accepts]: Start accepts. Automaton has 32503 states and 39324 transitions. Word has length 186 [2019-09-10 06:19:37,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:37,889 INFO L475 AbstractCegarLoop]: Abstraction has 32503 states and 39324 transitions. [2019-09-10 06:19:37,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:19:37,889 INFO L276 IsEmpty]: Start isEmpty. Operand 32503 states and 39324 transitions. [2019-09-10 06:19:37,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:19:37,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:37,900 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, 1, 1, 1, 1, 1, 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 06:19:37,901 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:37,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:37,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1817161803, now seen corresponding path program 1 times [2019-09-10 06:19:37,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:37,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:37,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:37,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:37,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:38,915 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 06:19:38,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:38,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 06:19:38,916 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:38,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 06:19:38,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 06:19:38,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:19:38,917 INFO L87 Difference]: Start difference. First operand 32503 states and 39324 transitions. Second operand 25 states. [2019-09-10 06:19:39,111 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-10 06:19:40,014 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-10 06:19:41,606 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-10 06:19:42,008 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-09-10 06:19:42,239 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2019-09-10 06:19:42,408 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-10 06:19:42,692 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-10 06:19:46,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:46,375 INFO L93 Difference]: Finished difference Result 35610 states and 43204 transitions. [2019-09-10 06:19:46,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 06:19:46,376 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 186 [2019-09-10 06:19:46,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:46,405 INFO L225 Difference]: With dead ends: 35610 [2019-09-10 06:19:46,405 INFO L226 Difference]: Without dead ends: 35554 [2019-09-10 06:19:46,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=469, Invalid=2081, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 06:19:46,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35554 states. [2019-09-10 06:19:46,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35554 to 32854. [2019-09-10 06:19:46,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32854 states. [2019-09-10 06:19:46,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32854 states to 32854 states and 39675 transitions. [2019-09-10 06:19:46,694 INFO L78 Accepts]: Start accepts. Automaton has 32854 states and 39675 transitions. Word has length 186 [2019-09-10 06:19:46,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:46,694 INFO L475 AbstractCegarLoop]: Abstraction has 32854 states and 39675 transitions. [2019-09-10 06:19:46,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 06:19:46,694 INFO L276 IsEmpty]: Start isEmpty. Operand 32854 states and 39675 transitions. [2019-09-10 06:19:46,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:19:46,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:46,706 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, 1, 1, 1, 1, 1, 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 06:19:46,706 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:46,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:46,706 INFO L82 PathProgramCache]: Analyzing trace with hash -38723592, now seen corresponding path program 1 times [2019-09-10 06:19:46,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:46,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:46,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:46,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:46,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:47,460 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 06:19:47,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:47,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-10 06:19:47,461 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:47,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 06:19:47,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 06:19:47,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2019-09-10 06:19:47,462 INFO L87 Difference]: Start difference. First operand 32854 states and 39675 transitions. Second operand 28 states. [2019-09-10 06:19:47,648 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-10 06:19:50,346 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-09-10 06:19:50,586 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-10 06:19:50,816 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 06:19:51,009 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-10 06:19:51,315 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-10 06:19:57,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:57,089 INFO L93 Difference]: Finished difference Result 44373 states and 54860 transitions. [2019-09-10 06:19:57,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 06:19:57,089 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 186 [2019-09-10 06:19:57,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:57,120 INFO L225 Difference]: With dead ends: 44373 [2019-09-10 06:19:57,121 INFO L226 Difference]: Without dead ends: 44307 [2019-09-10 06:19:57,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=697, Invalid=3859, Unknown=0, NotChecked=0, Total=4556 [2019-09-10 06:19:57,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44307 states. [2019-09-10 06:19:57,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44307 to 32976. [2019-09-10 06:19:57,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32976 states. [2019-09-10 06:19:57,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32976 states to 32976 states and 39797 transitions. [2019-09-10 06:19:57,404 INFO L78 Accepts]: Start accepts. Automaton has 32976 states and 39797 transitions. Word has length 186 [2019-09-10 06:19:57,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:57,404 INFO L475 AbstractCegarLoop]: Abstraction has 32976 states and 39797 transitions. [2019-09-10 06:19:57,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 06:19:57,404 INFO L276 IsEmpty]: Start isEmpty. Operand 32976 states and 39797 transitions. [2019-09-10 06:19:57,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:19:57,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:57,414 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, 1, 1, 1, 1, 1, 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 06:19:57,414 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:57,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:57,415 INFO L82 PathProgramCache]: Analyzing trace with hash -217252100, now seen corresponding path program 1 times [2019-09-10 06:19:57,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:57,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:57,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:57,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:57,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:57,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-10 06:19:57,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:57,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 06:19:57,988 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:57,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 06:19:57,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 06:19:57,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:19:57,989 INFO L87 Difference]: Start difference. First operand 32976 states and 39797 transitions. Second operand 23 states. [2019-09-10 06:19:59,031 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-09-10 06:20:03,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:03,433 INFO L93 Difference]: Finished difference Result 37449 states and 45263 transitions. [2019-09-10 06:20:03,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 06:20:03,433 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 186 [2019-09-10 06:20:03,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:03,465 INFO L225 Difference]: With dead ends: 37449 [2019-09-10 06:20:03,465 INFO L226 Difference]: Without dead ends: 37449 [2019-09-10 06:20:03,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=461, Invalid=1891, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 06:20:03,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37449 states. [2019-09-10 06:20:03,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37449 to 34994. [2019-09-10 06:20:03,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34994 states. [2019-09-10 06:20:03,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34994 states to 34994 states and 42329 transitions. [2019-09-10 06:20:03,740 INFO L78 Accepts]: Start accepts. Automaton has 34994 states and 42329 transitions. Word has length 186 [2019-09-10 06:20:03,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:03,740 INFO L475 AbstractCegarLoop]: Abstraction has 34994 states and 42329 transitions. [2019-09-10 06:20:03,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 06:20:03,740 INFO L276 IsEmpty]: Start isEmpty. Operand 34994 states and 42329 transitions. [2019-09-10 06:20:03,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:20:03,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:03,751 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, 1, 1, 1, 1, 1, 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 06:20:03,751 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:03,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:03,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1779668444, now seen corresponding path program 1 times [2019-09-10 06:20:03,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:03,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:03,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:03,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:03,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:04,169 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 06:20:04,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:04,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 06:20:04,169 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:04,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:20:04,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:20:04,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:20:04,170 INFO L87 Difference]: Start difference. First operand 34994 states and 42329 transitions. Second operand 19 states. [2019-09-10 06:20:04,299 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 06:20:05,244 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-10 06:20:07,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:07,524 INFO L93 Difference]: Finished difference Result 33812 states and 40654 transitions. [2019-09-10 06:20:07,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:20:07,525 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 186 [2019-09-10 06:20:07,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:07,549 INFO L225 Difference]: With dead ends: 33812 [2019-09-10 06:20:07,549 INFO L226 Difference]: Without dead ends: 33812 [2019-09-10 06:20:07,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=249, Invalid=941, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 06:20:07,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33812 states. [2019-09-10 06:20:07,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33812 to 32949. [2019-09-10 06:20:07,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32949 states. [2019-09-10 06:20:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32949 states to 32949 states and 39762 transitions. [2019-09-10 06:20:07,792 INFO L78 Accepts]: Start accepts. Automaton has 32949 states and 39762 transitions. Word has length 186 [2019-09-10 06:20:07,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:07,792 INFO L475 AbstractCegarLoop]: Abstraction has 32949 states and 39762 transitions. [2019-09-10 06:20:07,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:20:07,792 INFO L276 IsEmpty]: Start isEmpty. Operand 32949 states and 39762 transitions. [2019-09-10 06:20:07,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:20:07,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:07,803 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, 1, 1, 1, 1, 1, 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 06:20:07,803 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:07,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:07,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1561186111, now seen corresponding path program 1 times [2019-09-10 06:20:07,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:07,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:07,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:07,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:07,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:08,227 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 06:20:08,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:08,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 06:20:08,228 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:08,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:20:08,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:20:08,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:20:08,228 INFO L87 Difference]: Start difference. First operand 32949 states and 39762 transitions. Second operand 21 states. [2019-09-10 06:20:14,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:14,590 INFO L93 Difference]: Finished difference Result 61899 states and 79131 transitions. [2019-09-10 06:20:14,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-10 06:20:14,591 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 186 [2019-09-10 06:20:14,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:14,658 INFO L225 Difference]: With dead ends: 61899 [2019-09-10 06:20:14,658 INFO L226 Difference]: Without dead ends: 61899 [2019-09-10 06:20:14,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=716, Invalid=2944, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 06:20:14,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61899 states. [2019-09-10 06:20:15,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61899 to 33419. [2019-09-10 06:20:15,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33419 states. [2019-09-10 06:20:15,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33419 states to 33419 states and 40245 transitions. [2019-09-10 06:20:15,270 INFO L78 Accepts]: Start accepts. Automaton has 33419 states and 40245 transitions. Word has length 186 [2019-09-10 06:20:15,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:15,270 INFO L475 AbstractCegarLoop]: Abstraction has 33419 states and 40245 transitions. [2019-09-10 06:20:15,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:20:15,270 INFO L276 IsEmpty]: Start isEmpty. Operand 33419 states and 40245 transitions. [2019-09-10 06:20:15,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:20:15,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:15,282 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, 1, 1, 1, 1, 1, 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 06:20:15,283 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:15,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:15,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1363032976, now seen corresponding path program 1 times [2019-09-10 06:20:15,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:15,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:15,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:15,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:15,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:15,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 06:20:15,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:15,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:20:15,608 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:15,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:20:15,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:20:15,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:20:15,608 INFO L87 Difference]: Start difference. First operand 33419 states and 40245 transitions. Second operand 16 states. [2019-09-10 06:20:19,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:19,252 INFO L93 Difference]: Finished difference Result 51615 states and 64078 transitions. [2019-09-10 06:20:19,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 06:20:19,253 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 186 [2019-09-10 06:20:19,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:19,300 INFO L225 Difference]: With dead ends: 51615 [2019-09-10 06:20:19,300 INFO L226 Difference]: Without dead ends: 51615 [2019-09-10 06:20:19,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=343, Invalid=1379, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 06:20:19,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51615 states. [2019-09-10 06:20:19,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51615 to 33949. [2019-09-10 06:20:19,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33949 states. [2019-09-10 06:20:19,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33949 states to 33949 states and 40773 transitions. [2019-09-10 06:20:19,663 INFO L78 Accepts]: Start accepts. Automaton has 33949 states and 40773 transitions. Word has length 186 [2019-09-10 06:20:19,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:19,664 INFO L475 AbstractCegarLoop]: Abstraction has 33949 states and 40773 transitions. [2019-09-10 06:20:19,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:20:19,664 INFO L276 IsEmpty]: Start isEmpty. Operand 33949 states and 40773 transitions. [2019-09-10 06:20:19,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:20:19,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:19,676 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, 1, 1, 1, 1, 1, 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 06:20:19,676 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:19,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:19,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1370942214, now seen corresponding path program 1 times [2019-09-10 06:20:19,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:19,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:19,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:19,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:19,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:20,909 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 06:20:20,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:20,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 06:20:20,910 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:20,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 06:20:20,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 06:20:20,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:20:20,911 INFO L87 Difference]: Start difference. First operand 33949 states and 40773 transitions. Second operand 26 states. [2019-09-10 06:20:21,256 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 88 [2019-09-10 06:20:23,012 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-09-10 06:20:23,296 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 06:20:23,632 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 06:20:23,847 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-10 06:20:24,296 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-09-10 06:20:24,727 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-09-10 06:20:25,000 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2019-09-10 06:20:25,241 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-09-10 06:20:25,567 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-09-10 06:20:28,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:28,522 INFO L93 Difference]: Finished difference Result 35904 states and 43162 transitions. [2019-09-10 06:20:28,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 06:20:28,522 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 186 [2019-09-10 06:20:28,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:28,551 INFO L225 Difference]: With dead ends: 35904 [2019-09-10 06:20:28,551 INFO L226 Difference]: Without dead ends: 35904 [2019-09-10 06:20:28,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=406, Invalid=1946, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 06:20:28,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35904 states. [2019-09-10 06:20:28,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35904 to 33655. [2019-09-10 06:20:28,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33655 states. [2019-09-10 06:20:28,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33655 states to 33655 states and 40450 transitions. [2019-09-10 06:20:28,836 INFO L78 Accepts]: Start accepts. Automaton has 33655 states and 40450 transitions. Word has length 186 [2019-09-10 06:20:28,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:28,837 INFO L475 AbstractCegarLoop]: Abstraction has 33655 states and 40450 transitions. [2019-09-10 06:20:28,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 06:20:28,837 INFO L276 IsEmpty]: Start isEmpty. Operand 33655 states and 40450 transitions. [2019-09-10 06:20:28,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:20:28,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:28,849 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, 1, 1, 1, 1, 1, 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 06:20:28,849 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:28,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:28,849 INFO L82 PathProgramCache]: Analyzing trace with hash -143051686, now seen corresponding path program 1 times [2019-09-10 06:20:28,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:28,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:28,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:28,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:28,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:29,703 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 06:20:29,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:29,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 06:20:29,703 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:29,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:20:29,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:20:29,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:20:29,704 INFO L87 Difference]: Start difference. First operand 33655 states and 40450 transitions. Second operand 22 states. [2019-09-10 06:20:29,856 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 06:20:30,765 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 06:20:30,914 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 06:20:31,104 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 06:20:31,295 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-10 06:20:31,529 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2019-09-10 06:20:31,844 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-09-10 06:20:32,327 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 06:20:36,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:36,160 INFO L93 Difference]: Finished difference Result 37337 states and 44996 transitions. [2019-09-10 06:20:36,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 06:20:36,161 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 186 [2019-09-10 06:20:36,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:36,191 INFO L225 Difference]: With dead ends: 37337 [2019-09-10 06:20:36,191 INFO L226 Difference]: Without dead ends: 37337 [2019-09-10 06:20:36,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=406, Invalid=1756, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 06:20:36,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37337 states. [2019-09-10 06:20:36,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37337 to 33667. [2019-09-10 06:20:36,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33667 states. [2019-09-10 06:20:36,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33667 states to 33667 states and 40462 transitions. [2019-09-10 06:20:36,474 INFO L78 Accepts]: Start accepts. Automaton has 33667 states and 40462 transitions. Word has length 186 [2019-09-10 06:20:36,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:36,474 INFO L475 AbstractCegarLoop]: Abstraction has 33667 states and 40462 transitions. [2019-09-10 06:20:36,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:20:36,474 INFO L276 IsEmpty]: Start isEmpty. Operand 33667 states and 40462 transitions. [2019-09-10 06:20:36,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:20:36,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:36,485 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, 1, 1, 1, 1, 1, 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 06:20:36,486 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:36,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:36,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1069734006, now seen corresponding path program 1 times [2019-09-10 06:20:36,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:36,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:36,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:36,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:36,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:37,418 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 06:20:37,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:37,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 06:20:37,418 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:37,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 06:20:37,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 06:20:37,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:20:37,419 INFO L87 Difference]: Start difference. First operand 33667 states and 40462 transitions. Second operand 23 states. [2019-09-10 06:20:37,763 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 100 [2019-09-10 06:20:38,158 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-09-10 06:20:39,136 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 06:20:39,311 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 06:20:39,551 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-10 06:20:39,808 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-09-10 06:20:39,959 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 06:20:40,181 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 06:20:40,390 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 06:20:40,647 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-10 06:20:40,924 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 06:20:42,694 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 33 [2019-09-10 06:20:43,319 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 31 [2019-09-10 06:20:45,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:45,113 INFO L93 Difference]: Finished difference Result 40418 states and 49698 transitions. [2019-09-10 06:20:45,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 06:20:45,114 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 186 [2019-09-10 06:20:45,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:45,146 INFO L225 Difference]: With dead ends: 40418 [2019-09-10 06:20:45,146 INFO L226 Difference]: Without dead ends: 40418 [2019-09-10 06:20:45,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=582, Invalid=2070, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 06:20:45,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40418 states. [2019-09-10 06:20:45,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40418 to 31890. [2019-09-10 06:20:45,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31890 states. [2019-09-10 06:20:45,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31890 states to 31890 states and 38016 transitions. [2019-09-10 06:20:45,564 INFO L78 Accepts]: Start accepts. Automaton has 31890 states and 38016 transitions. Word has length 186 [2019-09-10 06:20:45,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:45,565 INFO L475 AbstractCegarLoop]: Abstraction has 31890 states and 38016 transitions. [2019-09-10 06:20:45,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 06:20:45,565 INFO L276 IsEmpty]: Start isEmpty. Operand 31890 states and 38016 transitions. [2019-09-10 06:20:45,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:20:45,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:45,576 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, 1, 1, 1, 1, 1, 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 06:20:45,576 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:45,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:45,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1497739282, now seen corresponding path program 1 times [2019-09-10 06:20:45,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:45,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:45,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:45,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:45,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:46,173 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 31 [2019-09-10 06:20:47,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:47,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:47,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-09-10 06:20:47,443 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:47,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 06:20:47,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 06:20:47,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2019-09-10 06:20:47,443 INFO L87 Difference]: Start difference. First operand 31890 states and 38016 transitions. Second operand 27 states. [2019-09-10 06:20:48,335 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 06:20:48,585 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 06:20:48,942 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 06:20:49,147 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 06:20:49,351 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-10 06:20:49,571 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 06:20:50,079 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 06:20:50,299 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-09-10 06:20:50,939 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 06:20:51,170 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 06:20:51,648 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 06:20:51,915 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-10 06:20:52,153 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 06:20:52,574 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 06:20:52,829 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 06:20:53,052 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 06:20:53,308 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-09-10 06:20:54,094 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 06:20:55,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:55,969 INFO L93 Difference]: Finished difference Result 43184 states and 53503 transitions. [2019-09-10 06:20:55,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 06:20:55,970 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 186 [2019-09-10 06:20:55,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:56,004 INFO L225 Difference]: With dead ends: 43184 [2019-09-10 06:20:56,004 INFO L226 Difference]: Without dead ends: 43128 [2019-09-10 06:20:56,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=497, Invalid=1855, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 06:20:56,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43128 states. [2019-09-10 06:20:56,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43128 to 31913. [2019-09-10 06:20:56,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31913 states. [2019-09-10 06:20:56,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31913 states to 31913 states and 38038 transitions. [2019-09-10 06:20:56,423 INFO L78 Accepts]: Start accepts. Automaton has 31913 states and 38038 transitions. Word has length 186 [2019-09-10 06:20:56,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:56,423 INFO L475 AbstractCegarLoop]: Abstraction has 31913 states and 38038 transitions. [2019-09-10 06:20:56,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 06:20:56,423 INFO L276 IsEmpty]: Start isEmpty. Operand 31913 states and 38038 transitions. [2019-09-10 06:20:56,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:20:56,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:56,434 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, 1, 1, 1, 1, 1, 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 06:20:56,434 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:56,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:56,434 INFO L82 PathProgramCache]: Analyzing trace with hash 579776540, now seen corresponding path program 1 times [2019-09-10 06:20:56,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:56,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:56,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:56,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:56,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:56,903 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 06:20:56,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:56,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:20:56,903 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:56,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:20:56,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:20:56,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:20:56,904 INFO L87 Difference]: Start difference. First operand 31913 states and 38038 transitions. Second operand 17 states. [2019-09-10 06:20:59,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:59,243 INFO L93 Difference]: Finished difference Result 41379 states and 50567 transitions. [2019-09-10 06:20:59,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 06:20:59,243 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 186 [2019-09-10 06:20:59,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:59,279 INFO L225 Difference]: With dead ends: 41379 [2019-09-10 06:20:59,279 INFO L226 Difference]: Without dead ends: 41264 [2019-09-10 06:20:59,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=358, Invalid=974, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 06:20:59,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41264 states. [2019-09-10 06:20:59,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41264 to 29727. [2019-09-10 06:20:59,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29727 states. [2019-09-10 06:20:59,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29727 states to 29727 states and 35161 transitions. [2019-09-10 06:20:59,583 INFO L78 Accepts]: Start accepts. Automaton has 29727 states and 35161 transitions. Word has length 186 [2019-09-10 06:20:59,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:59,583 INFO L475 AbstractCegarLoop]: Abstraction has 29727 states and 35161 transitions. [2019-09-10 06:20:59,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:20:59,584 INFO L276 IsEmpty]: Start isEmpty. Operand 29727 states and 35161 transitions. [2019-09-10 06:20:59,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:20:59,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:59,595 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, 1, 1, 1, 1, 1, 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 06:20:59,595 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:59,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:59,596 INFO L82 PathProgramCache]: Analyzing trace with hash -211347274, now seen corresponding path program 1 times [2019-09-10 06:20:59,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:59,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:59,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:59,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:59,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:00,165 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 06:21:00,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:00,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:21:00,166 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:00,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:21:00,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:21:00,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:21:00,166 INFO L87 Difference]: Start difference. First operand 29727 states and 35161 transitions. Second operand 16 states. [2019-09-10 06:21:01,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:01,954 INFO L93 Difference]: Finished difference Result 39736 states and 48735 transitions. [2019-09-10 06:21:01,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:21:01,955 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 186 [2019-09-10 06:21:01,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:01,989 INFO L225 Difference]: With dead ends: 39736 [2019-09-10 06:21:01,989 INFO L226 Difference]: Without dead ends: 39736 [2019-09-10 06:21:01,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:21:02,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39736 states. [2019-09-10 06:21:02,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39736 to 28123. [2019-09-10 06:21:02,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28123 states. [2019-09-10 06:21:02,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28123 states to 28123 states and 33235 transitions. [2019-09-10 06:21:02,276 INFO L78 Accepts]: Start accepts. Automaton has 28123 states and 33235 transitions. Word has length 186 [2019-09-10 06:21:02,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:02,276 INFO L475 AbstractCegarLoop]: Abstraction has 28123 states and 33235 transitions. [2019-09-10 06:21:02,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:21:02,276 INFO L276 IsEmpty]: Start isEmpty. Operand 28123 states and 33235 transitions. [2019-09-10 06:21:02,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:21:02,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:02,287 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, 1, 1, 1, 1, 1, 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 06:21:02,287 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:02,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:02,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1337513954, now seen corresponding path program 1 times [2019-09-10 06:21:02,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:02,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:02,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:02,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:02,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:02,832 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 06:21:02,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:02,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 06:21:02,832 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:02,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:21:02,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:21:02,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:21:02,833 INFO L87 Difference]: Start difference. First operand 28123 states and 33235 transitions. Second operand 18 states. [2019-09-10 06:21:07,304 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-09-10 06:21:07,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:07,486 INFO L93 Difference]: Finished difference Result 30428 states and 35838 transitions. [2019-09-10 06:21:07,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 06:21:07,486 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 186 [2019-09-10 06:21:07,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:07,511 INFO L225 Difference]: With dead ends: 30428 [2019-09-10 06:21:07,511 INFO L226 Difference]: Without dead ends: 30193 [2019-09-10 06:21:07,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=486, Invalid=1494, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 06:21:07,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30193 states. [2019-09-10 06:21:07,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30193 to 28432. [2019-09-10 06:21:07,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28432 states. [2019-09-10 06:21:07,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28432 states to 28432 states and 33547 transitions. [2019-09-10 06:21:07,743 INFO L78 Accepts]: Start accepts. Automaton has 28432 states and 33547 transitions. Word has length 186 [2019-09-10 06:21:07,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:07,743 INFO L475 AbstractCegarLoop]: Abstraction has 28432 states and 33547 transitions. [2019-09-10 06:21:07,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 06:21:07,743 INFO L276 IsEmpty]: Start isEmpty. Operand 28432 states and 33547 transitions. [2019-09-10 06:21:07,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:21:07,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:07,754 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, 1, 1, 1, 1, 1, 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 06:21:07,754 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:07,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:07,755 INFO L82 PathProgramCache]: Analyzing trace with hash -562947769, now seen corresponding path program 1 times [2019-09-10 06:21:07,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:07,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:07,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:07,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:07,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:08,453 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-09-10 06:21:08,684 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2019-09-10 06:21:09,453 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 06:21:09,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:09,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 06:21:09,453 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:09,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 06:21:09,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 06:21:09,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:21:09,454 INFO L87 Difference]: Start difference. First operand 28432 states and 33547 transitions. Second operand 23 states. [2019-09-10 06:21:10,125 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-10 06:21:10,367 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-10 06:21:10,885 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 06:21:11,205 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2019-09-10 06:21:11,465 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-09-10 06:21:11,856 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-09-10 06:21:12,127 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-09-10 06:21:12,463 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2019-09-10 06:21:12,699 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-09-10 06:21:12,972 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2019-09-10 06:21:13,576 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-10 06:21:14,004 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 54 [2019-09-10 06:21:14,596 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 63 [2019-09-10 06:21:14,868 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 66 [2019-09-10 06:21:15,411 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2019-09-10 06:21:15,642 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2019-09-10 06:21:16,493 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2019-09-10 06:21:16,772 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-09-10 06:21:17,376 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2019-09-10 06:21:19,192 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-09-10 06:21:19,452 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 61 [2019-09-10 06:21:19,961 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 06:21:20,329 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 06:21:20,593 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 61 [2019-09-10 06:21:21,081 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 06:21:21,568 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 96 [2019-09-10 06:21:21,898 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 81 [2019-09-10 06:21:21,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:21,999 INFO L93 Difference]: Finished difference Result 43111 states and 53187 transitions. [2019-09-10 06:21:21,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-10 06:21:21,999 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 186 [2019-09-10 06:21:22,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:22,036 INFO L225 Difference]: With dead ends: 43111 [2019-09-10 06:21:22,036 INFO L226 Difference]: Without dead ends: 43111 [2019-09-10 06:21:22,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=521, Invalid=2131, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 06:21:22,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43111 states. [2019-09-10 06:21:22,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43111 to 27648. [2019-09-10 06:21:22,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27648 states. [2019-09-10 06:21:22,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27648 states to 27648 states and 32424 transitions. [2019-09-10 06:21:22,339 INFO L78 Accepts]: Start accepts. Automaton has 27648 states and 32424 transitions. Word has length 186 [2019-09-10 06:21:22,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:22,339 INFO L475 AbstractCegarLoop]: Abstraction has 27648 states and 32424 transitions. [2019-09-10 06:21:22,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 06:21:22,339 INFO L276 IsEmpty]: Start isEmpty. Operand 27648 states and 32424 transitions. [2019-09-10 06:21:22,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:21:22,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:22,350 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, 1, 1, 1, 1, 1, 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 06:21:22,350 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:22,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:22,351 INFO L82 PathProgramCache]: Analyzing trace with hash 410831634, now seen corresponding path program 1 times [2019-09-10 06:21:22,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:22,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:22,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:22,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:22,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:22,919 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 06:21:22,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:22,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 06:21:22,919 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:22,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:21:22,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:21:22,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:21:22,920 INFO L87 Difference]: Start difference. First operand 27648 states and 32424 transitions. Second operand 19 states. [2019-09-10 06:21:25,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:25,248 INFO L93 Difference]: Finished difference Result 27544 states and 32042 transitions. [2019-09-10 06:21:25,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:21:25,248 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 186 [2019-09-10 06:21:25,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:25,271 INFO L225 Difference]: With dead ends: 27544 [2019-09-10 06:21:25,271 INFO L226 Difference]: Without dead ends: 27309 [2019-09-10 06:21:25,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=242, Invalid=880, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 06:21:25,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27309 states. [2019-09-10 06:21:25,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27309 to 26430. [2019-09-10 06:21:25,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26430 states. [2019-09-10 06:21:25,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26430 states to 26430 states and 30862 transitions. [2019-09-10 06:21:25,574 INFO L78 Accepts]: Start accepts. Automaton has 26430 states and 30862 transitions. Word has length 186 [2019-09-10 06:21:25,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:25,574 INFO L475 AbstractCegarLoop]: Abstraction has 26430 states and 30862 transitions. [2019-09-10 06:21:25,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:21:25,574 INFO L276 IsEmpty]: Start isEmpty. Operand 26430 states and 30862 transitions. [2019-09-10 06:21:25,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:21:25,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:25,584 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, 1, 1, 1, 1, 1, 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 06:21:25,585 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:25,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:25,585 INFO L82 PathProgramCache]: Analyzing trace with hash 83279115, now seen corresponding path program 1 times [2019-09-10 06:21:25,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:25,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:25,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:25,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:25,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:25,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:26,721 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 06:21:26,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:26,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 06:21:26,722 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:26,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 06:21:26,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 06:21:26,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:21:26,723 INFO L87 Difference]: Start difference. First operand 26430 states and 30862 transitions. Second operand 23 states. [2019-09-10 06:21:31,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:31,075 INFO L93 Difference]: Finished difference Result 32615 states and 39251 transitions. [2019-09-10 06:21:31,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:21:31,075 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 186 [2019-09-10 06:21:31,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:31,101 INFO L225 Difference]: With dead ends: 32615 [2019-09-10 06:21:31,101 INFO L226 Difference]: Without dead ends: 32337 [2019-09-10 06:21:31,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=379, Invalid=1103, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 06:21:31,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32337 states. [2019-09-10 06:21:31,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32337 to 25764. [2019-09-10 06:21:31,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25764 states. [2019-09-10 06:21:31,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25764 states to 25764 states and 30001 transitions. [2019-09-10 06:21:31,329 INFO L78 Accepts]: Start accepts. Automaton has 25764 states and 30001 transitions. Word has length 186 [2019-09-10 06:21:31,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:31,329 INFO L475 AbstractCegarLoop]: Abstraction has 25764 states and 30001 transitions. [2019-09-10 06:21:31,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 06:21:31,329 INFO L276 IsEmpty]: Start isEmpty. Operand 25764 states and 30001 transitions. [2019-09-10 06:21:31,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:21:31,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:31,339 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, 1, 1, 1, 1, 1, 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 06:21:31,339 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:31,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:31,339 INFO L82 PathProgramCache]: Analyzing trace with hash 563181678, now seen corresponding path program 1 times [2019-09-10 06:21:31,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:31,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:31,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:31,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:31,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:32,393 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 06:21:32,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:32,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 06:21:32,394 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:32,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:21:32,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:21:32,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:21:32,394 INFO L87 Difference]: Start difference. First operand 25764 states and 30001 transitions. Second operand 22 states. [2019-09-10 06:21:33,023 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-09-10 06:21:35,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:35,937 INFO L93 Difference]: Finished difference Result 24906 states and 28745 transitions. [2019-09-10 06:21:35,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:21:35,938 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 186 [2019-09-10 06:21:35,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:35,955 INFO L225 Difference]: With dead ends: 24906 [2019-09-10 06:21:35,955 INFO L226 Difference]: Without dead ends: 24529 [2019-09-10 06:21:35,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=300, Invalid=1032, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 06:21:35,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24529 states. [2019-09-10 06:21:36,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24529 to 24269. [2019-09-10 06:21:36,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24269 states. [2019-09-10 06:21:36,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24269 states to 24269 states and 28109 transitions. [2019-09-10 06:21:36,137 INFO L78 Accepts]: Start accepts. Automaton has 24269 states and 28109 transitions. Word has length 186 [2019-09-10 06:21:36,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:36,137 INFO L475 AbstractCegarLoop]: Abstraction has 24269 states and 28109 transitions. [2019-09-10 06:21:36,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:21:36,137 INFO L276 IsEmpty]: Start isEmpty. Operand 24269 states and 28109 transitions. [2019-09-10 06:21:36,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:21:36,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:36,147 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, 1, 1, 1, 1, 1, 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 06:21:36,147 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:36,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:36,148 INFO L82 PathProgramCache]: Analyzing trace with hash -738305478, now seen corresponding path program 1 times [2019-09-10 06:21:36,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:36,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:36,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:36,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:36,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:37,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-10 06:21:37,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:37,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 06:21:37,562 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:37,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 06:21:37,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 06:21:37,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:21:37,563 INFO L87 Difference]: Start difference. First operand 24269 states and 28109 transitions. Second operand 23 states. [2019-09-10 06:21:38,385 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 06:21:38,577 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 06:21:38,865 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2019-09-10 06:21:39,110 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 66 [2019-09-10 06:21:39,369 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-10 06:21:39,561 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-10 06:21:39,893 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2019-09-10 06:21:40,092 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2019-09-10 06:21:40,255 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 41 [2019-09-10 06:21:41,438 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 45 [2019-09-10 06:21:41,629 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 48 [2019-09-10 06:21:42,145 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 50 [2019-09-10 06:21:42,712 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 50 [2019-09-10 06:21:43,134 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 48 [2019-09-10 06:21:43,323 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2019-09-10 06:21:44,137 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 47 [2019-09-10 06:21:45,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:45,770 INFO L93 Difference]: Finished difference Result 35906 states and 43363 transitions. [2019-09-10 06:21:45,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 06:21:45,771 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 186 [2019-09-10 06:21:45,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:45,802 INFO L225 Difference]: With dead ends: 35906 [2019-09-10 06:21:45,802 INFO L226 Difference]: Without dead ends: 35906 [2019-09-10 06:21:45,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=502, Invalid=1568, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 06:21:45,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35906 states. [2019-09-10 06:21:46,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35906 to 24360. [2019-09-10 06:21:46,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24360 states. [2019-09-10 06:21:46,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24360 states to 24360 states and 28203 transitions. [2019-09-10 06:21:46,156 INFO L78 Accepts]: Start accepts. Automaton has 24360 states and 28203 transitions. Word has length 186 [2019-09-10 06:21:46,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:46,157 INFO L475 AbstractCegarLoop]: Abstraction has 24360 states and 28203 transitions. [2019-09-10 06:21:46,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 06:21:46,157 INFO L276 IsEmpty]: Start isEmpty. Operand 24360 states and 28203 transitions. [2019-09-10 06:21:46,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:21:46,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:46,168 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, 1, 1, 1, 1, 1, 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 06:21:46,168 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:46,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:46,169 INFO L82 PathProgramCache]: Analyzing trace with hash 526528371, now seen corresponding path program 1 times [2019-09-10 06:21:46,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:46,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:46,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:46,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:46,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:47,029 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 06:21:47,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:47,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 06:21:47,030 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:47,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 06:21:47,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 06:21:47,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:21:47,031 INFO L87 Difference]: Start difference. First operand 24360 states and 28203 transitions. Second operand 20 states. [2019-09-10 06:21:47,178 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 06:21:48,054 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-09-10 06:21:48,251 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-10 06:21:50,979 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 41 [2019-09-10 06:21:51,278 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 41 [2019-09-10 06:21:51,979 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 40 [2019-09-10 06:21:54,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:54,348 INFO L93 Difference]: Finished difference Result 26135 states and 30148 transitions. [2019-09-10 06:21:54,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-10 06:21:54,348 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 186 [2019-09-10 06:21:54,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:54,370 INFO L225 Difference]: With dead ends: 26135 [2019-09-10 06:21:54,370 INFO L226 Difference]: Without dead ends: 25863 [2019-09-10 06:21:54,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=601, Invalid=2939, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 06:21:54,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25863 states. [2019-09-10 06:21:54,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25863 to 24726. [2019-09-10 06:21:54,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24726 states. [2019-09-10 06:21:54,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24726 states to 24726 states and 28576 transitions. [2019-09-10 06:21:54,555 INFO L78 Accepts]: Start accepts. Automaton has 24726 states and 28576 transitions. Word has length 186 [2019-09-10 06:21:54,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:54,556 INFO L475 AbstractCegarLoop]: Abstraction has 24726 states and 28576 transitions. [2019-09-10 06:21:54,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 06:21:54,556 INFO L276 IsEmpty]: Start isEmpty. Operand 24726 states and 28576 transitions. [2019-09-10 06:21:54,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:21:54,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:54,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, 1, 1, 1, 1, 1, 1, 1, 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 06:21:54,566 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:54,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:54,566 INFO L82 PathProgramCache]: Analyzing trace with hash 213247112, now seen corresponding path program 1 times [2019-09-10 06:21:54,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:54,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:54,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:54,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:54,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:55,625 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 06:21:55,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:55,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 06:21:55,626 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:55,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:21:55,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:21:55,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:21:55,626 INFO L87 Difference]: Start difference. First operand 24726 states and 28576 transitions. Second operand 21 states. [2019-09-10 06:21:56,290 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-10 06:21:56,484 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-09-10 06:21:56,875 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-09-10 06:21:57,117 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2019-09-10 06:21:59,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:59,603 INFO L93 Difference]: Finished difference Result 31102 states and 37464 transitions. [2019-09-10 06:21:59,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:21:59,604 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 186 [2019-09-10 06:21:59,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:59,626 INFO L225 Difference]: With dead ends: 31102 [2019-09-10 06:21:59,627 INFO L226 Difference]: Without dead ends: 31102 [2019-09-10 06:21:59,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=244, Invalid=812, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 06:21:59,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31102 states. [2019-09-10 06:21:59,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31102 to 24215. [2019-09-10 06:21:59,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24215 states. [2019-09-10 06:21:59,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24215 states to 24215 states and 27959 transitions. [2019-09-10 06:21:59,831 INFO L78 Accepts]: Start accepts. Automaton has 24215 states and 27959 transitions. Word has length 186 [2019-09-10 06:21:59,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:59,832 INFO L475 AbstractCegarLoop]: Abstraction has 24215 states and 27959 transitions. [2019-09-10 06:21:59,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:21:59,832 INFO L276 IsEmpty]: Start isEmpty. Operand 24215 states and 27959 transitions. [2019-09-10 06:21:59,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:21:59,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:59,842 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, 1, 1, 1, 1, 1, 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 06:21:59,842 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:59,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:59,842 INFO L82 PathProgramCache]: Analyzing trace with hash -660371643, now seen corresponding path program 1 times [2019-09-10 06:21:59,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:59,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:59,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:59,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:59,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:00,440 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 06:22:00,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:00,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 06:22:00,440 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:00,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:22:00,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:22:00,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:22:00,441 INFO L87 Difference]: Start difference. First operand 24215 states and 27959 transitions. Second operand 18 states. [2019-09-10 06:22:00,598 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 06:22:04,096 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2019-09-10 06:22:04,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:04,702 INFO L93 Difference]: Finished difference Result 25012 states and 28815 transitions. [2019-09-10 06:22:04,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 06:22:04,704 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 186 [2019-09-10 06:22:04,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:04,725 INFO L225 Difference]: With dead ends: 25012 [2019-09-10 06:22:04,725 INFO L226 Difference]: Without dead ends: 24740 [2019-09-10 06:22:04,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=510, Invalid=1470, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 06:22:04,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24740 states. [2019-09-10 06:22:04,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24740 to 23245. [2019-09-10 06:22:04,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23245 states. [2019-09-10 06:22:04,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23245 states to 23245 states and 26728 transitions. [2019-09-10 06:22:04,907 INFO L78 Accepts]: Start accepts. Automaton has 23245 states and 26728 transitions. Word has length 186 [2019-09-10 06:22:04,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:04,907 INFO L475 AbstractCegarLoop]: Abstraction has 23245 states and 26728 transitions. [2019-09-10 06:22:04,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 06:22:04,907 INFO L276 IsEmpty]: Start isEmpty. Operand 23245 states and 26728 transitions. [2019-09-10 06:22:04,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:22:04,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:04,918 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, 1, 1, 1, 1, 1, 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 06:22:04,918 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:04,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:04,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1495974767, now seen corresponding path program 1 times [2019-09-10 06:22:04,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:04,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:04,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:04,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:04,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:06,649 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 06:22:06,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:06,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 06:22:06,650 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:06,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 06:22:06,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 06:22:06,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:22:06,651 INFO L87 Difference]: Start difference. First operand 23245 states and 26728 transitions. Second operand 23 states. [2019-09-10 06:22:07,039 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2019-09-10 06:22:07,906 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-09-10 06:22:08,136 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-09-10 06:22:08,646 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 06:22:09,030 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 06:22:11,932 WARN L188 SmtUtils]: Spent 2.80 s on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 06:22:12,087 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 06:22:12,799 WARN L188 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 06:22:14,067 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-09-10 06:22:14,283 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-09-10 06:22:14,448 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-09-10 06:22:17,294 WARN L188 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-09-10 06:22:17,508 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 06:22:18,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:18,747 INFO L93 Difference]: Finished difference Result 25007 states and 28706 transitions. [2019-09-10 06:22:18,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 06:22:18,747 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 186 [2019-09-10 06:22:18,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:18,769 INFO L225 Difference]: With dead ends: 25007 [2019-09-10 06:22:18,769 INFO L226 Difference]: Without dead ends: 24855 [2019-09-10 06:22:18,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=354, Invalid=1286, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 06:22:18,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24855 states. [2019-09-10 06:22:18,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24855 to 22230. [2019-09-10 06:22:18,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22230 states. [2019-09-10 06:22:18,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22230 states to 22230 states and 25382 transitions. [2019-09-10 06:22:18,947 INFO L78 Accepts]: Start accepts. Automaton has 22230 states and 25382 transitions. Word has length 186 [2019-09-10 06:22:18,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:18,948 INFO L475 AbstractCegarLoop]: Abstraction has 22230 states and 25382 transitions. [2019-09-10 06:22:18,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 06:22:18,948 INFO L276 IsEmpty]: Start isEmpty. Operand 22230 states and 25382 transitions. [2019-09-10 06:22:18,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 06:22:18,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:18,958 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, 1, 1, 1, 1, 1, 1, 1, 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 06:22:18,958 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:18,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:18,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1593214756, now seen corresponding path program 1 times [2019-09-10 06:22:18,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:18,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:18,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:18,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:18,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:19,012 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 06:22:19,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:19,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:19,013 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:19,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:19,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:19,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:19,014 INFO L87 Difference]: Start difference. First operand 22230 states and 25382 transitions. Second operand 3 states. [2019-09-10 06:22:19,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:19,112 INFO L93 Difference]: Finished difference Result 26594 states and 30783 transitions. [2019-09-10 06:22:19,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:19,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-09-10 06:22:19,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:19,131 INFO L225 Difference]: With dead ends: 26594 [2019-09-10 06:22:19,132 INFO L226 Difference]: Without dead ends: 26594 [2019-09-10 06:22:19,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:19,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26594 states. [2019-09-10 06:22:19,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26594 to 26416. [2019-09-10 06:22:19,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26416 states. [2019-09-10 06:22:19,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26416 states to 26416 states and 30518 transitions. [2019-09-10 06:22:19,316 INFO L78 Accepts]: Start accepts. Automaton has 26416 states and 30518 transitions. Word has length 188 [2019-09-10 06:22:19,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:19,317 INFO L475 AbstractCegarLoop]: Abstraction has 26416 states and 30518 transitions. [2019-09-10 06:22:19,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:19,317 INFO L276 IsEmpty]: Start isEmpty. Operand 26416 states and 30518 transitions. [2019-09-10 06:22:19,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 06:22:19,327 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:19,327 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:19,327 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:19,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:19,327 INFO L82 PathProgramCache]: Analyzing trace with hash -183786230, now seen corresponding path program 1 times [2019-09-10 06:22:19,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:19,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:19,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:19,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:19,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:19,404 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 06:22:19,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:19,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:22:19,405 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:19,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:22:19,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:22:19,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:22:19,406 INFO L87 Difference]: Start difference. First operand 26416 states and 30518 transitions. Second operand 6 states. [2019-09-10 06:22:19,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:19,525 INFO L93 Difference]: Finished difference Result 42465 states and 51728 transitions. [2019-09-10 06:22:19,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 06:22:19,525 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 189 [2019-09-10 06:22:19,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:19,558 INFO L225 Difference]: With dead ends: 42465 [2019-09-10 06:22:19,558 INFO L226 Difference]: Without dead ends: 42465 [2019-09-10 06:22:19,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:22:19,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42465 states. [2019-09-10 06:22:19,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42465 to 26578. [2019-09-10 06:22:19,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26578 states. [2019-09-10 06:22:19,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26578 states to 26578 states and 30680 transitions. [2019-09-10 06:22:19,809 INFO L78 Accepts]: Start accepts. Automaton has 26578 states and 30680 transitions. Word has length 189 [2019-09-10 06:22:19,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:19,810 INFO L475 AbstractCegarLoop]: Abstraction has 26578 states and 30680 transitions. [2019-09-10 06:22:19,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:22:19,810 INFO L276 IsEmpty]: Start isEmpty. Operand 26578 states and 30680 transitions. [2019-09-10 06:22:19,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 06:22:19,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:19,820 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:19,820 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:19,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:19,820 INFO L82 PathProgramCache]: Analyzing trace with hash -181939188, now seen corresponding path program 1 times [2019-09-10 06:22:19,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:19,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:19,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:19,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:19,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:19,952 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 06:22:19,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:19,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:22:19,953 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:19,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:22:19,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:22:19,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:22:19,954 INFO L87 Difference]: Start difference. First operand 26578 states and 30680 transitions. Second operand 5 states. [2019-09-10 06:22:20,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:20,134 INFO L93 Difference]: Finished difference Result 28666 states and 33401 transitions. [2019-09-10 06:22:20,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:22:20,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-09-10 06:22:20,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:20,154 INFO L225 Difference]: With dead ends: 28666 [2019-09-10 06:22:20,154 INFO L226 Difference]: Without dead ends: 28666 [2019-09-10 06:22:20,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:22:20,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28666 states. [2019-09-10 06:22:20,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28666 to 28628. [2019-09-10 06:22:20,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28628 states. [2019-09-10 06:22:20,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28628 states to 28628 states and 33364 transitions. [2019-09-10 06:22:20,349 INFO L78 Accepts]: Start accepts. Automaton has 28628 states and 33364 transitions. Word has length 189 [2019-09-10 06:22:20,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:20,350 INFO L475 AbstractCegarLoop]: Abstraction has 28628 states and 33364 transitions. [2019-09-10 06:22:20,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:22:20,350 INFO L276 IsEmpty]: Start isEmpty. Operand 28628 states and 33364 transitions. [2019-09-10 06:22:20,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 06:22:20,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:20,360 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:20,360 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:20,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:20,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1824848866, now seen corresponding path program 1 times [2019-09-10 06:22:20,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:20,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:20,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:20,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:20,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:20,472 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 06:22:20,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:20,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:22:20,472 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:20,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:22:20,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:22:20,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:22:20,473 INFO L87 Difference]: Start difference. First operand 28628 states and 33364 transitions. Second operand 5 states. [2019-09-10 06:22:20,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:20,609 INFO L93 Difference]: Finished difference Result 30716 states and 36085 transitions. [2019-09-10 06:22:20,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:22:20,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-09-10 06:22:20,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:20,631 INFO L225 Difference]: With dead ends: 30716 [2019-09-10 06:22:20,631 INFO L226 Difference]: Without dead ends: 30716 [2019-09-10 06:22:20,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:22:20,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30716 states. [2019-09-10 06:22:20,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30716 to 30678. [2019-09-10 06:22:20,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30678 states. [2019-09-10 06:22:20,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30678 states to 30678 states and 36048 transitions. [2019-09-10 06:22:20,849 INFO L78 Accepts]: Start accepts. Automaton has 30678 states and 36048 transitions. Word has length 189 [2019-09-10 06:22:20,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:20,850 INFO L475 AbstractCegarLoop]: Abstraction has 30678 states and 36048 transitions. [2019-09-10 06:22:20,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:22:20,850 INFO L276 IsEmpty]: Start isEmpty. Operand 30678 states and 36048 transitions. [2019-09-10 06:22:20,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 06:22:20,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:20,860 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:20,860 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:20,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:20,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1514248240, now seen corresponding path program 1 times [2019-09-10 06:22:20,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:20,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:20,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:20,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:20,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:20,975 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 06:22:20,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:20,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:22:20,975 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:20,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:22:20,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:22:20,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:22:20,976 INFO L87 Difference]: Start difference. First operand 30678 states and 36048 transitions. Second operand 5 states. [2019-09-10 06:22:21,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:21,111 INFO L93 Difference]: Finished difference Result 32748 states and 38751 transitions. [2019-09-10 06:22:21,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:22:21,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-09-10 06:22:21,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:21,135 INFO L225 Difference]: With dead ends: 32748 [2019-09-10 06:22:21,135 INFO L226 Difference]: Without dead ends: 32748 [2019-09-10 06:22:21,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:22:21,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32748 states. [2019-09-10 06:22:21,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32748 to 32728. [2019-09-10 06:22:21,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32728 states. [2019-09-10 06:22:21,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32728 states to 32728 states and 38732 transitions. [2019-09-10 06:22:21,365 INFO L78 Accepts]: Start accepts. Automaton has 32728 states and 38732 transitions. Word has length 189 [2019-09-10 06:22:21,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:21,365 INFO L475 AbstractCegarLoop]: Abstraction has 32728 states and 38732 transitions. [2019-09-10 06:22:21,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:22:21,365 INFO L276 IsEmpty]: Start isEmpty. Operand 32728 states and 38732 transitions. [2019-09-10 06:22:21,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 06:22:21,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:21,375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:21,375 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:21,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:21,376 INFO L82 PathProgramCache]: Analyzing trace with hash 2068918889, now seen corresponding path program 1 times [2019-09-10 06:22:21,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:21,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:21,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:21,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:21,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:21,684 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 06:22:21,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:21,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:22:21,684 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:21,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:22:21,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:22:21,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:22:21,685 INFO L87 Difference]: Start difference. First operand 32728 states and 38732 transitions. Second operand 16 states. [2019-09-10 06:22:23,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:23,902 INFO L93 Difference]: Finished difference Result 51173 states and 62835 transitions. [2019-09-10 06:22:23,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 06:22:23,903 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 192 [2019-09-10 06:22:23,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:23,947 INFO L225 Difference]: With dead ends: 51173 [2019-09-10 06:22:23,948 INFO L226 Difference]: Without dead ends: 51173 [2019-09-10 06:22:23,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=318, Invalid=1088, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:22:23,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51173 states. [2019-09-10 06:22:24,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51173 to 32497. [2019-09-10 06:22:24,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32497 states. [2019-09-10 06:22:24,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32497 states to 32497 states and 38493 transitions. [2019-09-10 06:22:24,263 INFO L78 Accepts]: Start accepts. Automaton has 32497 states and 38493 transitions. Word has length 192 [2019-09-10 06:22:24,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:24,263 INFO L475 AbstractCegarLoop]: Abstraction has 32497 states and 38493 transitions. [2019-09-10 06:22:24,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:22:24,263 INFO L276 IsEmpty]: Start isEmpty. Operand 32497 states and 38493 transitions. [2019-09-10 06:22:24,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 06:22:24,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:24,273 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:24,273 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:24,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:24,273 INFO L82 PathProgramCache]: Analyzing trace with hash -414481139, now seen corresponding path program 1 times [2019-09-10 06:22:24,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:24,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:24,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:24,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:24,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:24,710 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 06:22:24,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:24,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:22:24,711 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:24,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:22:24,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:22:24,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:22:24,711 INFO L87 Difference]: Start difference. First operand 32497 states and 38493 transitions. Second operand 16 states. [2019-09-10 06:22:26,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:26,519 INFO L93 Difference]: Finished difference Result 33222 states and 39219 transitions. [2019-09-10 06:22:26,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 06:22:26,520 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 192 [2019-09-10 06:22:26,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:26,544 INFO L225 Difference]: With dead ends: 33222 [2019-09-10 06:22:26,544 INFO L226 Difference]: Without dead ends: 31532 [2019-09-10 06:22:26,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=197, Invalid=859, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 06:22:26,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31532 states. [2019-09-10 06:22:26,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31532 to 30982. [2019-09-10 06:22:26,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30982 states. [2019-09-10 06:22:26,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30982 states to 30982 states and 36919 transitions. [2019-09-10 06:22:26,762 INFO L78 Accepts]: Start accepts. Automaton has 30982 states and 36919 transitions. Word has length 192 [2019-09-10 06:22:26,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:26,762 INFO L475 AbstractCegarLoop]: Abstraction has 30982 states and 36919 transitions. [2019-09-10 06:22:26,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:22:26,762 INFO L276 IsEmpty]: Start isEmpty. Operand 30982 states and 36919 transitions. [2019-09-10 06:22:26,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 06:22:26,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:26,771 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:26,771 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:26,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:26,772 INFO L82 PathProgramCache]: Analyzing trace with hash 596273967, now seen corresponding path program 1 times [2019-09-10 06:22:26,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:26,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:26,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:26,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:26,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:27,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:27,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:27,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 06:22:27,087 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:27,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 06:22:27,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 06:22:27,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:22:27,087 INFO L87 Difference]: Start difference. First operand 30982 states and 36919 transitions. Second operand 15 states. [2019-09-10 06:22:29,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:29,440 INFO L93 Difference]: Finished difference Result 46372 states and 56953 transitions. [2019-09-10 06:22:29,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 06:22:29,441 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 192 [2019-09-10 06:22:29,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:29,480 INFO L225 Difference]: With dead ends: 46372 [2019-09-10 06:22:29,481 INFO L226 Difference]: Without dead ends: 46372 [2019-09-10 06:22:29,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=356, Invalid=976, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 06:22:29,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46372 states. [2019-09-10 06:22:29,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46372 to 30826. [2019-09-10 06:22:29,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30826 states. [2019-09-10 06:22:29,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30826 states to 30826 states and 36714 transitions. [2019-09-10 06:22:29,775 INFO L78 Accepts]: Start accepts. Automaton has 30826 states and 36714 transitions. Word has length 192 [2019-09-10 06:22:29,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:29,775 INFO L475 AbstractCegarLoop]: Abstraction has 30826 states and 36714 transitions. [2019-09-10 06:22:29,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 06:22:29,776 INFO L276 IsEmpty]: Start isEmpty. Operand 30826 states and 36714 transitions. [2019-09-10 06:22:29,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 06:22:29,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:29,785 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:29,785 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:29,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:29,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1608487029, now seen corresponding path program 1 times [2019-09-10 06:22:29,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:29,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:29,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:29,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:29,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:30,093 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 06:22:30,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:30,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 06:22:30,094 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:30,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 06:22:30,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 06:22:30,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:22:30,094 INFO L87 Difference]: Start difference. First operand 30826 states and 36714 transitions. Second operand 15 states. [2019-09-10 06:22:33,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:33,761 INFO L93 Difference]: Finished difference Result 61804 states and 77410 transitions. [2019-09-10 06:22:33,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 06:22:33,762 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 192 [2019-09-10 06:22:33,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:33,817 INFO L225 Difference]: With dead ends: 61804 [2019-09-10 06:22:33,818 INFO L226 Difference]: Without dead ends: 61804 [2019-09-10 06:22:33,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=660, Invalid=2420, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 06:22:33,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61804 states. [2019-09-10 06:22:34,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61804 to 30814. [2019-09-10 06:22:34,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30814 states. [2019-09-10 06:22:34,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30814 states to 30814 states and 36676 transitions. [2019-09-10 06:22:34,167 INFO L78 Accepts]: Start accepts. Automaton has 30814 states and 36676 transitions. Word has length 192 [2019-09-10 06:22:34,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:34,167 INFO L475 AbstractCegarLoop]: Abstraction has 30814 states and 36676 transitions. [2019-09-10 06:22:34,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 06:22:34,167 INFO L276 IsEmpty]: Start isEmpty. Operand 30814 states and 36676 transitions. [2019-09-10 06:22:34,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 06:22:34,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:34,176 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:34,176 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:34,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:34,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1141131781, now seen corresponding path program 1 times [2019-09-10 06:22:34,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:34,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:34,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:34,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:34,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:34,370 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 06:22:34,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:34,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 06:22:34,371 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:34,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:22:34,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:22:34,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:22:34,371 INFO L87 Difference]: Start difference. First operand 30814 states and 36676 transitions. Second operand 13 states. [2019-09-10 06:22:35,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:35,653 INFO L93 Difference]: Finished difference Result 30904 states and 36759 transitions. [2019-09-10 06:22:35,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:22:35,653 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 192 [2019-09-10 06:22:35,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:35,680 INFO L225 Difference]: With dead ends: 30904 [2019-09-10 06:22:35,680 INFO L226 Difference]: Without dead ends: 30902 [2019-09-10 06:22:35,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:22:35,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30902 states. [2019-09-10 06:22:35,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30902 to 30491. [2019-09-10 06:22:35,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30491 states. [2019-09-10 06:22:35,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30491 states to 30491 states and 36338 transitions. [2019-09-10 06:22:35,911 INFO L78 Accepts]: Start accepts. Automaton has 30491 states and 36338 transitions. Word has length 192 [2019-09-10 06:22:35,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:35,911 INFO L475 AbstractCegarLoop]: Abstraction has 30491 states and 36338 transitions. [2019-09-10 06:22:35,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:22:35,912 INFO L276 IsEmpty]: Start isEmpty. Operand 30491 states and 36338 transitions. [2019-09-10 06:22:35,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 06:22:35,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:35,921 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:35,921 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:35,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:35,922 INFO L82 PathProgramCache]: Analyzing trace with hash -948949650, now seen corresponding path program 1 times [2019-09-10 06:22:35,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:35,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:35,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:35,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:35,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:36,578 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 06:22:36,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:36,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-10 06:22:36,578 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:36,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 06:22:36,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 06:22:36,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:22:36,579 INFO L87 Difference]: Start difference. First operand 30491 states and 36338 transitions. Second operand 24 states. [2019-09-10 06:22:36,817 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2019-09-10 06:22:46,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:46,296 INFO L93 Difference]: Finished difference Result 68266 states and 85856 transitions. [2019-09-10 06:22:46,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-10 06:22:46,296 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 192 [2019-09-10 06:22:46,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:46,362 INFO L225 Difference]: With dead ends: 68266 [2019-09-10 06:22:46,362 INFO L226 Difference]: Without dead ends: 68266 [2019-09-10 06:22:46,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1959 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1206, Invalid=5766, Unknown=0, NotChecked=0, Total=6972 [2019-09-10 06:22:46,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68266 states. [2019-09-10 06:22:46,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68266 to 30503. [2019-09-10 06:22:46,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30503 states. [2019-09-10 06:22:46,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30503 states to 30503 states and 36349 transitions. [2019-09-10 06:22:46,762 INFO L78 Accepts]: Start accepts. Automaton has 30503 states and 36349 transitions. Word has length 192 [2019-09-10 06:22:46,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:46,762 INFO L475 AbstractCegarLoop]: Abstraction has 30503 states and 36349 transitions. [2019-09-10 06:22:46,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 06:22:46,763 INFO L276 IsEmpty]: Start isEmpty. Operand 30503 states and 36349 transitions. [2019-09-10 06:22:46,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 06:22:46,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:46,772 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:46,772 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:46,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:46,772 INFO L82 PathProgramCache]: Analyzing trace with hash 862617618, now seen corresponding path program 1 times [2019-09-10 06:22:46,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:46,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:46,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:46,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:46,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:47,519 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 06:22:47,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:47,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 06:22:47,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:47,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 06:22:47,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 06:22:47,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=596, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:22:47,520 INFO L87 Difference]: Start difference. First operand 30503 states and 36349 transitions. Second operand 26 states. [2019-09-10 06:22:47,848 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 80 [2019-09-10 06:22:54,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:55,000 INFO L93 Difference]: Finished difference Result 38287 states and 46404 transitions. [2019-09-10 06:22:55,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-10 06:22:55,000 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 192 [2019-09-10 06:22:55,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:55,028 INFO L225 Difference]: With dead ends: 38287 [2019-09-10 06:22:55,028 INFO L226 Difference]: Without dead ends: 38275 [2019-09-10 06:22:55,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=587, Invalid=3195, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 06:22:55,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38275 states. [2019-09-10 06:22:55,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38275 to 30468. [2019-09-10 06:22:55,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30468 states. [2019-09-10 06:22:55,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30468 states to 30468 states and 36309 transitions. [2019-09-10 06:22:55,281 INFO L78 Accepts]: Start accepts. Automaton has 30468 states and 36309 transitions. Word has length 192 [2019-09-10 06:22:55,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:55,281 INFO L475 AbstractCegarLoop]: Abstraction has 30468 states and 36309 transitions. [2019-09-10 06:22:55,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 06:22:55,281 INFO L276 IsEmpty]: Start isEmpty. Operand 30468 states and 36309 transitions. [2019-09-10 06:22:55,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 06:22:55,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:55,290 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:55,290 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:55,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:55,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1788022499, now seen corresponding path program 1 times [2019-09-10 06:22:55,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:55,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:55,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:55,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:55,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:55,581 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 06:22:55,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:55,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 06:22:55,581 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:55,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 06:22:55,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 06:22:55,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:22:55,582 INFO L87 Difference]: Start difference. First operand 30468 states and 36309 transitions. Second operand 15 states. [2019-09-10 06:22:59,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:59,446 INFO L93 Difference]: Finished difference Result 56766 states and 70854 transitions. [2019-09-10 06:22:59,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-10 06:22:59,447 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 192 [2019-09-10 06:22:59,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:59,499 INFO L225 Difference]: With dead ends: 56766 [2019-09-10 06:22:59,499 INFO L226 Difference]: Without dead ends: 56671 [2019-09-10 06:22:59,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=846, Invalid=3060, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 06:22:59,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56671 states. [2019-09-10 06:22:59,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56671 to 30064. [2019-09-10 06:22:59,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30064 states. [2019-09-10 06:22:59,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30064 states to 30064 states and 35812 transitions. [2019-09-10 06:22:59,850 INFO L78 Accepts]: Start accepts. Automaton has 30064 states and 35812 transitions. Word has length 192 [2019-09-10 06:22:59,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:59,850 INFO L475 AbstractCegarLoop]: Abstraction has 30064 states and 35812 transitions. [2019-09-10 06:22:59,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 06:22:59,851 INFO L276 IsEmpty]: Start isEmpty. Operand 30064 states and 35812 transitions. [2019-09-10 06:22:59,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 06:22:59,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:59,860 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:59,860 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:59,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:59,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1897894031, now seen corresponding path program 1 times [2019-09-10 06:22:59,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:59,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:59,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:59,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:59,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:00,628 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 06:23:00,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:00,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 06:23:00,628 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:00,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 06:23:00,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 06:23:00,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:23:00,629 INFO L87 Difference]: Start difference. First operand 30064 states and 35812 transitions. Second operand 26 states. [2019-09-10 06:23:00,793 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 06:23:02,610 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-09-10 06:23:03,460 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2019-09-10 06:23:03,656 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-09-10 06:23:04,040 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-10 06:23:04,224 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-09-10 06:23:04,499 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-09-10 06:23:04,732 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-09-10 06:23:05,256 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-09-10 06:23:05,702 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-09-10 06:23:05,883 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-09-10 06:23:06,151 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-09-10 06:23:06,407 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-09-10 06:23:06,608 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-10 06:23:06,803 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 06:23:07,121 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-10 06:23:07,529 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-10 06:23:07,746 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 06:23:08,053 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-10 06:23:09,379 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-09-10 06:23:10,076 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 06:23:10,256 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-09-10 06:23:10,762 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 06:23:10,957 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-09-10 06:23:12,893 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-10 06:23:13,178 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 06:23:13,674 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-09-10 06:23:14,249 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-09-10 06:23:15,356 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-09-10 06:23:15,782 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-09-10 06:23:15,930 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-09-10 06:23:16,093 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2019-09-10 06:23:16,915 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2019-09-10 06:23:17,068 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2019-09-10 06:23:17,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:17,653 INFO L93 Difference]: Finished difference Result 64164 states and 79799 transitions. [2019-09-10 06:23:17,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-10 06:23:17,654 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 192 [2019-09-10 06:23:17,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:17,709 INFO L225 Difference]: With dead ends: 64164 [2019-09-10 06:23:17,710 INFO L226 Difference]: Without dead ends: 64164 [2019-09-10 06:23:17,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4648 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=1916, Invalid=12604, Unknown=0, NotChecked=0, Total=14520 [2019-09-10 06:23:17,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64164 states. [2019-09-10 06:23:18,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64164 to 35047. [2019-09-10 06:23:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35047 states. [2019-09-10 06:23:18,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35047 states to 35047 states and 42509 transitions. [2019-09-10 06:23:18,219 INFO L78 Accepts]: Start accepts. Automaton has 35047 states and 42509 transitions. Word has length 192 [2019-09-10 06:23:18,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:18,219 INFO L475 AbstractCegarLoop]: Abstraction has 35047 states and 42509 transitions. [2019-09-10 06:23:18,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 06:23:18,219 INFO L276 IsEmpty]: Start isEmpty. Operand 35047 states and 42509 transitions. [2019-09-10 06:23:18,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 06:23:18,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:18,230 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:23:18,230 INFO L418 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:18,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:18,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1558000416, now seen corresponding path program 1 times [2019-09-10 06:23:18,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:18,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:18,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:18,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:18,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:19,348 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 06:23:19,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:19,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-10 06:23:19,349 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:19,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 06:23:19,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 06:23:19,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=855, Unknown=0, NotChecked=0, Total=930 [2019-09-10 06:23:19,350 INFO L87 Difference]: Start difference. First operand 35047 states and 42509 transitions. Second operand 31 states. [2019-09-10 06:23:19,611 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 06:23:20,454 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-09-10 06:23:20,683 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-10 06:23:24,095 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2019-09-10 06:23:27,856 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 37 [2019-09-10 06:23:29,142 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 43 [2019-09-10 06:23:30,131 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 40 [2019-09-10 06:23:30,421 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 06:23:30,828 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 43 [2019-09-10 06:23:31,061 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-10 06:23:31,375 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 40 [2019-09-10 06:23:33,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:33,909 INFO L93 Difference]: Finished difference Result 75986 states and 96586 transitions. [2019-09-10 06:23:33,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-10 06:23:33,909 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 192 [2019-09-10 06:23:33,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:33,977 INFO L225 Difference]: With dead ends: 75986 [2019-09-10 06:23:33,978 INFO L226 Difference]: Without dead ends: 75848 [2019-09-10 06:23:33,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3324 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1763, Invalid=10009, Unknown=0, NotChecked=0, Total=11772 [2019-09-10 06:23:34,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75848 states. [2019-09-10 06:23:34,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75848 to 34333. [2019-09-10 06:23:34,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34333 states. [2019-09-10 06:23:34,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34333 states to 34333 states and 41613 transitions. [2019-09-10 06:23:34,412 INFO L78 Accepts]: Start accepts. Automaton has 34333 states and 41613 transitions. Word has length 192 [2019-09-10 06:23:34,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:34,413 INFO L475 AbstractCegarLoop]: Abstraction has 34333 states and 41613 transitions. [2019-09-10 06:23:34,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 06:23:34,413 INFO L276 IsEmpty]: Start isEmpty. Operand 34333 states and 41613 transitions. [2019-09-10 06:23:34,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 06:23:34,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:34,422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:23:34,423 INFO L418 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:34,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:34,423 INFO L82 PathProgramCache]: Analyzing trace with hash -700267924, now seen corresponding path program 1 times [2019-09-10 06:23:34,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:34,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:34,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:34,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:34,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:34,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:34,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:34,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:23:34,734 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:34,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:23:34,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:23:34,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:23:34,734 INFO L87 Difference]: Start difference. First operand 34333 states and 41613 transitions. Second operand 16 states. [2019-09-10 06:23:37,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:37,987 INFO L93 Difference]: Finished difference Result 67865 states and 86017 transitions. [2019-09-10 06:23:37,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 06:23:37,988 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 192 [2019-09-10 06:23:37,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:38,051 INFO L225 Difference]: With dead ends: 67865 [2019-09-10 06:23:38,052 INFO L226 Difference]: Without dead ends: 67865 [2019-09-10 06:23:38,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=519, Invalid=2133, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 06:23:38,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67865 states. [2019-09-10 06:23:38,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67865 to 34384. [2019-09-10 06:23:38,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34384 states. [2019-09-10 06:23:38,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34384 states to 34384 states and 41658 transitions. [2019-09-10 06:23:38,471 INFO L78 Accepts]: Start accepts. Automaton has 34384 states and 41658 transitions. Word has length 192 [2019-09-10 06:23:38,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:38,471 INFO L475 AbstractCegarLoop]: Abstraction has 34384 states and 41658 transitions. [2019-09-10 06:23:38,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:23:38,471 INFO L276 IsEmpty]: Start isEmpty. Operand 34384 states and 41658 transitions. [2019-09-10 06:23:38,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 06:23:38,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:38,481 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:23:38,481 INFO L418 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:38,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:38,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1539340773, now seen corresponding path program 1 times [2019-09-10 06:23:38,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:38,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:38,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:38,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:38,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:38,933 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 06:23:38,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:38,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 06:23:38,934 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:38,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 06:23:38,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 06:23:38,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:23:38,935 INFO L87 Difference]: Start difference. First operand 34384 states and 41658 transitions. Second operand 14 states. [2019-09-10 06:23:40,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:40,749 INFO L93 Difference]: Finished difference Result 45599 states and 57085 transitions. [2019-09-10 06:23:40,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 06:23:40,749 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 192 [2019-09-10 06:23:40,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:40,791 INFO L225 Difference]: With dead ends: 45599 [2019-09-10 06:23:40,791 INFO L226 Difference]: Without dead ends: 45579 [2019-09-10 06:23:40,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:23:40,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45579 states. [2019-09-10 06:23:41,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45579 to 31699. [2019-09-10 06:23:41,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31699 states. [2019-09-10 06:23:41,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31699 states to 31699 states and 38638 transitions. [2019-09-10 06:23:41,100 INFO L78 Accepts]: Start accepts. Automaton has 31699 states and 38638 transitions. Word has length 192 [2019-09-10 06:23:41,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:41,101 INFO L475 AbstractCegarLoop]: Abstraction has 31699 states and 38638 transitions. [2019-09-10 06:23:41,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 06:23:41,101 INFO L276 IsEmpty]: Start isEmpty. Operand 31699 states and 38638 transitions. [2019-09-10 06:23:41,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 06:23:41,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:41,108 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:23:41,109 INFO L418 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:41,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:41,109 INFO L82 PathProgramCache]: Analyzing trace with hash 639696134, now seen corresponding path program 1 times [2019-09-10 06:23:41,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:41,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:41,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:41,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:41,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:41,448 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 06:23:41,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:41,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:23:41,448 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:41,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:23:41,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:23:41,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:23:41,449 INFO L87 Difference]: Start difference. First operand 31699 states and 38638 transitions. Second operand 17 states. [2019-09-10 06:23:45,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:45,933 INFO L93 Difference]: Finished difference Result 56440 states and 71024 transitions. [2019-09-10 06:23:45,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-10 06:23:45,933 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 192 [2019-09-10 06:23:45,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:45,988 INFO L225 Difference]: With dead ends: 56440 [2019-09-10 06:23:45,988 INFO L226 Difference]: Without dead ends: 56440 [2019-09-10 06:23:45,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=842, Invalid=2940, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 06:23:46,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56440 states. [2019-09-10 06:23:46,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56440 to 32395. [2019-09-10 06:23:46,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32395 states. [2019-09-10 06:23:46,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32395 states to 32395 states and 39350 transitions. [2019-09-10 06:23:46,355 INFO L78 Accepts]: Start accepts. Automaton has 32395 states and 39350 transitions. Word has length 192 [2019-09-10 06:23:46,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:46,355 INFO L475 AbstractCegarLoop]: Abstraction has 32395 states and 39350 transitions. [2019-09-10 06:23:46,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:23:46,356 INFO L276 IsEmpty]: Start isEmpty. Operand 32395 states and 39350 transitions. [2019-09-10 06:23:46,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 06:23:46,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:46,364 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:23:46,364 INFO L418 AbstractCegarLoop]: === Iteration 120 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:46,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:46,364 INFO L82 PathProgramCache]: Analyzing trace with hash -845041832, now seen corresponding path program 1 times [2019-09-10 06:23:46,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:46,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:46,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:46,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:46,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:46,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:46,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:46,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 06:23:46,654 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:46,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 06:23:46,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 06:23:46,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:23:46,655 INFO L87 Difference]: Start difference. First operand 32395 states and 39350 transitions. Second operand 15 states. [2019-09-10 06:23:50,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:50,467 INFO L93 Difference]: Finished difference Result 55539 states and 69690 transitions. [2019-09-10 06:23:50,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-10 06:23:50,467 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 192 [2019-09-10 06:23:50,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:50,517 INFO L225 Difference]: With dead ends: 55539 [2019-09-10 06:23:50,518 INFO L226 Difference]: Without dead ends: 55539 [2019-09-10 06:23:50,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 940 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=793, Invalid=2747, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 06:23:50,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55539 states. [2019-09-10 06:23:50,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55539 to 30969. [2019-09-10 06:23:50,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30969 states. [2019-09-10 06:23:50,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30969 states to 30969 states and 37599 transitions. [2019-09-10 06:23:50,880 INFO L78 Accepts]: Start accepts. Automaton has 30969 states and 37599 transitions. Word has length 192 [2019-09-10 06:23:50,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:50,880 INFO L475 AbstractCegarLoop]: Abstraction has 30969 states and 37599 transitions. [2019-09-10 06:23:50,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 06:23:50,880 INFO L276 IsEmpty]: Start isEmpty. Operand 30969 states and 37599 transitions. [2019-09-10 06:23:50,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 06:23:50,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:50,888 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:23:50,888 INFO L418 AbstractCegarLoop]: === Iteration 121 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:50,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:50,888 INFO L82 PathProgramCache]: Analyzing trace with hash 802480351, now seen corresponding path program 1 times [2019-09-10 06:23:50,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:50,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:50,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:50,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:50,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:51,117 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 06:23:51,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:51,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:23:51,118 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:51,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:23:51,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:23:51,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:23:51,118 INFO L87 Difference]: Start difference. First operand 30969 states and 37599 transitions. Second operand 16 states. [2019-09-10 06:23:52,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:52,918 INFO L93 Difference]: Finished difference Result 44692 states and 55427 transitions. [2019-09-10 06:23:52,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 06:23:52,919 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 192 [2019-09-10 06:23:52,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:52,962 INFO L225 Difference]: With dead ends: 44692 [2019-09-10 06:23:52,962 INFO L226 Difference]: Without dead ends: 44424 [2019-09-10 06:23:52,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=219, Invalid=651, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:23:52,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44424 states. [2019-09-10 06:23:53,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44424 to 30663. [2019-09-10 06:23:53,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30663 states. [2019-09-10 06:23:53,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30663 states to 30663 states and 37290 transitions. [2019-09-10 06:23:53,250 INFO L78 Accepts]: Start accepts. Automaton has 30663 states and 37290 transitions. Word has length 192 [2019-09-10 06:23:53,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:53,251 INFO L475 AbstractCegarLoop]: Abstraction has 30663 states and 37290 transitions. [2019-09-10 06:23:53,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:23:53,251 INFO L276 IsEmpty]: Start isEmpty. Operand 30663 states and 37290 transitions. [2019-09-10 06:23:53,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 06:23:53,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:53,258 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:23:53,258 INFO L418 AbstractCegarLoop]: === Iteration 122 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:53,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:53,258 INFO L82 PathProgramCache]: Analyzing trace with hash -759935993, now seen corresponding path program 1 times [2019-09-10 06:23:53,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:53,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:53,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:53,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:53,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:53,576 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 06:23:53,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:53,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:23:53,577 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:53,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:23:53,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:23:53,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:23:53,577 INFO L87 Difference]: Start difference. First operand 30663 states and 37290 transitions. Second operand 16 states.