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_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:06:15,507 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:06:15,509 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:06:15,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:06:15,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:06:15,522 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:06:15,523 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:06:15,525 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:06:15,527 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:06:15,527 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:06:15,528 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:06:15,530 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:06:15,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:06:15,531 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:06:15,532 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:06:15,533 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:06:15,534 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:06:15,535 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:06:15,536 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:06:15,538 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:06:15,540 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:06:15,541 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:06:15,542 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:06:15,543 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:06:15,545 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:06:15,545 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:06:15,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:06:15,546 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:06:15,547 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:06:15,548 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:06:15,548 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:06:15,549 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:06:15,550 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:06:15,550 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:06:15,551 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:06:15,552 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:06:15,552 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:06:15,552 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:06:15,553 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:06:15,554 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:06:15,554 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:06:15,555 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 07:06:15,569 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:06:15,570 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:06:15,570 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:06:15,570 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:06:15,571 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:06:15,571 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:06:15,571 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:06:15,572 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:06:15,572 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:06:15,572 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:06:15,573 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:06:15,573 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:06:15,574 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:06:15,574 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:06:15,574 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:06:15,575 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:06:15,575 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:06:15,575 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:06:15,575 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:06:15,575 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:06:15,576 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:06:15,576 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:06:15,576 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:06:15,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:06:15,577 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:06:15,577 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:06:15,577 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:06:15,577 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:06:15,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:06:15,578 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:06:15,625 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:06:15,636 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:06:15,639 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:06:15,640 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:06:15,640 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:06:15,641 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 07:06:15,702 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/badd1f9f5/d43f6e13dee04f1081e7b75310f069b3/FLAG0b8c846b6 [2019-09-10 07:06:16,182 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:06:16,183 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 07:06:16,201 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/badd1f9f5/d43f6e13dee04f1081e7b75310f069b3/FLAG0b8c846b6 [2019-09-10 07:06:16,553 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/badd1f9f5/d43f6e13dee04f1081e7b75310f069b3 [2019-09-10 07:06:16,562 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:06:16,563 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:06:16,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:06:16,564 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:06:16,569 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:06:16,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:06:16" (1/1) ... [2019-09-10 07:06:16,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f650d71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:06:16, skipping insertion in model container [2019-09-10 07:06:16,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:06:16" (1/1) ... [2019-09-10 07:06:16,579 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:06:16,646 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:06:17,086 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:06:17,099 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:06:17,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:06:17,251 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:06:17,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:06:17 WrapperNode [2019-09-10 07:06:17,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:06:17,252 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:06:17,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:06:17,252 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:06:17,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:06:17" (1/1) ... [2019-09-10 07:06:17,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:06:17" (1/1) ... [2019-09-10 07:06:17,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:06:17" (1/1) ... [2019-09-10 07:06:17,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:06:17" (1/1) ... [2019-09-10 07:06:17,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:06:17" (1/1) ... [2019-09-10 07:06:17,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:06:17" (1/1) ... [2019-09-10 07:06:17,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:06:17" (1/1) ... [2019-09-10 07:06:17,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:06:17,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:06:17,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:06:17,343 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:06:17,346 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:06:17" (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 07:06:17,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:06:17,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:06:17,419 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:06:17,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:06:17,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:06:17,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:06:17,420 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:06:17,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:06:17,421 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:06:17,421 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:06:17,421 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:06:17,422 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:06:17,422 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:06:17,423 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:06:17,423 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:06:17,424 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:06:17,424 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:06:17,424 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:06:17,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:06:17,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:06:18,395 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:06:18,395 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:06:18,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:06:18 BoogieIcfgContainer [2019-09-10 07:06:18,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:06:18,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:06:18,398 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:06:18,401 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:06:18,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:06:16" (1/3) ... [2019-09-10 07:06:18,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@535944ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:06:18, skipping insertion in model container [2019-09-10 07:06:18,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:06:17" (2/3) ... [2019-09-10 07:06:18,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@535944ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:06:18, skipping insertion in model container [2019-09-10 07:06:18,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:06:18" (3/3) ... [2019-09-10 07:06:18,405 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 07:06:18,415 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:06:18,424 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:06:18,441 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:06:18,468 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:06:18,469 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:06:18,469 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:06:18,469 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:06:18,470 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:06:18,470 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:06:18,470 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:06:18,470 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:06:18,493 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states. [2019-09-10 07:06:18,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:06:18,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:18,509 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] [2019-09-10 07:06:18,512 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:18,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:18,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1388414232, now seen corresponding path program 1 times [2019-09-10 07:06:18,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:18,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:18,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:18,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:18,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:19,017 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 07:06:19,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:19,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:06:19,021 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:19,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:06:19,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:06:19,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:19,048 INFO L87 Difference]: Start difference. First operand 221 states. Second operand 3 states. [2019-09-10 07:06:19,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:19,212 INFO L93 Difference]: Finished difference Result 341 states and 562 transitions. [2019-09-10 07:06:19,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:06:19,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-09-10 07:06:19,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:19,241 INFO L225 Difference]: With dead ends: 341 [2019-09-10 07:06:19,241 INFO L226 Difference]: Without dead ends: 333 [2019-09-10 07:06:19,243 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 07:06:19,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-09-10 07:06:19,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2019-09-10 07:06:19,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-09-10 07:06:19,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 493 transitions. [2019-09-10 07:06:19,326 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 493 transitions. Word has length 85 [2019-09-10 07:06:19,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:19,327 INFO L475 AbstractCegarLoop]: Abstraction has 331 states and 493 transitions. [2019-09-10 07:06:19,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:06:19,327 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 493 transitions. [2019-09-10 07:06:19,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:06:19,333 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:19,333 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] [2019-09-10 07:06:19,334 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:19,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:19,335 INFO L82 PathProgramCache]: Analyzing trace with hash -368286742, now seen corresponding path program 1 times [2019-09-10 07:06:19,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:19,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:19,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:19,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:19,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:19,707 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 07:06:19,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:19,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:06:19,707 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:19,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:06:19,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:06:19,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:06:19,710 INFO L87 Difference]: Start difference. First operand 331 states and 493 transitions. Second operand 7 states. [2019-09-10 07:06:20,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:20,046 INFO L93 Difference]: Finished difference Result 1171 states and 1790 transitions. [2019-09-10 07:06:20,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:06:20,047 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-09-10 07:06:20,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:20,053 INFO L225 Difference]: With dead ends: 1171 [2019-09-10 07:06:20,054 INFO L226 Difference]: Without dead ends: 1171 [2019-09-10 07:06:20,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:06:20,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2019-09-10 07:06:20,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1163. [2019-09-10 07:06:20,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1163 states. [2019-09-10 07:06:20,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1786 transitions. [2019-09-10 07:06:20,112 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1786 transitions. Word has length 86 [2019-09-10 07:06:20,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:20,114 INFO L475 AbstractCegarLoop]: Abstraction has 1163 states and 1786 transitions. [2019-09-10 07:06:20,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:06:20,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1786 transitions. [2019-09-10 07:06:20,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:06:20,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:20,128 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] [2019-09-10 07:06:20,128 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:20,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:20,129 INFO L82 PathProgramCache]: Analyzing trace with hash -414926669, now seen corresponding path program 1 times [2019-09-10 07:06:20,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:20,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:20,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:20,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:20,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:20,255 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 07:06:20,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:20,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:06:20,256 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:20,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:06:20,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:06:20,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:06:20,259 INFO L87 Difference]: Start difference. First operand 1163 states and 1786 transitions. Second operand 5 states. [2019-09-10 07:06:20,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:20,608 INFO L93 Difference]: Finished difference Result 1963 states and 3029 transitions. [2019-09-10 07:06:20,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:06:20,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-10 07:06:20,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:20,621 INFO L225 Difference]: With dead ends: 1963 [2019-09-10 07:06:20,621 INFO L226 Difference]: Without dead ends: 1963 [2019-09-10 07:06:20,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:06:20,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2019-09-10 07:06:20,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1961. [2019-09-10 07:06:20,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1961 states. [2019-09-10 07:06:20,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 3028 transitions. [2019-09-10 07:06:20,673 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 3028 transitions. Word has length 87 [2019-09-10 07:06:20,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:20,675 INFO L475 AbstractCegarLoop]: Abstraction has 1961 states and 3028 transitions. [2019-09-10 07:06:20,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:06:20,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 3028 transitions. [2019-09-10 07:06:20,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:06:20,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:20,678 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] [2019-09-10 07:06:20,678 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:20,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:20,679 INFO L82 PathProgramCache]: Analyzing trace with hash 412481220, now seen corresponding path program 1 times [2019-09-10 07:06:20,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:20,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:20,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:20,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:20,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:20,818 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 07:06:20,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:20,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:06:20,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:20,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:06:20,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:06:20,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:06:20,820 INFO L87 Difference]: Start difference. First operand 1961 states and 3028 transitions. Second operand 5 states. [2019-09-10 07:06:21,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:21,147 INFO L93 Difference]: Finished difference Result 3543 states and 5494 transitions. [2019-09-10 07:06:21,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:06:21,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-10 07:06:21,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:21,166 INFO L225 Difference]: With dead ends: 3543 [2019-09-10 07:06:21,166 INFO L226 Difference]: Without dead ends: 3543 [2019-09-10 07:06:21,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:06:21,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3543 states. [2019-09-10 07:06:21,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3543 to 3541. [2019-09-10 07:06:21,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3541 states. [2019-09-10 07:06:21,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3541 states to 3541 states and 5493 transitions. [2019-09-10 07:06:21,263 INFO L78 Accepts]: Start accepts. Automaton has 3541 states and 5493 transitions. Word has length 87 [2019-09-10 07:06:21,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:21,264 INFO L475 AbstractCegarLoop]: Abstraction has 3541 states and 5493 transitions. [2019-09-10 07:06:21,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:06:21,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3541 states and 5493 transitions. [2019-09-10 07:06:21,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:06:21,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:21,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] [2019-09-10 07:06:21,267 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:21,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:21,267 INFO L82 PathProgramCache]: Analyzing trace with hash 549004962, now seen corresponding path program 1 times [2019-09-10 07:06:21,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:21,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:21,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:21,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:21,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:21,362 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 07:06:21,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:21,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:06:21,363 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:21,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:06:21,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:06:21,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:06:21,364 INFO L87 Difference]: Start difference. First operand 3541 states and 5493 transitions. Second operand 5 states. [2019-09-10 07:06:21,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:21,674 INFO L93 Difference]: Finished difference Result 6757 states and 10472 transitions. [2019-09-10 07:06:21,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:06:21,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-10 07:06:21,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:21,702 INFO L225 Difference]: With dead ends: 6757 [2019-09-10 07:06:21,703 INFO L226 Difference]: Without dead ends: 6757 [2019-09-10 07:06:21,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:06:21,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6757 states. [2019-09-10 07:06:21,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6757 to 6755. [2019-09-10 07:06:21,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6755 states. [2019-09-10 07:06:21,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6755 states to 6755 states and 10471 transitions. [2019-09-10 07:06:21,887 INFO L78 Accepts]: Start accepts. Automaton has 6755 states and 10471 transitions. Word has length 87 [2019-09-10 07:06:21,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:21,888 INFO L475 AbstractCegarLoop]: Abstraction has 6755 states and 10471 transitions. [2019-09-10 07:06:21,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:06:21,888 INFO L276 IsEmpty]: Start isEmpty. Operand 6755 states and 10471 transitions. [2019-09-10 07:06:21,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:06:21,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:21,891 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] [2019-09-10 07:06:21,892 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:21,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:21,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1246527343, now seen corresponding path program 1 times [2019-09-10 07:06:21,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:21,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:21,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:21,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:21,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:22,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:22,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:22,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:06:22,043 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:22,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:06:22,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:06:22,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:06:22,044 INFO L87 Difference]: Start difference. First operand 6755 states and 10471 transitions. Second operand 6 states. [2019-09-10 07:06:22,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:22,465 INFO L93 Difference]: Finished difference Result 19231 states and 29726 transitions. [2019-09-10 07:06:22,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:06:22,466 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-09-10 07:06:22,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:22,557 INFO L225 Difference]: With dead ends: 19231 [2019-09-10 07:06:22,557 INFO L226 Difference]: Without dead ends: 19231 [2019-09-10 07:06:22,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 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 07:06:22,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19231 states. [2019-09-10 07:06:22,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19231 to 19227. [2019-09-10 07:06:22,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19227 states. [2019-09-10 07:06:22,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19227 states to 19227 states and 29724 transitions. [2019-09-10 07:06:22,999 INFO L78 Accepts]: Start accepts. Automaton has 19227 states and 29724 transitions. Word has length 87 [2019-09-10 07:06:22,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:23,000 INFO L475 AbstractCegarLoop]: Abstraction has 19227 states and 29724 transitions. [2019-09-10 07:06:23,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:06:23,004 INFO L276 IsEmpty]: Start isEmpty. Operand 19227 states and 29724 transitions. [2019-09-10 07:06:23,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:06:23,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:23,010 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] [2019-09-10 07:06:23,010 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:23,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:23,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1749809536, now seen corresponding path program 1 times [2019-09-10 07:06:23,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:23,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:23,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:23,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:23,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:23,120 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 07:06:23,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:23,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:06:23,121 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:23,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:06:23,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:06:23,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:06:23,122 INFO L87 Difference]: Start difference. First operand 19227 states and 29724 transitions. Second operand 5 states. [2019-09-10 07:06:24,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:24,049 INFO L93 Difference]: Finished difference Result 38111 states and 58545 transitions. [2019-09-10 07:06:24,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:06:24,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-10 07:06:24,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:24,129 INFO L225 Difference]: With dead ends: 38111 [2019-09-10 07:06:24,130 INFO L226 Difference]: Without dead ends: 38111 [2019-09-10 07:06:24,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:06:24,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38111 states. [2019-09-10 07:06:24,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38111 to 38109. [2019-09-10 07:06:24,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38109 states. [2019-09-10 07:06:24,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38109 states to 38109 states and 58544 transitions. [2019-09-10 07:06:24,775 INFO L78 Accepts]: Start accepts. Automaton has 38109 states and 58544 transitions. Word has length 87 [2019-09-10 07:06:24,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:24,775 INFO L475 AbstractCegarLoop]: Abstraction has 38109 states and 58544 transitions. [2019-09-10 07:06:24,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:06:24,775 INFO L276 IsEmpty]: Start isEmpty. Operand 38109 states and 58544 transitions. [2019-09-10 07:06:24,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:06:24,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:24,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] [2019-09-10 07:06:24,785 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:24,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:24,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1607364171, now seen corresponding path program 1 times [2019-09-10 07:06:24,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:24,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:24,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:24,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:24,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:24,879 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 07:06:24,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:24,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:06:24,880 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:24,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:06:24,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:06:24,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:06:24,881 INFO L87 Difference]: Start difference. First operand 38109 states and 58544 transitions. Second operand 5 states. [2019-09-10 07:06:25,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:25,099 INFO L93 Difference]: Finished difference Result 71533 states and 109144 transitions. [2019-09-10 07:06:25,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:06:25,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-09-10 07:06:25,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:25,197 INFO L225 Difference]: With dead ends: 71533 [2019-09-10 07:06:25,197 INFO L226 Difference]: Without dead ends: 71533 [2019-09-10 07:06:25,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:06:25,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71533 states. [2019-09-10 07:06:25,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71533 to 38589. [2019-09-10 07:06:25,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38589 states. [2019-09-10 07:06:26,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38589 states to 38589 states and 59024 transitions. [2019-09-10 07:06:26,025 INFO L78 Accepts]: Start accepts. Automaton has 38589 states and 59024 transitions. Word has length 88 [2019-09-10 07:06:26,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:26,025 INFO L475 AbstractCegarLoop]: Abstraction has 38589 states and 59024 transitions. [2019-09-10 07:06:26,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:06:26,025 INFO L276 IsEmpty]: Start isEmpty. Operand 38589 states and 59024 transitions. [2019-09-10 07:06:26,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:06:26,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:26,035 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] [2019-09-10 07:06:26,035 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:26,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:26,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1987865476, now seen corresponding path program 1 times [2019-09-10 07:06:26,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:26,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:26,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:26,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:26,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:26,266 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 07:06:26,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:26,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:06:26,267 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:26,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:06:26,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:06:26,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:06:26,268 INFO L87 Difference]: Start difference. First operand 38589 states and 59024 transitions. Second operand 10 states. [2019-09-10 07:06:26,932 WARN L188 SmtUtils]: Spent 651.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-09-10 07:06:29,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:29,240 INFO L93 Difference]: Finished difference Result 112622 states and 169862 transitions. [2019-09-10 07:06:29,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:06:29,240 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 89 [2019-09-10 07:06:29,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:29,391 INFO L225 Difference]: With dead ends: 112622 [2019-09-10 07:06:29,391 INFO L226 Difference]: Without dead ends: 112622 [2019-09-10 07:06:29,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=247, Invalid=683, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:06:29,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112622 states. [2019-09-10 07:06:30,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112622 to 39176. [2019-09-10 07:06:30,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39176 states. [2019-09-10 07:06:30,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39176 states to 39176 states and 59889 transitions. [2019-09-10 07:06:30,211 INFO L78 Accepts]: Start accepts. Automaton has 39176 states and 59889 transitions. Word has length 89 [2019-09-10 07:06:30,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:30,211 INFO L475 AbstractCegarLoop]: Abstraction has 39176 states and 59889 transitions. [2019-09-10 07:06:30,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:06:30,212 INFO L276 IsEmpty]: Start isEmpty. Operand 39176 states and 59889 transitions. [2019-09-10 07:06:30,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:06:30,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:30,223 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] [2019-09-10 07:06:30,223 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:30,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:30,223 INFO L82 PathProgramCache]: Analyzing trace with hash 812355556, now seen corresponding path program 1 times [2019-09-10 07:06:30,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:30,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:30,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:30,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:30,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:30,305 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 07:06:30,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:30,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:06:30,306 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:30,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:06:30,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:06:30,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:06:30,308 INFO L87 Difference]: Start difference. First operand 39176 states and 59889 transitions. Second operand 4 states. [2019-09-10 07:06:30,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:30,489 INFO L93 Difference]: Finished difference Result 72138 states and 109398 transitions. [2019-09-10 07:06:30,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 07:06:30,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-10 07:06:30,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:30,595 INFO L225 Difference]: With dead ends: 72138 [2019-09-10 07:06:30,595 INFO L226 Difference]: Without dead ends: 72138 [2019-09-10 07:06:30,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:06:30,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72138 states. [2019-09-10 07:06:32,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72138 to 72136. [2019-09-10 07:06:32,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72136 states. [2019-09-10 07:06:32,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72136 states to 72136 states and 109397 transitions. [2019-09-10 07:06:32,379 INFO L78 Accepts]: Start accepts. Automaton has 72136 states and 109397 transitions. Word has length 89 [2019-09-10 07:06:32,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:32,380 INFO L475 AbstractCegarLoop]: Abstraction has 72136 states and 109397 transitions. [2019-09-10 07:06:32,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:06:32,380 INFO L276 IsEmpty]: Start isEmpty. Operand 72136 states and 109397 transitions. [2019-09-10 07:06:32,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:06:32,389 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:32,389 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] [2019-09-10 07:06:32,389 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:32,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:32,390 INFO L82 PathProgramCache]: Analyzing trace with hash 63635533, now seen corresponding path program 1 times [2019-09-10 07:06:32,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:32,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:32,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:32,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:32,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:32,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:32,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 07:06:32,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:32,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:06:32,454 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:32,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:06:32,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:06:32,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:32,455 INFO L87 Difference]: Start difference. First operand 72136 states and 109397 transitions. Second operand 3 states. [2019-09-10 07:06:32,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:32,654 INFO L93 Difference]: Finished difference Result 79188 states and 118094 transitions. [2019-09-10 07:06:32,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:06:32,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-10 07:06:32,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:32,907 INFO L225 Difference]: With dead ends: 79188 [2019-09-10 07:06:32,907 INFO L226 Difference]: Without dead ends: 78716 [2019-09-10 07:06:32,908 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 07:06:32,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78716 states. [2019-09-10 07:06:33,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78716 to 70910. [2019-09-10 07:06:33,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70910 states. [2019-09-10 07:06:33,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70910 states to 70910 states and 106085 transitions. [2019-09-10 07:06:33,901 INFO L78 Accepts]: Start accepts. Automaton has 70910 states and 106085 transitions. Word has length 90 [2019-09-10 07:06:33,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:33,901 INFO L475 AbstractCegarLoop]: Abstraction has 70910 states and 106085 transitions. [2019-09-10 07:06:33,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:06:33,901 INFO L276 IsEmpty]: Start isEmpty. Operand 70910 states and 106085 transitions. [2019-09-10 07:06:33,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:06:33,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:33,910 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] [2019-09-10 07:06:33,911 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:33,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:33,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1632884758, now seen corresponding path program 1 times [2019-09-10 07:06:33,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:33,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:33,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:33,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:33,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:33,970 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 07:06:33,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:33,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:06:33,970 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:33,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:06:33,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:06:33,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:33,971 INFO L87 Difference]: Start difference. First operand 70910 states and 106085 transitions. Second operand 3 states. [2019-09-10 07:06:35,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:35,659 INFO L93 Difference]: Finished difference Result 89556 states and 131810 transitions. [2019-09-10 07:06:35,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:06:35,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-10 07:06:35,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:35,726 INFO L225 Difference]: With dead ends: 89556 [2019-09-10 07:06:35,726 INFO L226 Difference]: Without dead ends: 89556 [2019-09-10 07:06:35,727 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 07:06:35,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89556 states. [2019-09-10 07:06:36,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89556 to 88798. [2019-09-10 07:06:36,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88798 states. [2019-09-10 07:06:36,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88798 states to 88798 states and 131053 transitions. [2019-09-10 07:06:36,451 INFO L78 Accepts]: Start accepts. Automaton has 88798 states and 131053 transitions. Word has length 90 [2019-09-10 07:06:36,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:36,451 INFO L475 AbstractCegarLoop]: Abstraction has 88798 states and 131053 transitions. [2019-09-10 07:06:36,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:06:36,451 INFO L276 IsEmpty]: Start isEmpty. Operand 88798 states and 131053 transitions. [2019-09-10 07:06:36,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:06:36,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:36,463 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] [2019-09-10 07:06:36,464 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:36,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:36,464 INFO L82 PathProgramCache]: Analyzing trace with hash -2017433619, now seen corresponding path program 1 times [2019-09-10 07:06:36,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:36,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:36,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:36,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:36,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:36,817 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 07:06:36,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:36,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:06:36,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:36,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:06:36,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:06:36,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:06:36,819 INFO L87 Difference]: Start difference. First operand 88798 states and 131053 transitions. Second operand 7 states. [2019-09-10 07:06:38,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:38,202 INFO L93 Difference]: Finished difference Result 287916 states and 418244 transitions. [2019-09-10 07:06:38,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:06:38,202 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-10 07:06:38,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:38,613 INFO L225 Difference]: With dead ends: 287916 [2019-09-10 07:06:38,613 INFO L226 Difference]: Without dead ends: 287916 [2019-09-10 07:06:38,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:06:38,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287916 states. [2019-09-10 07:06:42,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287916 to 102972. [2019-09-10 07:06:42,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102972 states. [2019-09-10 07:06:43,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102972 states to 102972 states and 151596 transitions. [2019-09-10 07:06:43,047 INFO L78 Accepts]: Start accepts. Automaton has 102972 states and 151596 transitions. Word has length 90 [2019-09-10 07:06:43,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:43,048 INFO L475 AbstractCegarLoop]: Abstraction has 102972 states and 151596 transitions. [2019-09-10 07:06:43,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:06:43,048 INFO L276 IsEmpty]: Start isEmpty. Operand 102972 states and 151596 transitions. [2019-09-10 07:06:43,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:06:43,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:43,057 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] [2019-09-10 07:06:43,057 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:43,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:43,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1079490452, now seen corresponding path program 1 times [2019-09-10 07:06:43,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:43,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:43,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:43,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:43,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:43,116 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 07:06:43,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:43,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:06:43,117 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:43,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:06:43,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:06:43,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:43,118 INFO L87 Difference]: Start difference. First operand 102972 states and 151596 transitions. Second operand 3 states. [2019-09-10 07:06:43,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:43,458 INFO L93 Difference]: Finished difference Result 114132 states and 164640 transitions. [2019-09-10 07:06:43,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:06:43,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-10 07:06:43,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:43,630 INFO L225 Difference]: With dead ends: 114132 [2019-09-10 07:06:43,630 INFO L226 Difference]: Without dead ends: 114132 [2019-09-10 07:06:43,630 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 07:06:43,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114132 states. [2019-09-10 07:06:45,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114132 to 113206. [2019-09-10 07:06:45,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113206 states. [2019-09-10 07:06:45,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113206 states to 113206 states and 163715 transitions. [2019-09-10 07:06:45,241 INFO L78 Accepts]: Start accepts. Automaton has 113206 states and 163715 transitions. Word has length 90 [2019-09-10 07:06:45,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:45,242 INFO L475 AbstractCegarLoop]: Abstraction has 113206 states and 163715 transitions. [2019-09-10 07:06:45,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:06:45,242 INFO L276 IsEmpty]: Start isEmpty. Operand 113206 states and 163715 transitions. [2019-09-10 07:06:45,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:06:45,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:45,251 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] [2019-09-10 07:06:45,252 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:45,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:45,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1593295700, now seen corresponding path program 1 times [2019-09-10 07:06:45,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:45,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:45,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:45,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:45,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:45,309 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 07:06:45,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:45,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:06:45,309 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:45,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:06:45,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:06:45,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:45,310 INFO L87 Difference]: Start difference. First operand 113206 states and 163715 transitions. Second operand 3 states. [2019-09-10 07:06:45,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:45,650 INFO L93 Difference]: Finished difference Result 161508 states and 229616 transitions. [2019-09-10 07:06:45,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:06:45,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-10 07:06:45,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:45,814 INFO L225 Difference]: With dead ends: 161508 [2019-09-10 07:06:45,814 INFO L226 Difference]: Without dead ends: 161508 [2019-09-10 07:06:45,815 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 07:06:45,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161508 states. [2019-09-10 07:06:49,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161508 to 160258. [2019-09-10 07:06:49,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160258 states. [2019-09-10 07:06:49,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160258 states to 160258 states and 228367 transitions. [2019-09-10 07:06:49,518 INFO L78 Accepts]: Start accepts. Automaton has 160258 states and 228367 transitions. Word has length 90 [2019-09-10 07:06:49,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:49,519 INFO L475 AbstractCegarLoop]: Abstraction has 160258 states and 228367 transitions. [2019-09-10 07:06:49,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:06:49,519 INFO L276 IsEmpty]: Start isEmpty. Operand 160258 states and 228367 transitions. [2019-09-10 07:06:49,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:06:49,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:49,529 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] [2019-09-10 07:06:49,530 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:49,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:49,530 INFO L82 PathProgramCache]: Analyzing trace with hash 327308374, now seen corresponding path program 1 times [2019-09-10 07:06:49,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:49,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:49,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:49,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:49,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:49,592 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 07:06:49,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:49,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:06:49,594 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:49,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:06:49,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:06:49,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:49,595 INFO L87 Difference]: Start difference. First operand 160258 states and 228367 transitions. Second operand 3 states. [2019-09-10 07:06:50,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:50,776 INFO L93 Difference]: Finished difference Result 278387 states and 392225 transitions. [2019-09-10 07:06:50,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:06:50,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-10 07:06:50,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:51,130 INFO L225 Difference]: With dead ends: 278387 [2019-09-10 07:06:51,130 INFO L226 Difference]: Without dead ends: 278387 [2019-09-10 07:06:51,133 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 07:06:51,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278387 states. [2019-09-10 07:06:56,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278387 to 277837. [2019-09-10 07:06:56,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277837 states. [2019-09-10 07:06:57,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277837 states to 277837 states and 391676 transitions. [2019-09-10 07:06:57,722 INFO L78 Accepts]: Start accepts. Automaton has 277837 states and 391676 transitions. Word has length 90 [2019-09-10 07:06:57,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:57,722 INFO L475 AbstractCegarLoop]: Abstraction has 277837 states and 391676 transitions. [2019-09-10 07:06:57,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:06:57,722 INFO L276 IsEmpty]: Start isEmpty. Operand 277837 states and 391676 transitions. [2019-09-10 07:06:57,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:06:57,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:57,740 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] [2019-09-10 07:06:57,740 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:57,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:57,741 INFO L82 PathProgramCache]: Analyzing trace with hash 810633430, now seen corresponding path program 1 times [2019-09-10 07:06:57,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:57,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:57,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:57,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:57,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:57,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 07:06:57,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:57,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:06:57,832 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:57,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:06:57,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:06:57,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:06:57,833 INFO L87 Difference]: Start difference. First operand 277837 states and 391676 transitions. Second operand 7 states. [2019-09-10 07:07:09,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:09,460 INFO L93 Difference]: Finished difference Result 1476263 states and 2060304 transitions. [2019-09-10 07:07:09,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:07:09,461 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-10 07:07:09,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:11,761 INFO L225 Difference]: With dead ends: 1476263 [2019-09-10 07:07:11,761 INFO L226 Difference]: Without dead ends: 1476263 [2019-09-10 07:07:11,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:07:12,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476263 states. [2019-09-10 07:07:28,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476263 to 278411. [2019-09-10 07:07:28,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278411 states. [2019-09-10 07:07:29,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278411 states to 278411 states and 392416 transitions. [2019-09-10 07:07:29,195 INFO L78 Accepts]: Start accepts. Automaton has 278411 states and 392416 transitions. Word has length 90 [2019-09-10 07:07:29,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:29,195 INFO L475 AbstractCegarLoop]: Abstraction has 278411 states and 392416 transitions. [2019-09-10 07:07:29,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:07:29,195 INFO L276 IsEmpty]: Start isEmpty. Operand 278411 states and 392416 transitions. [2019-09-10 07:07:29,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:07:29,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:29,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] [2019-09-10 07:07:29,208 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:29,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:29,208 INFO L82 PathProgramCache]: Analyzing trace with hash 108547188, now seen corresponding path program 1 times [2019-09-10 07:07:29,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:29,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:29,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:29,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:29,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:29,292 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 07:07:29,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:29,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:07:29,293 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:29,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:07:29,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:07:29,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:07:29,294 INFO L87 Difference]: Start difference. First operand 278411 states and 392416 transitions. Second operand 7 states. [2019-09-10 07:07:34,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:34,297 INFO L93 Difference]: Finished difference Result 1522720 states and 2131138 transitions. [2019-09-10 07:07:34,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:07:34,297 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-10 07:07:34,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:36,310 INFO L225 Difference]: With dead ends: 1522720 [2019-09-10 07:07:36,310 INFO L226 Difference]: Without dead ends: 1522720 [2019-09-10 07:07:36,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:07:47,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522720 states. [2019-09-10 07:07:56,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522720 to 278699. [2019-09-10 07:07:56,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278699 states. [2019-09-10 07:07:56,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278699 states to 278699 states and 392771 transitions. [2019-09-10 07:07:56,661 INFO L78 Accepts]: Start accepts. Automaton has 278699 states and 392771 transitions. Word has length 90 [2019-09-10 07:07:56,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:56,662 INFO L475 AbstractCegarLoop]: Abstraction has 278699 states and 392771 transitions. [2019-09-10 07:07:56,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:07:56,662 INFO L276 IsEmpty]: Start isEmpty. Operand 278699 states and 392771 transitions. [2019-09-10 07:07:56,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:07:56,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:56,674 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] [2019-09-10 07:07:56,674 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:56,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:56,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1883359786, now seen corresponding path program 1 times [2019-09-10 07:07:56,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:56,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:56,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:56,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:56,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:56,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:07:56,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:56,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:07:56,771 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:56,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:07:56,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:07:56,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:07:56,772 INFO L87 Difference]: Start difference. First operand 278699 states and 392771 transitions. Second operand 7 states. [2019-09-10 07:08:07,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:07,242 INFO L93 Difference]: Finished difference Result 1005875 states and 1405841 transitions. [2019-09-10 07:08:07,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:08:07,242 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-10 07:08:07,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:08,542 INFO L225 Difference]: With dead ends: 1005875 [2019-09-10 07:08:08,542 INFO L226 Difference]: Without dead ends: 1005875 [2019-09-10 07:08:08,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:08:09,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005875 states. [2019-09-10 07:08:15,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005875 to 278799. [2019-09-10 07:08:15,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278799 states. [2019-09-10 07:08:15,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278799 states to 278799 states and 392891 transitions. [2019-09-10 07:08:15,676 INFO L78 Accepts]: Start accepts. Automaton has 278799 states and 392891 transitions. Word has length 90 [2019-09-10 07:08:15,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:15,676 INFO L475 AbstractCegarLoop]: Abstraction has 278799 states and 392891 transitions. [2019-09-10 07:08:15,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:08:15,676 INFO L276 IsEmpty]: Start isEmpty. Operand 278799 states and 392891 transitions. [2019-09-10 07:08:15,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:08:15,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:15,691 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] [2019-09-10 07:08:15,691 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:15,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:15,692 INFO L82 PathProgramCache]: Analyzing trace with hash 633216594, now seen corresponding path program 1 times [2019-09-10 07:08:15,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:15,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:15,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:15,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:15,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:15,786 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 07:08:15,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:15,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:08:15,787 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:15,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:08:15,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:08:15,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:08:15,788 INFO L87 Difference]: Start difference. First operand 278799 states and 392891 transitions. Second operand 7 states. [2019-09-10 07:08:21,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:21,707 INFO L93 Difference]: Finished difference Result 1380161 states and 1921919 transitions. [2019-09-10 07:08:21,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:08:21,708 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-09-10 07:08:21,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:23,517 INFO L225 Difference]: With dead ends: 1380161 [2019-09-10 07:08:23,517 INFO L226 Difference]: Without dead ends: 1380161 [2019-09-10 07:08:23,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:08:34,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380161 states. [2019-09-10 07:08:41,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380161 to 279847. [2019-09-10 07:08:41,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279847 states. [2019-09-10 07:08:41,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279847 states to 279847 states and 394222 transitions. [2019-09-10 07:08:41,904 INFO L78 Accepts]: Start accepts. Automaton has 279847 states and 394222 transitions. Word has length 91 [2019-09-10 07:08:41,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:41,905 INFO L475 AbstractCegarLoop]: Abstraction has 279847 states and 394222 transitions. [2019-09-10 07:08:41,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:08:41,905 INFO L276 IsEmpty]: Start isEmpty. Operand 279847 states and 394222 transitions. [2019-09-10 07:08:41,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:08:41,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:41,924 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] [2019-09-10 07:08:41,925 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:41,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:41,925 INFO L82 PathProgramCache]: Analyzing trace with hash 682866744, now seen corresponding path program 1 times [2019-09-10 07:08:41,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:41,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:41,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:41,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:41,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:42,052 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 07:08:42,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:42,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:08:42,053 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:42,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:08:42,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:08:42,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:08:42,054 INFO L87 Difference]: Start difference. First operand 279847 states and 394222 transitions. Second operand 7 states. [2019-09-10 07:08:52,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:52,088 INFO L93 Difference]: Finished difference Result 1040357 states and 1465111 transitions. [2019-09-10 07:08:52,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:08:52,088 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-09-10 07:08:52,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:53,602 INFO L225 Difference]: With dead ends: 1040357 [2019-09-10 07:08:53,602 INFO L226 Difference]: Without dead ends: 1040357 [2019-09-10 07:08:53,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:08:54,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040357 states. [2019-09-10 07:09:01,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040357 to 332413. [2019-09-10 07:09:01,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332413 states. [2019-09-10 07:09:02,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332413 states to 332413 states and 467608 transitions. [2019-09-10 07:09:02,520 INFO L78 Accepts]: Start accepts. Automaton has 332413 states and 467608 transitions. Word has length 92 [2019-09-10 07:09:02,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:02,521 INFO L475 AbstractCegarLoop]: Abstraction has 332413 states and 467608 transitions. [2019-09-10 07:09:02,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:09:02,521 INFO L276 IsEmpty]: Start isEmpty. Operand 332413 states and 467608 transitions. [2019-09-10 07:09:02,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:09:02,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:02,538 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] [2019-09-10 07:09:02,539 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:02,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:02,539 INFO L82 PathProgramCache]: Analyzing trace with hash -150906399, now seen corresponding path program 1 times [2019-09-10 07:09:02,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:02,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:02,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:02,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:02,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:02,687 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 07:09:02,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:02,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:09:02,688 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:02,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:09:02,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:09:02,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:09:02,689 INFO L87 Difference]: Start difference. First operand 332413 states and 467608 transitions. Second operand 7 states. [2019-09-10 07:09:06,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:06,550 INFO L93 Difference]: Finished difference Result 1052755 states and 1480249 transitions. [2019-09-10 07:09:06,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:09:06,551 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-09-10 07:09:06,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:16,528 INFO L225 Difference]: With dead ends: 1052755 [2019-09-10 07:09:16,529 INFO L226 Difference]: Without dead ends: 1052755 [2019-09-10 07:09:16,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:09:17,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052755 states. [2019-09-10 07:09:24,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052755 to 388263. [2019-09-10 07:09:24,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388263 states. [2019-09-10 07:09:25,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388263 states to 388263 states and 546727 transitions. [2019-09-10 07:09:25,121 INFO L78 Accepts]: Start accepts. Automaton has 388263 states and 546727 transitions. Word has length 92 [2019-09-10 07:09:25,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:25,122 INFO L475 AbstractCegarLoop]: Abstraction has 388263 states and 546727 transitions. [2019-09-10 07:09:25,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:09:25,122 INFO L276 IsEmpty]: Start isEmpty. Operand 388263 states and 546727 transitions. [2019-09-10 07:09:25,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:09:25,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:25,136 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] [2019-09-10 07:09:25,136 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:25,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:25,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1836656065, now seen corresponding path program 1 times [2019-09-10 07:09:25,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:25,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:25,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:25,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:25,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:25,260 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 07:09:25,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:25,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:09:25,260 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:25,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:09:25,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:09:25,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:09:25,262 INFO L87 Difference]: Start difference. First operand 388263 states and 546727 transitions. Second operand 7 states. [2019-09-10 07:09:33,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:33,319 INFO L93 Difference]: Finished difference Result 1072773 states and 1509471 transitions. [2019-09-10 07:09:33,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:09:33,319 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-09-10 07:09:33,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:36,074 INFO L225 Difference]: With dead ends: 1072773 [2019-09-10 07:09:36,074 INFO L226 Difference]: Without dead ends: 1072773 [2019-09-10 07:09:36,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:09:36,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072773 states. [2019-09-10 07:09:50,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072773 to 463641. [2019-09-10 07:09:50,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463641 states. [2019-09-10 07:09:51,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463641 states to 463641 states and 653288 transitions. [2019-09-10 07:09:51,044 INFO L78 Accepts]: Start accepts. Automaton has 463641 states and 653288 transitions. Word has length 92 [2019-09-10 07:09:51,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:51,044 INFO L475 AbstractCegarLoop]: Abstraction has 463641 states and 653288 transitions. [2019-09-10 07:09:51,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:09:51,044 INFO L276 IsEmpty]: Start isEmpty. Operand 463641 states and 653288 transitions. [2019-09-10 07:09:52,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:09:52,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:52,512 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] [2019-09-10 07:09:52,513 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:52,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:52,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1617894879, now seen corresponding path program 1 times [2019-09-10 07:09:52,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:52,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:52,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:52,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:52,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:52,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:09:52,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:52,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:09:52,713 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:52,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:09:52,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:09:52,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:09:52,715 INFO L87 Difference]: Start difference. First operand 463641 states and 653288 transitions. Second operand 7 states. [2019-09-10 07:09:57,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:57,176 INFO L93 Difference]: Finished difference Result 1129795 states and 1589173 transitions. [2019-09-10 07:09:57,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:09:57,176 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-09-10 07:09:57,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:58,818 INFO L225 Difference]: With dead ends: 1129795 [2019-09-10 07:09:58,818 INFO L226 Difference]: Without dead ends: 1129795 [2019-09-10 07:09:58,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:10:10,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129795 states. [2019-09-10 07:10:18,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129795 to 531491. [2019-09-10 07:10:18,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531491 states. [2019-09-10 07:10:20,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531491 states to 531491 states and 749622 transitions. [2019-09-10 07:10:20,218 INFO L78 Accepts]: Start accepts. Automaton has 531491 states and 749622 transitions. Word has length 92 [2019-09-10 07:10:20,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:20,218 INFO L475 AbstractCegarLoop]: Abstraction has 531491 states and 749622 transitions. [2019-09-10 07:10:20,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:10:20,218 INFO L276 IsEmpty]: Start isEmpty. Operand 531491 states and 749622 transitions. [2019-09-10 07:10:20,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:10:20,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:20,233 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] [2019-09-10 07:10:20,234 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:20,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:20,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1969136391, now seen corresponding path program 1 times [2019-09-10 07:10:20,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:20,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:20,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:20,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:20,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:20,358 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 07:10:20,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:20,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:10:20,359 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:20,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:10:20,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:10:20,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:10:20,360 INFO L87 Difference]: Start difference. First operand 531491 states and 749622 transitions. Second operand 7 states. [2019-09-10 07:10:30,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:30,129 INFO L93 Difference]: Finished difference Result 1139155 states and 1603317 transitions. [2019-09-10 07:10:30,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:10:30,130 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-09-10 07:10:30,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:32,564 INFO L225 Difference]: With dead ends: 1139155 [2019-09-10 07:10:32,564 INFO L226 Difference]: Without dead ends: 1139155 [2019-09-10 07:10:32,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:10:33,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139155 states. [2019-09-10 07:10:40,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139155 to 574701. [2019-09-10 07:10:40,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574701 states. [2019-09-10 07:10:54,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574701 states to 574701 states and 810930 transitions. [2019-09-10 07:10:54,376 INFO L78 Accepts]: Start accepts. Automaton has 574701 states and 810930 transitions. Word has length 93 [2019-09-10 07:10:54,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:54,376 INFO L475 AbstractCegarLoop]: Abstraction has 574701 states and 810930 transitions. [2019-09-10 07:10:54,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:10:54,377 INFO L276 IsEmpty]: Start isEmpty. Operand 574701 states and 810930 transitions. [2019-09-10 07:10:54,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:10:54,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:54,402 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] [2019-09-10 07:10:54,402 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:54,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:54,402 INFO L82 PathProgramCache]: Analyzing trace with hash 276264736, now seen corresponding path program 1 times [2019-09-10 07:10:54,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:54,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:54,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:54,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:54,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:54,655 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 07:10:54,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:54,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:10:54,655 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:54,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:10:54,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:10:54,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:10:54,657 INFO L87 Difference]: Start difference. First operand 574701 states and 810930 transitions. Second operand 10 states. [2019-09-10 07:11:14,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:14,667 INFO L93 Difference]: Finished difference Result 1894614 states and 2667672 transitions. [2019-09-10 07:11:14,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 07:11:14,668 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-09-10 07:11:14,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:17,400 INFO L225 Difference]: With dead ends: 1894614 [2019-09-10 07:11:17,401 INFO L226 Difference]: Without dead ends: 1894614 [2019-09-10 07:11:17,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=236, Invalid=694, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:11:18,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894614 states. [2019-09-10 07:11:33,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894614 to 573723. [2019-09-10 07:11:33,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573723 states. [2019-09-10 07:11:34,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573723 states to 573723 states and 809570 transitions. [2019-09-10 07:11:34,505 INFO L78 Accepts]: Start accepts. Automaton has 573723 states and 809570 transitions. Word has length 97 [2019-09-10 07:11:34,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:34,505 INFO L475 AbstractCegarLoop]: Abstraction has 573723 states and 809570 transitions. [2019-09-10 07:11:34,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:11:34,505 INFO L276 IsEmpty]: Start isEmpty. Operand 573723 states and 809570 transitions. [2019-09-10 07:11:36,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:11:36,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:36,028 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] [2019-09-10 07:11:36,028 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:36,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:36,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1177238946, now seen corresponding path program 1 times [2019-09-10 07:11:36,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:36,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:36,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:36,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:36,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:36,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:11:36,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:36,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:11:36,239 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:36,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:11:36,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:11:36,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:11:36,240 INFO L87 Difference]: Start difference. First operand 573723 states and 809570 transitions. Second operand 10 states. [2019-09-10 07:11:57,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:57,386 INFO L93 Difference]: Finished difference Result 2223129 states and 3110986 transitions. [2019-09-10 07:11:57,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 07:11:57,386 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-09-10 07:11:57,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:00,664 INFO L225 Difference]: With dead ends: 2223129 [2019-09-10 07:12:00,664 INFO L226 Difference]: Without dead ends: 2223129 [2019-09-10 07:12:00,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:12:03,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2223129 states. [2019-09-10 07:12:31,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2223129 to 572883. [2019-09-10 07:12:31,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572883 states. [2019-09-10 07:12:32,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572883 states to 572883 states and 808338 transitions. [2019-09-10 07:12:32,661 INFO L78 Accepts]: Start accepts. Automaton has 572883 states and 808338 transitions. Word has length 97 [2019-09-10 07:12:32,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:32,661 INFO L475 AbstractCegarLoop]: Abstraction has 572883 states and 808338 transitions. [2019-09-10 07:12:32,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:12:32,661 INFO L276 IsEmpty]: Start isEmpty. Operand 572883 states and 808338 transitions. [2019-09-10 07:12:32,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:12:32,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:32,679 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] [2019-09-10 07:12:32,679 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:32,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:32,680 INFO L82 PathProgramCache]: Analyzing trace with hash 426681605, now seen corresponding path program 1 times [2019-09-10 07:12:32,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:32,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:32,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:32,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:32,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:32,881 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 07:12:32,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:32,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:12:32,882 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:32,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:12:32,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:12:32,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:12:32,883 INFO L87 Difference]: Start difference. First operand 572883 states and 808338 transitions. Second operand 10 states. [2019-09-10 07:12:53,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:53,126 INFO L93 Difference]: Finished difference Result 2648489 states and 3713586 transitions. [2019-09-10 07:12:53,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 07:12:53,127 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-09-10 07:12:53,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:58,862 INFO L225 Difference]: With dead ends: 2648489 [2019-09-10 07:12:58,863 INFO L226 Difference]: Without dead ends: 2648489 [2019-09-10 07:12:58,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=345, Invalid=1061, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 07:13:00,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648489 states. [2019-09-10 07:13:29,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648489 to 572226. [2019-09-10 07:13:29,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572226 states. [2019-09-10 07:13:32,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572226 states to 572226 states and 807289 transitions. [2019-09-10 07:13:32,542 INFO L78 Accepts]: Start accepts. Automaton has 572226 states and 807289 transitions. Word has length 97 [2019-09-10 07:13:32,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:32,542 INFO L475 AbstractCegarLoop]: Abstraction has 572226 states and 807289 transitions. [2019-09-10 07:13:32,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:13:32,542 INFO L276 IsEmpty]: Start isEmpty. Operand 572226 states and 807289 transitions. [2019-09-10 07:13:32,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:13:32,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:32,560 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] [2019-09-10 07:13:32,560 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:32,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:32,560 INFO L82 PathProgramCache]: Analyzing trace with hash -103950007, now seen corresponding path program 1 times [2019-09-10 07:13:32,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:32,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:32,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:32,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:32,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:32,778 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 07:13:32,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:32,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:13:32,778 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:32,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:13:32,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:13:32,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:13:32,779 INFO L87 Difference]: Start difference. First operand 572226 states and 807289 transitions. Second operand 10 states. [2019-09-10 07:14:00,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:00,645 INFO L93 Difference]: Finished difference Result 2671791 states and 3732490 transitions. [2019-09-10 07:14:00,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 07:14:00,645 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-09-10 07:14:00,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:05,743 INFO L225 Difference]: With dead ends: 2671791 [2019-09-10 07:14:05,744 INFO L226 Difference]: Without dead ends: 2671791 [2019-09-10 07:14:05,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:14:07,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2671791 states. [2019-09-10 07:14:26,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2671791 to 572343. [2019-09-10 07:14:26,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572343 states. [2019-09-10 07:14:28,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572343 states to 572343 states and 807220 transitions. [2019-09-10 07:14:28,760 INFO L78 Accepts]: Start accepts. Automaton has 572343 states and 807220 transitions. Word has length 97 [2019-09-10 07:14:28,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:28,760 INFO L475 AbstractCegarLoop]: Abstraction has 572343 states and 807220 transitions. [2019-09-10 07:14:28,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:14:28,761 INFO L276 IsEmpty]: Start isEmpty. Operand 572343 states and 807220 transitions. [2019-09-10 07:14:28,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:14:28,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:28,774 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] [2019-09-10 07:14:28,774 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:28,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:28,775 INFO L82 PathProgramCache]: Analyzing trace with hash -156174122, now seen corresponding path program 1 times [2019-09-10 07:14:28,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:28,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:28,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:28,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:28,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:29,338 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2019-09-10 07:14:29,580 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 07:14:29,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:29,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 07:14:29,580 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:29,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 07:14:29,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 07:14:29,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:14:29,581 INFO L87 Difference]: Start difference. First operand 572343 states and 807220 transitions. Second operand 14 states. [2019-09-10 07:14:30,134 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-10 07:14:30,291 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-10 07:14:30,457 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2019-09-10 07:14:30,599 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-09-10 07:14:44,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:44,286 INFO L93 Difference]: Finished difference Result 2124434 states and 2973590 transitions. [2019-09-10 07:14:44,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:14:44,287 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 98 [2019-09-10 07:14:44,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:47,227 INFO L225 Difference]: With dead ends: 2124434 [2019-09-10 07:14:47,228 INFO L226 Difference]: Without dead ends: 2124434 [2019-09-10 07:14:47,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=202, Invalid=554, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:14:49,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2124434 states. [2019-09-10 07:15:19,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2124434 to 1078665. [2019-09-10 07:15:19,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1078665 states. [2019-09-10 07:15:20,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078665 states to 1078665 states and 1518172 transitions. [2019-09-10 07:15:20,827 INFO L78 Accepts]: Start accepts. Automaton has 1078665 states and 1518172 transitions. Word has length 98 [2019-09-10 07:15:20,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:20,827 INFO L475 AbstractCegarLoop]: Abstraction has 1078665 states and 1518172 transitions. [2019-09-10 07:15:20,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 07:15:20,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1078665 states and 1518172 transitions. [2019-09-10 07:15:23,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:15:23,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:23,428 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] [2019-09-10 07:15:23,428 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:23,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:23,429 INFO L82 PathProgramCache]: Analyzing trace with hash 492290689, now seen corresponding path program 1 times [2019-09-10 07:15:23,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:23,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:23,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:23,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:23,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:23,960 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 07:15:23,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:23,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:15:23,961 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:23,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:15:23,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:15:23,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:15:23,962 INFO L87 Difference]: Start difference. First operand 1078665 states and 1518172 transitions. Second operand 13 states. [2019-09-10 07:15:55,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:55,120 INFO L93 Difference]: Finished difference Result 4720476 states and 6611892 transitions. [2019-09-10 07:15:55,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 07:15:55,120 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 98 [2019-09-10 07:15:55,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted.